The complexity of soft constraint satisfaction-Reference-Cited by-同舟云学术

The complexity of soft constraint satisfaction

Published:2006-08 Issue:11 Volume:170 Page:983-1016
ISSN:0004-3702
Container-title:Artificial Intelligence
language:en
Short-container-title:Artificial Intelligence

Author:

Cohen David A.,Cooper Martin C.,Jeavons Peter G.,Krokhin Andrei A.

Publisher

Elsevier BV

Subject

Artificial Intelligence,Linguistics and Language,Language and Linguistics

Reference47 articles.

1. Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison;Bistarelli;Constraints,1999

2. S. Bistarelli, U. Montanari, F. Rossi, Constraint solving over semirings, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI'95), Montreal, Canada, 1995, pp. 624–630

3. Pseudo-boolean optimization;Boros;Discrete Applied Mathematics,2002

4. A dichotomy theorem for constraint satisfaction problems on a 3-element set;Bulatov;Journal of the ACM,2006

5. A.A. Bulatov, A.A. Krokhin, P.G. Jeavons, The complexity of maximal constraint languages, in: Proceedings 33rd ACM Symposium on Theory of Computing, STOC'01, 2001, pp. 667–674

Cited by 89 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algebraic Approach to Approximation;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Tractability of explaining classifier decisions;Artificial Intelligence;2023-03

3. Minimizing submodular functions on diamonds via generalized fractional matroid matchings;Journal of Combinatorial Theory, Series B;2022-11

4. Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation;ACM Transactions on Computational Logic;2022-01-31

5. The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side;SIAM Journal on Computing;2022-01-25