Resolution and constraint satisfaction

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

Volumn 2833, Issue , 2003, Pages 555-569

  Mitchell, David G ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

CNF FORMULAS; CONSTRAINT SATISFACTION; DOMAIN SIZE; FINITE DOMAIN CONSTRAINTS; PROPOSITIONAL RESOLUTION; RELATIVE STRENGTH;

CONSTRAINT SATISFACTION PROBLEMS;

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

References (23)

1. Andrew B. Baker. Intelligent Backtracking on Constraint Satisfaction Problems: Experimental and Theoretical Results. PhD thesis, University of Oregon, 1995.
2. P. Beame, J. Culberson, and D. Mitchell. The resolution complexity of random graph k-colourability. In preparation.
3. P. Beame, R. Impagliazzo, and A Sabharwal. Resolution complexity of independent sets in random graphs. In Proc., 16th Annual Conference on Computational Complexity (CCC), pages 52-68, June 2001.
4. P. Beame, R. Karp, T. Pitassi, and M. Saks. On the complexity of unsatisfiability proofs for random k-CNF formulas. In Proc. of the 30 Annual ACM Symp. on the Theory of Computing (STOC-98), pages 561-571, May 1998.
5. P. Beame, H. Kautz, and A. Sabharwal. Understanding the power of clause learning. In Proc., Eighteenth Int'l. Joint Conferences on Artificial Intelligence (IJCAI-03), 2003. To appear.
6. E. Ben-Sasson and A. Wigderson. Short proofs are narrow: Resolution made simple. In Proc. of the 31st Annual Symp. on the Theory of Computation. (STOC-99), pages 517-526, May 1999. (Also appears as ECCC report TR99-022).
7. J. Buresh-Oppenheim and T. Pitassi. The complexity of resolution refinements. In Proc., Eighteenth Annual IEEE Symposium on Logic in Computer Science (LICS-03), pages 138-147, 2003.
8. V. Chvátal and E. Szemerédi. Many hard examples for resolution. Journal of the ACM, 35(4):759-768, 1988.
9. S. A. Cook and R. A. Reckhow. The relative efficiency of propositional proof systems. J. Symbolic Logic, 44(1):23-46, 1979.
10. J. De Kleer. A comparison of ATMS and CSP techniques. In Proc. of the 11th Int'l. Joint Conf. on A. I. (IJCAI-89), pages 290-296, 1989.
11. R. Dechter. From local to global consistency. Artificial Intelligence, 55:87-107, 1992.
12. D. Frost and R. Dechter. Dead-end driven learning. In Proc., Twelfth Nat. Conf. on Artificial Intelligence (AAAI-94), pages 294-300, 1994.
13. A. Goerdt. Unrestricted resolution versus N-resolution. Theoretical Computer Science, 93:159-167, 1992.
14. A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297-308, 1985.
15. O. Kullmann. Upper and lower bounds on the complexity of generalized resolution and generalized constraint satisfaction problems. Manuscript, 2000.
16. D. G. Mitchell. Hard problems for CSP algorithms. In Proc., 15th Nat. Conf. on Artificial Intelligence (AAAI-98), pages 398-405, 1998.
17. David G. Mitchell. Resolution complexity of random constraints. Lecture Notes in Computer Science, LNCS 2470, pages 295-309, 2002.
18. M. Molloy and M. Salavatipour. The resolution complexity of random constraint satisfaction problems. Submitted.
19. T. Schiex and G. Verfaillie. Nogood recording for static and dynamic csp. In Proc. of the IJCAI-93/SIGMAN Workshop on Knowledge-based Production Planning, Scheduling and Control, pages 305-316, August 1993.
20. A. Urquhart. Hard examples for resolution. Journal of the ACM, 34(1):209-219, January 1987.
21. A. Urquhart. Resolution proofs of matching principles. Annals of Mathematics and Artificial Intelligence, 2002. (To appear).
22. T. Walsh. SAT vs CSP. In Proc. of the 6th Int'l. Conference on the Principles and Practice of Constraint Programming (CP-2000), pages 441-456, 2000.
23. K. Xu and W. Li. Exact phase transitions in random constraint satisfaction problems. J. of Artificial Intelligence Research, 12:93-103, 2000.