Beyond hypertree width: Decomposition methods without decompositions

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

Volumn 3709 LNCS, Issue , 2005, Pages 167-181

  Chen, Hubie ^a   Dalmau, Víctor ^a  

^a UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

CONSTRAINT SATISFACTION PROBLEM; HYPERTREE WIDTH; MATHEMATICAL INVESTIGATION; POLYNOMIAL-TIME SOLVABILITY;

DECOMPOSITION;

EID: 33646171118     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_15     Document Type: Conference Paper

References (21)

1. Isolde Adler, Georg Gottlob, and Martin Grohe. Hypertree-width and related hypergraph invariants. In preparation.
2. A. Atserias, Ph. G. Kolaitis, and M. Y. Vardi. Constraint propagation as a proof system. In CP 2004, 2004.
3. Hans L. Bodlaender. Discovering treewidth. In SOFSEM 2005, 2005.
4. Andrei Bulatov. A dichotomy theorem for constraints on a three-element set. In Proceedings of 43rd IEEE Symposium on Foundations of Computer Science, pages 649-658, 2002.
5. Andrei Bulatov. Tractable conservative constraint satisfaction problems. In Proceedings of 18th IEEE Symposium on Logic in Computer Science (LICS '03), pages 321-330, 2003. Extended version appears as Oxford University technical report PRG-RR-03-01.
6. Hubie Chen and Victor Dalmau. Prom pebble games to tractability: An ambidextrous consistency algorithm for quantified constraint satisfaction. Manuscript, 2005.
7. D. Cohen, P. Jeavons, and M. Gyssens. A unified theory of structural tractability For constraint satisfaction and spread cut decomposition. To appear in JJCAI 2005, 2005.
8. Victor Dalmau, Phokion G. Kolaitis, and Moshe Y. Vardi. Constraint satisfaction, bounded treewidth, and finite-variable logics. In Constraint Programming '02, LNCS, 2002.
9. Rina Dechter and .Judea Peart. Tree clustering for constraint networks. Artificial Intelligence, pages 353-366, 1989.
10. Eugene Freucler. Complexity of k-tree structured constraint satisfaction problems. In AAAI-90, 1990.
11. G. Gottlob, L. Leone, and F. Scarcello. Hypertree decomposition and tractable queries. Journal of Computer and System Sciences, 64(3):579-627, 2002.
12. G. Gottlob, L. Leone, and P. Scarcello. Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width. Journal of Computer and System Sciences, 66:775-808, 2003.
13. Georg Gottlob, Nicola Leone, and Francesco Scarcello. A comparison of structural cap decomposition methods. Artif. Intell., 124(2):243-282, 2000.
14. Georg Gottlob, Nicola Leone, and Francesco Scarcello. The complexity of acyclic conjunctive queries. Journal of the ACM, 43(3):431-498, 2001.
15. Martin Grohe. The complexity of homomorphism and constraint satisfaction problems seen from the other side. In FOCS 2003, pages 552-561, 2003.
16. M. Gyssens, P.G. Jeavons, and D.A. Cohen. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence, 66(1):57-89, 1994.
17. M. Gysssens and J. Paradaens. A decomposition methodology for cyclic databases. In Advances in Database Theory, volume 2, pages 85-122. Plenum Press, New York, NY, 1084.
18. 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, 1995.
19. Ph.G. Kolaitis and M.Y. Vardi. Conjunctive-query containment and constraint satisfaction. Journal of Computer and System Sciences, 61:302-332, 2000.
20. Ph.G. Kolaitis and M.Y. Vardi. A game-theoretic approach to constraint satisfaction. In Proceedings 17th National (US) Conference on Artificial Intellignece, AAAI'00, pages 175-181, 2000.
21. Thomas J. Schaefer. The complexity of satisfiability problems. In Proceedings of the ACM Symposium on Theory of Computing (STOC), pages 216-226, 1978.