A unifying framework for structural properties of CSPs: definitions, complexity, tractability

Journal of Artificial Intelligence Research

Volumn 32, Issue , 2008, Pages 607-629

  Bordeaux, Lucas ^a   Cadoli, Marco ^b   Mancini, Toni ^b  

^a MICROSOFT RESEARCH   (United Kingdom)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; ELECTRONICS ENGINEERING;

CONSTRAINT SATISFACTION; CONSTRAINT SOLVING; DETECTION PROBLEMS; EFFECTIVE ALGORITHMS; LOCAL REASONING; SATISFIABILITY; SEARCH SPACES;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 52249084357     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2538     Document Type: Article

References (34)

1. Bordeaux, L., Cadoli, M., & Mancini, T. (2004). Exploiting fixable, substitutable and determined values in constraint satisfaction problems. In Baader, F., & Voronkov, A. (Eds.), Proceedings of the Eleventh International Conference on Logic for Programming and Automated Reasoning (LPAR 2004), Vol. 3452 of Lecture Notes in Computer Science, pp. 270-284, Montevideo, Uruguay. Springer.
2. Bordeaux, L., Cadoli, M., & Mancini, T. (2008). Generalizing consistency and other constraint properties to quantified constraints. ACM Transactions on Computational Logic. To appear.
3. Cadoli, M., & Mancini, T. (2007). Using a theorem prover for reasoning on constraint problems. Applied Artificial Intelligence, 21 (4/5), 383-404.
4. Calabro, C., Impagliazzo, R., Kabanets, V., & Paturi, R. (2003). The complexity of Unique k-SAT: An isolation lemma, for k-CNFs. In Proceedings of the Eighteenth IEEE Conference on Computational Complexity (CCC 2003), p. 135 ff., Aarhus, Denmark. IEEE Computer Society Press.
5. Chang, C. C., & Keisler, H. J. (1990). Model Theory, 3rd ed. North-Holland.
6. Choueiry, B. Y., & Noubir, G. (1998). On the computation of local interchangeability in Discrete Constraint Satisfaction Problems. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI'98), pp. 326-333, Madison, WI, USA. AAAI Press/The MIT Press.
7. Crawford, J. M. (1992). A theoretical analysis of reasoning by symmetry in first-order logic (extended abstract). In Proceedings of Workshop on Tractable Reasoning, in conjunction with the Tenth National Conference on Artificial Intelligence (AAAI'92), San Jose, CA, USA.
8. Crawford, J. M., Ginsberg, M. L., Luks, E. M., & Roy, A. (1996). Symmetry-breaking predicates for search problems. In Proceedings of the Fifth International Conference on the Principles of Knowledge Representation and Reasoning (KR'96), pp. 148-159, Cambridge, MA, USA. Morgan Kaufmann, Los Altos.
9. Davis, M., & Putnam, H. (1960). A computing procedure for Quantification Theory. Journal of the ACM, 7(3), 201-215.
10. Dechter, R. (1992). Constraint networks (survey). In Encyclopedia of Artificial Intelligence, 2nd edition, pp. 276-285. John Wiley & Sons.
11. Even, S., Selman, A., & Yacobi, Y. (1984). The complexity of promise problems with applications to public-key cryptography. Information and Control, 61(2), 159-173.
12. Freuder, E. C. (1978). Synthesizing constraint expressions. Communications of the ACM, 21(11), 958-966.
13. Freuder, E. C. (1991). Eliminating interchangeable values in Constraint Satisfaction Problems. In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI'91), pp. 227-233, Anaheim, CA, USA. AAAI Press/The MIT Press.
14. Gent, I. P., & Smith, B. (2000). Symmetry breaking during search in constraint programming. In Proceedings of the Fourteenth European Conference on Artificial Intelligence (ECAI 2000), pp. 599-603, Berlin, Germany.
15. Gent, I., Nightingale, P., & Stergiou, K. (2005). QCSP-Solve: A solver for Quantified Constraint Satisfaction Problems. In Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 138-143, Edinburgh, Scotland. Morgan Kaufmann, Los Altos.
16. Giunchiglia, E., Massarotto, A., & Sebastiani, R. (1998). Act, and the rest will follow: Exploiting determinism in planning as satisfiability. In Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI'98), pp. 948-953, Madison, WI, USA. AAAI Press/The MIT Press.
17. Jonsson, P., & Krokhin, A. (2004). Recognizing frozen variables in constraint satisfaction problems. Theoretical Computer Science, 329(1-3), 93-113.
18. Jonsson, P., & Krokhin, A. (2008). Computational complexity of auditing discrete attributes in statistical databases. Journal of Computer and System Sciences. To appear.
19. Köbler, J., Schöning, U., & Torán, J. (1993). The graph isomorphism problem: its computational complexity. Birkhauser Press.
20. Lal, A., Choueiry, B., & Freuder, E. C. (2005). Interchangeability and dynamic bundling for non-binary finite CSPs. In Proceedings of the Twentieth National Conference on Artificial Intelligence (AAAI 2005), pp. 397-404, Pittsburgh, PA, USA. AAAI Press/The MIT Press.
21. Lenstra, A., & Lenstra, H. W. (1990). Algorithms in number theory. In van Leeuwen, J. (Ed.), The Handbook of Theoretical Computer Science, vol. 1: Algorithms and Complexity. The MIT Press.
22. Li, C. M. (2000). Integrating equivalency reasoning into Davis-Putnam procedure. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI 2000), pp. 291-296, Austin, TX, USA. AAAI Press/The MIT Press.
23. Mackworth, A. K. (1977). Consistency in networks of relations. Artificial Intelligence, 8, 99-118.
24. Mancini, T., & Cadoli, M. (2005). Detecting and breaking symmetries by reasoning on problem specifications. In Proceedings of the Sixth International Symposium on Abstraction, Reformulation and Approximation (SARA 2005), Vol. 3607 of Lecture Notes in Artificial Intelligence, pp. 165-181, Airth Castle, Scotland, UK. Springer.
25. Mancini, T., Cadoli, M. (2007). Exploiting functional dependencies in declarative problem specifications. Artificial Intelligence, 171 (16-17), 985-1010.
26. Mancini, T., Cadoli, M., Micaletto, D., & Patrizi, F. (2008). Evaluating ASP and commercial solvers on the CSPLib. Constraints, 13(4).
27. Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., & Troyansky, L. (1999). Determining computational complexity from characteristic phase transitions. Nature, 400, 133-137.
28. Montanari, U. (1974). Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences, 7(2), 85-132.
29. Papadimitriou, C. H. (1994). Computational Complexity. Addison Wesley Publishing Company, Reading, Massachussetts, Reading, MA.
30. Pyhälä, T. (2004). Factoring benchmarks for SAT solvers. Tech. rep., Helsinki university of technology.
31. Safarpour, S., Veneris, A., Drechsler, R., & Lee, J. (2004). Managing don't cares in Boolean Satisfiability. In Proceedings of Design Automation and Test Conference in Europe (DATE 2004), pp. 260-265, Paris, France. IEEE Computer Society Press.
32. Schaefer, T. J. (1978). The complexity of satisfiability problems. In Proceedings of the Tenth ACM Symposium on Theory of Computing (STOC'78), pp. 216-226, San Diego, CA, USA. ACM Press.
33. Thiffault, C., Bacchus, F., & Walsh, T. (2004). Solving non-clausal formulas with DPLL search. In Proceedings of the Tenth International Conference on Principles and Practice of Constraint Programming (CP 2004), Vol. 3258 of Lecture Notes in Computer Science, pp. 663-678, Toronto, Canada. Springer.
34. Valiant, L. G., & Vijay V. Vazirani, V. V. (1986). NP is as easy as detecting unique solutions. Theoretical Computer Science, 47(3), 85-93.