Typed guarded decompositions for constraint satisfaction

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

Volumn 4204 LNCS, Issue , 2006, Pages 122-136

  Cohen, David A ^a   Green, Martin J ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; POLYNOMIALS;

ACYCLIC CLASS; CONSTRAINT SATISFACTION PROBLEM INSTANCES (CSP); STRUCTURAL DECOMPOSITION;

PROBLEM SOLVING;

EID: 33750299546     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11889205_11     Document Type: Conference Paper

References (16)

1. C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. Journal of the ACM, 30:479-513, 1983.
2. H. Chen and V. Dalmau. Beyond hypertree width: Decomposition methods without decompositions. In Principles and Practice of Constraint Programming - CP 2005, Lecture Notes in Computer Science, pages 167-181. Springer-Verlag, 2005.
3. D. Cohen, P. Jeavons, and M. Gyssens. A unified theory of structural tractability for constraint satisfaction and spread cut decomposition. In Proceedings of IJCAI'05, pages 72-77, 2005.
4. R. Dechter and J. Pearl. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence, 34(1):1-38, 1988.
5. M. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA., 1979.
6. G. Gottlob, L. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. Artificial Intelligence, 124:243-282, 2000.
7. G. Gottlob, L. Leone, and F. Scarcello. Hypertree decompositions: A survey. In Proceedings 26th International Symposium on Mathematical Foundations of Computer Science, MFCS'01, volume 2136 of Lecture Notes in Computer Science, pages 37-57. Springer-Verlag, 2001.
8. M.J. Green. New Methods for the Tractability of Constraint Satisfaction Problems. PhD thesis, University of London, Department of Computer Science, Royal Holloway, Egham, Surrey, UK, June 2005.
9. M. Gyssens, P.G. Jeavons, and D.A. Cohen. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence, 66(1):57-89, 1994.
10. P. Janssen, P. Jegou, B Nouguier, and M.C. Vilarem. A filtering process for general constraint satisfaction problems: achieving pair-wise consistency using an associated binary representation. In Proceedings of the IEEE Workshop on Tools for Artificial Intelligence, pages 420-427, 1989.
11. P.G. Jeavons. On the algebraic structure of combinatorial problems. Theoretical Computer Science, 200:185-204, 1998.
12. P.G. Jeavons and D.A. Cohen. An algebraic characterization of tractable constraints. In Computing and Combinatorics. First International Conference COCOON'95 (Xi'an,China, August 1995), volume 959 of Lecture Notes in Computer Science, pages 633-642. Springer-Verlag, 1995.
13. P.G. Jeavons, D.A. Cohen, and M. Gyssens. Closure properties of constraints. Journal of the ACM, 44:527-548, 1997.
14. P.G. Jeavons and M.C. Cooper. Tractable constraints on ordered domains. Artificial Intelligence, 79(2):327-339, 1995.
15. A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99-118, 1977.
16. D. Maier. The Theory of Relational Databases. Computer Science Press, Rockville, Maryland, 1983.