Tractable decision for a constraint language implies tractable search

Constraints

Volumn 9, Issue 3, 2004, Pages 219-229

  Cohen, D A ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Complexity; Language; Tractability

Indexed keywords

COMPLEXITY; POLYNOMIAL DELAY; TRACTABILITY;

ALGORITHMS; BOOLEAN ALGEBRA; COMPUTATIONAL COMPLEXITY; DECISION MAKING; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; THEOREM PROVING;

CONSTRAINT THEORY;

EID: 3543089852     PISSN: 13837133     EISSN: None     Source Type: Journal    
DOI: 10.1023/B:CONS.0000036045.82829.94     Document Type: Article

References (14)

1. Bulatov, A., & Dalmau, V. (2003). Towards a dichotomy theorem for the counting constraint satisfaction problem. Submitted to FOCS-03.
2. Cohen, D., Jeavons, P., & Gault, R. (2003). New tractable constraint classes from old. In Lakemeyer, G., & Nebel, B., eds., Exploring Artificial Intelligence in the New Millenium, pages 331-354. Morgan Kaufman.
3. Cohen, D., Jeavons, P., Jonsson, P., & Koubarakis, M. (2000). Building tractable disjunctive constraints. Journal of the ACM, 47: 826-853.
4. Creignou, N., & Hébrard, M. (1997). On generating all solutions of generalized satisfiability problems. Theoretical Informatics and Applications, 31(6): 499-511.
5. Dechter, R., & Itai, A. (1992). Finding all solutions if you can find one. In Presented in the Workshop on Tractable Reasoning, AAAI-92, pages 35-39. San Jose, CA, USA.
6. Dechter, R., & Pearl, J. (1992). Structural identification in relational data. Artificial Intelligence, 58:237-270.
7. Jeavons, P. (1998). On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200: 185-204.
8. Jeavons, P., Cohen, D., & Cooper, M. (1998). Constraints, consistency and closure. Artificial Intelligence, 101(1-2): 251-265.
9. Jeavons, P., Cohen D., & Gyssens, M. (1996). A test for tractability. In Proceedings 2nd International Conference on Constraints Programming - CP'96 (Boston, August 1996), Vol. 1118 of Lecture Notes in Computer Science, pages 267-281, Springer-Verlag.
10. Jeavons, P., Cohen, D., & Gyssens, M. (1997). Closure properties of constraints. Journal of the ACM, 44: 527-548.
11. Jeavons, P., & Cooper M. (1995). Tractable constraints on ordered domains. Artificial Intelligence, 79(2): 327-339.
12. Montanari, U. (1974). Networks of constraints: Fundamental properties and applications to picture processing. Information Sciences, 7: 95-132.
13. Papadimitriou, C. (1994). Computational Complexity, Addison-Wesley.
14. Valiant, L. (1979). The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3): 420-421.