Quantified constraint satisfaction and bounded treewidth

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 161-165

  Chen, Hubie ^a  

^a School of Operations Research and Information Engineering   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; POLYNOMIAL APPROXIMATION;

BOUNDED TREEWIDTH; CONSTRAINT-SATISFACTION PROBLEMS; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; PROBLEM INSTANCES; QUANTIFIED CONSTRAINT SATISFACTIONS; QUANTIFIED CONSTRAINTS SATISFACTION PROBLEMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 85017365632     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (12)

1. Bengt Aspvall, Michael F. Plass, and Robert Endre Tarjan, 'A lineartime algorithm for testing the truth of certain quantified boolean formulas', Information Processing Letters, 8(3), 121-123, (1979).
2. Hans L. Bodlaender, 'A linear time algorithm for finding treedecompositions of small treewidth', SIAM Journal on Computing, 25, 1305-1317, (1996).
3. F. Borner, A. Bulatov, A. Krokhin, and P. Jeavons, 'Quantified constraints: Algorithms and complexity', in Computer Science Logic 2003, (2003).
4. Hubie Chen, 'Collapsibility and consistency in quantified constraint satisfaction', in AAAI, (2004).
5. Victor Dalmau, Phokion G. Kolaitis, and Moshe Y. Vardi, 'Constraint satisfaction, bounded treewidth, and finite-variable logics', in Constraint Programming '02, LNCS, (2002).
6. Rina Dechter and Judea Pearl, 'Tree clustering for constraint networks', Artificial Intelligence, 353-366, (1989).
7. Tomas Feder and Phokion Kolaitis, Closures and dichotomies for quantified constraints. Manuscript.
8. Eugene Freuder, 'Complexity of k-tree structured constraint satisfaction problems', in AAAI-90, (1990).
9. Martin Grohe, 'The complexity of homomorphism and constraint satisfaction problems seen from the other side', in FOCS 2003, pp. 552-561, (2003).
10. Marek Karpinski, Hans Kleine Büning, and Peter H. Schmitt, 'On the computational complexity of quantified horn clauses', in CSL 1987, pp. 129-137, (1987).
11. P. Kolaitis and M. Vardi, 'Conjunctive-query containment and constraint satisfaction', Journal of Computer and System Sciences, 302- 332, (2000).
12. P. Kolaitis and M. Vardi, 'A game-theoretic approach to constraint satisfaction', in AAAI-00, pp. 175-181, (2000).