Constraint satisfaction, databases, and logic

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2003, Pages 1587-1595

  Kolaitis, Phokion G ^a  

^a University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84880767743     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. W. Bibel. Constraint satisfaction from a deductive viewpoint. Artificial Intelligence, 35:401-413, 1988.
2. H.L. Bodlaender. A linear-time algorithm for finding tree-decompositions of small treewidth. In Proc. 25th ACM Symp. on Theory of Computing, pages 226-234, 1993.
3. A. Bulatov. A dichotomy theorem for constraints on a three-element set. In Proc. 43rd IEEE Symposium on Foundations of Computer Science, pages 649-658, 2002.
4. A. Bulatov. Maltsev constraints are tractable. Technical Report PRG-RR-02-05, Oxford University, 2002.
5. A. Bulatov. Tractable conservative constraint satisfaction problems. In Proc. 18th IEEE Symposium on Logic in Computer Science, 2003.
6. A.K. Chandra and P.M. Merlin. Optimal implementation of conjunctive queries in relational databases. In Proc. 9th ACM Symp. on Theory of Computing, pages 77-90, 1977.
7. R. Dechter. Constraint networks. In S.C. Shapiro, editor, Encyclopedia of Artificial Intelligence, pages 276-185. Wiley, New York, 1992.
8. R. Dechter. From local to global consistency. Artificial Intelligence, 55(1):87-107, May 1992.
9. R. Dechter. Bucket elimination: a unifying framework for reasoning. Artificial Intelligence, 113(1-2):41-85, 1999. (Pubitemid 30542742)
10. R.G. Downey and M.R. Fellows. Parametrized Complexity. Springer-Verlag, 1999.
11. V. Dalmau, Ph.G. Kolaitis, and M.Y. Vardi. Constraint satisfaction, bounded treewidth, and finite-variable logics. In Proc. of the Eighth Int. Conference on Principles and Practice of Constraint Programming (CP 2002), Lecture Notes in Computer Science, pages 311-326. Springer, 2002.
12. R. Dechter and J. Pearl. Tree clustering for constraint networks. Artificial Intelligence, pages 353-366, 1989.
13. H.-D. Ebbinghaus, J. Flum, and W. Thomas. Mathematical Logic. Springer-Verlag, 2nd edition, 1994.
14. E.C. Freuder. Complexity of K-tree structured constraint satisfaction problems. In Proc. of 8th National Conference on Artificial Intelligence, pages 4-9, 1990.
15. T Feder and M.Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM J. on Computing, 28:57-104, 1998.
16. Preliminary version in Proc. 25th ACM Symp. on Theory of Computing, May 1993, pp. 612-622.
17. M. R. Garey and D. S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., 1979.
18. M. Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side. Submitted for publication, 2003.
19. P. Jeavons, D. Cohen, and M.C. Cooper. Constraints, consistency and closure. Artificial Intelligence, 101(1-2):251-65, May 1998. (Pubitemid 128387395)
20. P. Jeavons, D. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44(4):527-48, 1997. (Pubitemid 127617702)
21. P. Jeavons. On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200(1-2): 185-204, 1998. (Pubitemid 128450816)
22. Ph. G. Kolaitis and M. Y. Vardi. 0-1 laws for infinitary logics. In Proc. 5th IEEE Symp. on Logic in Computer Science, pages 156-167, 1990.
23. Ph. G. Kolaitis and M. Y Vardi. On the expressive power of Datalog: tools and a case study. Journal of Computer and System Sciences, 51 (1): 110-134, August 1995.
24. Ph.G. Kolaitis and M.Y Vardi. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences, pages 302-332, 2000.
25. Earlier version in: Proc. 17th ACM Symp. on Principles of Database Systems (PODS '98).
26. Ph.G. Kolaitis and M.Y Vardi. A game-theoretic approach to constraint satisfaction. In Proc. of the 17th National Conference on Artificial Intelligence (AAAI2000), pages 175-181,2000.
27. R. E. Ladner. On the structure of polynomial time reducibility. Journal of the Association for Computing Machinery, 22(1): 155-171, 1975.
28. U. Montanari. Networks of constraints: fundamental properties and application to picture processing. Information Science, 7:95-132, 1974.
29. J. Pearson and P. Jeavons. A survey of tractable constraint satisfaction problems. Technical Report CSD-TR-97-15, Royal Holloway University of London, 1997.
30. T.J. Schaefer. The complexity of satisfiability problems. In Proc. 10th ACM Symp. on Theory of Computing, pages 216-226, 1978.
31. J. D. Ullman. Database and Knowledge-Base Systems, Volumes I and II. Computer Science Press, 1989.