Soft constraints: Complexity and multimorphisms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2833, Issue , 2003, Pages 244-258

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

^a UNIVERSITY OF LONDON   (United Kingdom)

^b IRIT   (France)

^c UNIVERSITY OF OXFORD   (United Kingdom)

^d UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; CONSTRAINT THEORY; OPTIMIZATION;

ALGEBRAIC OPERATIONS; CONSTRAINT TYPES; SOFT CONSTRAINT; THEORETICAL DEVELOPMENT;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35248836414     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45193-8_17     Document Type: Article

References (31)

1. S. Bistarelli, H. Fargier, U. Montanari, F. Rossi, T. Schiex, and G. Verfaillie. Semiring-based CSPs and valued CSPs: Frameworks, properties, and comparison. Constraints, 4:199-240, 1999.
2. M. Bjäreland and P. Jonsson. Exploiting bipartiteness to identify yet another tractable subclass of CSP. In J. Jaffar, editor, Principles and Practice of Constraint Programming - CP'99, volume 1713 of Lecture Notes in Computer Science, pages 118-128. Springer-Verlag, 1999.
3. A.A. Bulatov. A dichotomy theorem for constraints on a three-element set. In Proceedings 43rd IEEE Symposium on Foundations of Computer Science, FOCS'02, pages 649-658. IEEE Computer Society, 2002.
4. A.A. Bulatov, A.A. Krokhin, and P.G. Jeavons. Constraint satisfaction problems and finite algebras. In Proceedings 27th International Colloquium on Automata, Languages and Programming, ICALP'00, volume 1853 of Lecture Notes in Computer Science, pages 272-282. Springer-Verlag, 2000.
5. A.A. Bulatov, A.A. Krokhin, and P.G. Jeavons. The complexity of maximal constraint languages. In Proceedings 33rd ACM Symposium on Theory of Computing, STOC'01, pages 667-674, 2001.
6. D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin. A tractable class of soft constraints. Technical Report CSD-TR-02-14, Computer Science Department, Royal Holloway, University of London, Egham, Surrey, UK, December 2002 (short version to appear in Proceedings of IJCAI'03).
7. D. Cohen, M. Cooper, P. Jeavons, and A. Krokhin. An investigation of the multimorphisms of tractable and intractable classes of valued constraints. Technical Report CSD-TR-03-03, Computer Science Department, Royal Holloway, University of London, Egham, Surrey, UK, 2003.
8. M.C. Cooper, D.A. Cohen, and P.G. Jeavons. Characterising tractable constraints. Artificial Intelligence, 65:347-361, 1994.
9. N. Creignou, S. Khanna, and M. Sudan. Complexity Classification of Boolean Constraint Satisfaction Problems, volume 7 of SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia, PA., 2001.
10. W.H. Cunningham. Minimum cuts, modular functions,and matroid polyhedra. Networks, 15(2):205-215, 1985.
11. E. Dahlhaus, D.S. Johnson, C.H. Papadimitriou, P.D. Seymour, and M. Yannakakis. The complexity of multiterminal cuts. SIAM Journal on Computing, 23(4):864-894, 1994.
12. T. Feder and M.Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal of Computing, 28:57-104, 1998.
13. L. Fleischer and S. Iwata. Improved algorithms for submodular function minimization and submodular flow. In Proceedings of the 32th Annual ACM Symposium on Theory of Computing, pages 107-116, 2000.
14. S. Fujishige and S. Iwata. Bisubmodular function minimization. Lecture Notes in Computer Science, 2081:160-169, 2001.
15. M. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA., 1979.
16. M. Grötschel, L. Lovasz, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169-198, 1981.
17. S. Iwata, L. Fleischer, and S. Fujishige. A combinatorial strongly polynomial algorithm for minimizing submodular functions. Journal of the ACM, 48(4):761-777, 2001.
18. P.G. Jeavons, D.A. Cohen, and M.C. Cooper. Constraints, consistency and closure. Artificial Intelligence, 101(1-2): 251-265, 1998.
19. P.G. Jeavons, D.A. Cohen, and M. Gyssens. A test for tractability. In Proceedings 2nd International Conference on Constraint Programming - CP'96, volume 1118 of Lecture Notes in Computer Science, pages 267-281. Springer-Verlag, 1996.
20. P.G. Jeavons, D.A. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44:527-548, 1997.
21. P.G. Jeavons, D.A. Cohen, and M. Gyssens. How to determine the expressive power of constraints. Constraints, 4:113-131, 1999.
22. P.G. Jeavons, D.A. Cohen, and J.K. Pearson. Constraints and universal algebra. Annals of Mathematics and Artificial Intelligence, 24:51-67, 1998.
23. P.G. Jeavons and M.C. Cooper. Tractable constraints on ordered domains. Artificial Intelligence, 79(2):327-339, 1995.
24. L. Khatib, P. Morris, R. Morris, and F. Rossi. Temporal constraint reasoning with preferences. In Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI-01), pages 322-327, Seattle, USA, 2001.
25. L. Kirousis. Fast parallel constraint satisfaction. Artificial Intelligence, 64:147-160, 1993.
26. G.L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, 1988.
27. J.K. Pearson and P.G. Jeavons. A survey of tractable constraint satisfaction problems. Technical Report CSD-TR-97-15, Royal Holloway, Univ. of London, 1997.
28. R. Pöschel and L.A. Kalužnin. Funktionen- und Relationenalgebren. DVW, Berlin, 1979.
29. T.J. Schaefer. The complexity of satisfiability problems. In Proceedings 10th ACM Symposium on Theory of Computing, STOC'78, pages 216-226, 1978.
30. A. Schrijver. A combinatorial algorithm minimizing submodular functions in strongly polynomial time. JCTB: Journal of Combinatorial Theory, Series B, 80:346-355, 2000.
31. P. van Hentenryck, Y. Deville, and C-M. Teng. A generic arc-consistency algorithm and its specializations. Artificial Intelligence, 57:291-321, 1992.