Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey

Proceedings of The International Symposium on Multiple-Valued Logic

Volumn , Issue , 2003, Pages 343-351

  Krokhin, Andrei ^a   Bulatov, Andrei ^b   Jeavons, Peter ^b  

^a UNIVERSITY OF WARWICK   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MATHEMATICAL MODELS; OPTIMIZATION;

COMBINATORIAL OPTIMIZATION; CONSTRAINT SATISFACTION PROBLEM;

MANY VALUED LOGICS;

EID: 0037819329     PISSN: 0195623X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (45)

1. J. Allen, Natural Language Understanding. Benjamin Cummings, 1994.
2. E. Böhler, E. Hemaspaandra, S. Reith, and H. Vollmer, Equivalence and isomorphism for Boolean constraint satisfaction. In Proceedings 16th International Workshop on Computer Science Logic, CSL'02, volume 2471 of Lecture Notes in Computer Science, pages 412-426, Springer-Verlag, 2002.
3. F. Börner, A. Bulatov, P. Jeavons, and A. Krokhin, Quantified constraints and surjective polymorphisms. Technical Report PRG-RR-02-11, Computing Laboratory, University of Oxford, Oxford, UK, 2002.
4. A. Bulatov, Finite sublattices in a lattice of clones. Algebra i Logika, 33(5):514-549, 1994, (in Russian).
5. 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, 2002.
6. A. Bulatov, Mal'tsev constraints are tractable. Technical Report PRG-RR-02-05, Computing Laboratory, University of Oxford, Oxford, UK, 2002.
7. A. Bulatov and V. Dalmau, Towards a dichotomy theorem for the counting constraint satisfaction problem. Submitted for publication.
8. A. Bulatov and P. Jeavons, Tractable constraints closed under a binary operation. Technical Report PRG-TR-12-00, Computing Laboratory, University of Oxford, Oxford, UK, 2000.
9. A. Bulatov and P. Jeavons, Algebraic approach to multisorted constraints. Technical Report PRG-RR-01-18, Computing Laboratory, University of Oxford, Oxford, UK, 2001.
10. A. Bulatov, A. Krokhin, and P. 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.
11. N. Creignou and M. Hermann, Complexity of generalized satisfiability counting problems. Information and Computation, 125(1):1-12, 1996.
12. N. Creignou, S. Khanna, and M. Sudan, Complexity Classifications of Boolean Constraint Satisfaction Problems, volume 7 of SIAM Monographs on Discrete Mathematics and Applications. 2001.
13. P. Crescenzi and G. Rossi, On the Hamming distance of constraint satisfaction problems. Theoretical Computer Science, 288(1):85-100, 2002.
14. V. Dalmau, Some dichotomy theorems on constant-free quantified Boolean formulas. Technical Report TR LSI-97-43-R, Department LSI, Universitat Politecnica de Catalunya, 1997.
15. V. Dalmau, A new tractable class of constraint satisfaction problems. In Proceedings 6th International Symposium on Artificial Intelligence and Mathematics, 2000.
16. N. Dunkin, J. Bater, P. Jeavons, and D. Cohen, Towards high order constraint representations for the frequency assignment problem. Technical Report CSD-TR-98-05, Department of Computer Science, Royal Holloway, University of London, Egham, Surrey, UK, 1998.
17. T. Feder and M. 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.
18. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA., 1979.
19. G. Gottlob, L. Leone, and F. Scarcello. Hypertree decomposition and tractable queries. Journal of Computer and System Sciences, 64(3):579-627, 2002.
20. M. Gyssens, P. Jeavons, and D. Cohen, Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence, 66(1):57-89, 1994.
21. D. Hobby and R. McKenzie, The Structure of Finite Algebras, volume 76 of Contemporary Mathematics. American Mathematical Society, Providence, R.I., 1988.
22. P. Jeavons, Constructing constraints. In Proceedings 4th International Conference on Constraint Programming - CP'98 (Pisa, October 1998), volume 1520 of Lecture Notes in Computer Science, pages 2-16, Springer-Verlag, 1998.
23. P. Jeavons. On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200:185-204, 1998.
24. P. Jeavons, D. Cohen, and M. Gyssens, Closure properties of constraints. Journal of the ACM, 44:527-548, 1997.
25. P. Jeavons, D. Cohen, and M. Gyssens, How to determine the expressive power of constraints. Constraints, 4:113-131, 1999.
26. H. Kautz and B. Selman, Planning as satisfiability. In Proceedings 10th European Conference on Artificial Intelligence, ECAI'92, pages 359-363, 1992.
27. D. Kavvadias and M. Sireni, The inverse satisfiability problem. SIAM Journal on Computing, 28(1):152-163, 1998.
28. S. Khanna, M. Sudan, L. Trevisan, and D. Williamson, The approximability of constraint satisfaction problems. SIAM Journal on Computing, 30(6):1863-1920, 2001.
29. L. Kirousis and P. Kolaitis, The complexity of minimal satisfiability problems. In Proceedings 18th International Symposium on Theoretical Aspects of Computer Science, STACS'01, volume 2010 of Lecture Notes in Computer Science, pages 407-418, Springer-Verlag, 2001.
30. P. Kolaitis and M. Vardi, Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences, 61:302-332, 2000.
31. A. Mackworth, Constraint satisfaction. In S. Shapiro, editor, Encyclopedia of Artificial Intelligence, volume 1, pages 285-293, Wiley Interscience, 1992.
32. K. Marriott and P. Stuckey, Programming with Constraints: an Introduction. MIT Press. 1998.
33. R. McKenzie, G. McNulty, and W. Taylor, Algebras, Lattices and Varieties, volume I, Wadsworth and Brooks, California, 1987.
34. U. Montanari, Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences, 7:95-132, 1974.
35. B. Nadel, Constraint satisfaction in Prolog: complexity and theory-based heuristics. Information Sciences, 83(3-4):113-131, 1995.
36. C. Papadimitriou, Computational Complexity. Addison-Wesley, 1994.
37. J. Pearson and P. Jeavons, A survey of tractable constraint satisfaction problems. Technical Report CSD-TR-97-15, Royal Holloway, University of London, July 1997.
38. N. Pippenger, Theories of Computability. Cambridge University Press, Cambridge, 1997.
39. R. Pöschel and L. Kalužnin, Funktionen- und Relationenalgebren. DVW, Berlin, 1979.
40. E. Post, The two-valued iterative systems of mathematical logic, volume 5 of Annals Mathematical Studies. Princeton University Press, 1941.
41. I. Rosenberg, Completeness, closed classes and relations in multiple-valued logics. In Proceedings 4th International Symposium on Multiple-Valued Logic, ISMVL,'74, pages 1-26, 1974.
42. T. Schaefer, The complexity of satisfiability problems. In Proceedings 10th ACM Symposium on Theory of Computing, STOC'78, pages 216-226, 1978.
43. A. Szendrei, Clones in Universal Algebra, volume 99 of Seminaires de Mathematiques Superieures. University of Montreal, 1986.
44. E. Tsang, Foundations of Constraint Satisfaction. Academic Press, London, 1993.
45. P. van Beck, Reasoning about qualitative temporal information. Artificial Intelligence, 58:297-326, 1992.