The complexity of soft constraint satisfaction

Artificial Intelligence

Volumn 170, Issue 11, 2006, Pages 983-1016

  Cohen, David A ^a   Cooper, Martin C ^b   Jeavons, Peter G ^c   Krokhin, Andrei A ^d  

^a UNIVERSITY OF LONDON   (United Kingdom)

^b IRIT   (France)

^c UNIVERSITY OF OXFORD   (United Kingdom)

^d DURHAM UNIVERSITY   (United Kingdom)

Author keywords

Combinatorial optimisation; Multimorphism; Soft constraints; Submodular functions; Tractability; Valued constraint satisfaction

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBLEM SOLVING; SET THEORY;

COMBINATORIAL OPTIMIZATIONS; MULTIMORPHISM; SOFT CONSTRAINTS; SUBMODULAR FUNCTIONS; TRACTABILITY; VALUED CONSTRAINT SATISFACTION;

CONSTRAINT THEORY;

EID: 33745822390     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2006.04.002     Document Type: Article

References (47)

1. Bistarelli S., Fargier H., Montanari U., Rossi F., Schiex T., and Verfaillie G. Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison. Constraints 4 (1999) 199-240
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. Boros E., and Hammer P.L. Pseudo-boolean optimization. Discrete Applied Mathematics 123 (2002) 155-225
4. Bulatov A.A. A dichotomy theorem for constraint satisfaction problems on a 3-element set. Journal of the ACM 53 (2006) 66-120
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
6. Bulatov A.A., Jeavons P.G., and Krokhin A.A. Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34 (2005) 720-742
7. Cohen D., Cooper M., Jeavons P., and Krokhin A. A maximal tractable class of soft constraints. Journal of Artificial Intelligence Research 22 (2004) 1-22
8. Cooper M.C., Cohen D.A., and Jeavons P.G. Characterising tractable constraints. Artificial Intelligence 65 (1994) 347-361
9. Creignou N. A dichotomy theorem for maximum generalized satisfiability problems. Journal of Computer and System Sciences 51 (1995) 511-522
10. Creignou N., Khanna S., and Sudan M. Complexity Classification of Boolean Constraint Satisfaction Problems. SIAM Monographs on Discrete Mathematics and Applications vol. 7 (2001), Society for Industrial and Applied Mathematics
11. Cunningham W.H. Minimum cuts, modular functions, and matroid polyhedra. Networks 15 2 (1985) 205-215
12. Dahlhaus E., Johnson D.S., Papadimitriou C.H., Seymour P.D., and Yannakakis M. The complexity of multiterminal cuts. SIAM Journal on Computing 23 4 (1994) 864-894
13. Dalmau V. Generalized majority-minority operations are tractable. Proceedings 20th IEEE Symposium on Logic in Computer Science (LICS 2005) (2005), IEEE Computer Society 438-447
14. Dechter R. Constraint Processing (2003), Morgan Kaufmann
15. Feder T., and Vardi M.Y. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing 28 (1998) 57-104
16. L. Fleischer, S. Iwata, Improved algorithms for submodular function minimization and submodular flow, in: Proceedings of the 32th Annual ACM Symposium on Theory of Computing, 2000, pp. 107-116
17. Freuder E.C., and Wallace R. Partial constraint satisfaction. Artificial Intelligence 58 (1992) 21-70
18. Fujishige S., and Iwata S. Bisubmodular function minimization. Integer Programming and Combinatorial Optimization: 8th International IPCO Conference. Lecture Notes in Computer Science vol. 2081 (2001), Springer, Berlin 160-169
19. Garey M., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco, CA
20. Grötschel M., Lovasz L., and Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (1981) 169-198
21. Gutin G., Rafiey A., and Yeo A. Minimum cost and list homomorphisms to semicomplete digraphs. Discrete Applied Mathematics 154 (2006) 890-897
22. Gutin G., Rafiey A., and Yeo A. Level of repair analysis and minimum cost homomorphisms of graphs. Discrete Applied Mathematics 154 (2006) 881-889
23. Iwata S., Fleischer L., and Fujishige S. A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM 48 4 (2001) 761-777
24. Jeavons P.G. On the algebraic structure of combinatorial problems. Theoretical Computer Science 200 (1998) 185-204
25. Jeavons P.G., Cohen D.A., and Cooper M.C. Constraints, consistency and closure. Artificial Intelligence 101 1-2 (1998) 251-265
26. Jeavons P.G., Cohen D.A., and Gyssens M. Closure properties of constraints. Journal of the ACM 44 (1997) 527-548
27. Jeavons P.G., Cohen D.A., and Gyssens M. How to determine the expressive power of constraints. Constraints 4 (1999) 113-131
28. Jeavons P.G., Cohen D.A., and Pearson J.K. Constraints and universal algebra. Annals of Mathematics and Artificial Intelligence 24 (1998) 51-67
29. Jeavons P.G., and Cooper M.C. Tractable constraints on ordered domains. Artificial Intelligence 79 2 (1995) 327-339
30. Khanna S., Sudan M., Trevisan L., and Williamson D. The approximability of constraint satisfaction problems. SIAM Journal on Computing 30 6 (2001) 1863-1920
31. L. Khatib, P.H. Morris, R.A. Morris, F. Rossi, Temporal constraint reasoning with preferences, in: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), Seattle, US, 2001, pp. 322-327
32. Kirousis L. Fast parallel constraint satisfaction. Artificial Intelligence 64 (1993) 147-160
33. Krokhin A., Bulatov A., and Jeavons P. The complexity of constraint satisfaction: An algebraic approach. Proceedings of the NATO Advanced Study Institute on Structural Theory of Automata, Semigroups and Universal Algebra. NATO Science Series II: Mathematics, Physics and Chemistry vol. 207 (2005), Springer, Berlin 181-213
34. Larrosa J., Meseguer P., and Schiex T. Maintaining reversible DAC for Max-CSP. Artificial Intelligence 107 (1999) 149-163
35. Larrosa J., and Schiex T. Solving weighted CSP by maintaining arc consistency. Artificial Intelligence 159 (2004) 1-26
36. Mackworth A.K., and Freuder E.C. The complexity of constraint satisfaction revisited. Artificial Intelligence 59 (1993) 57-62
37. Mohr R., and Masini G. Good old discrete relaxation. In: Kodratoff Y. (Ed). Proceedings 8th European Conference on Artificial Intelligence-ECAI'88 (1988), Pitman 651-656
38. Montanari U. Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences 7 (1974) 95-132
39. Nemhauser G.L., and Wolsey L.A. Integer and Combinatorial Optimization (1988), John Wiley & Sons
40. J.K. Pearson, P.G. Jeavons, A survey of tractable constraint satisfaction problems, Technical Report CSD-TR-97-15, Royal Holloway, University of London, July 1997
41. Pöschel R., and Kalužnin L.A. Funktionen- und Relationenalgebren (1979), DVW, Berlin
42. T.J. Schaefer, The complexity of satisfiability problems, in: Proceedings 10th ACM Symposium on Theory of Computing, STOC'78, 1978, pp. 216-226
43. T. Schiex, H. Fargier, G. Verfaillie, Valued constraint satisfaction problems: hard and easy problems, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI'95), Montreal, Canada, 1995, pp. 631-637
44. Schrijver A. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. JCTB: Journal of Combinatorial Theory, Series B 80 (2000) 346-355
45. Schrijver A. Combinatorial Optimization: Polyhedra and Efficiency. Algorithms and Combinatorics vol. 24 (2003), Springer, Berlin
46. Szendrei A. Clones in Universal Algebra. Seminaires de Mathematiques Superieures vol. 99 (1986), University of Montreal, Montreal
47. van Hentenryck P., and Deville Y. A generic arc-consistency algorithm and its specializations. Artificial Intelligence 57 (1992) 291-321