On the power of k-consistency

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

Volumn 4596 LNCS, Issue , 2007, Pages 279-290

  Atserias, Albert ^a   Bulatov, Andrei ^b   Dalmau, Victor ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b SIMON FRASER UNIVERSITY   (Canada)

^c UNIVERSITAT POMPEU FABRA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ENCODING (SYMBOLS); PROBLEM SOLVING;

CONSISTENCY ALGORITHM; STRUCTURE ENCODING;

CONSTRAINT THEORY;

EID: 38149013965     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73420-8_26     Document Type: Conference Paper

References (22)

1. Atserias, A., Dalmau, V.: A Combinatorial Characterization of Resolution Width. In: Proceedings of the 18th Annual IEEE Conference on Computational Complexity, Aarhus, Denmark, July 2003, pp. 239-247 (2003)
2. Atserias, A.: On digraph coloring problems and treewidth duality. In: Proceedings of the 20th Annual IEEE Simposium on Logic in Computer Science, Chicago, June 2005, pp. 106-115 (2005)
3. Atserias, A., Dawar, A., Kolaitis, P.: On Preservation under Homomorphisms and Unions of Conjunctive Queries. Journal of the ACM 53(2), 208-237 (2006)
4. Bulatov, A.: A dichotomy theorem for constraints on a three-element set. J. of the ACM 53(1), 66-120 (2006)
5. spaceskip=.28em plus .lem minus .lemBulatov, A.A.: Tractable conservative constraint satisfaction problems. In: Proceedings of the 18th Annual IEEE Simposium on Logic in Computer Science, Ottawa, Canada, June 2003, pp. 321-330. IEEE Computer Society Press, Los Alamitos (2003)
6. Dalmau, V., Kolaitis, P.G., Vardi, M.Y.: Constraint satisfaction, bounded treewidth, and finite variable logics. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 311-326. Springer, Heidelberg (2002)
7. Dechter, R.: From local to global consistency. Artificial Intelligence 55(1), 87-107 (1992)
8. Feder, T., Vardi, M.Y.: Monotone monadic SNP and constraint satisfaction. In: Proceedings of 25th ACM Symposium on the Theory of Computing (STOC), pp. 612-622. ACM Press, New York (1993)
9. Feder, T., Vardi, M.Y.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through datalog and group theory. SIAM Journal of Computing 28, 57-104 (1998)
10. Freuder, E.: A Sufficient Condition for Backtrack-Free Search. Jouranl of the ACM 29(1), 24-32 (1982)
11. Freuder, E.: Complexity of k-tree structured constraint satisfaction problems. In: Proceedings of the 8th National Conference on Artificial Intelligence AAAI-90, pp. 4-9 (1990)
12. Grohe, M.: The complexity of homomorphism and constraint satisfaction problems seen from the other side. In: Proceedings of the 44th Annual Simposium on Foundations of Computer Science, Cambridge, Massachusets, October 2003, pp. 552-561. IEEE Computer Society Press, Los Alamitos (2003)
13. Hell, P., Nešetřil,: Graphs and homomorphisms. Oxford Lecture Series in Mathematics and its Applications, vol. 28. Oxford University Press, Oxford (2004)
14. Hell, P., Nešetřil, J.: On the complexity of H-coloring. Journal of Combinatorial Theory, Ser.B 48, 92-110 (1990)
15. Hell, P., Nešetřil, J.: The core of a graph. Discrete Mathematics 109(1-3), 117-126 (1992)
16. Hell, P., Nešetřil, J., Zhu, X.: Duality and polynomial testing of tree homomorphisms. Trans. of the AMS 348(4), 1281-1297 (1996)
17. Kolaitis, Ph.G., Panttaja, J.: On the Complexity of Existential Pebble Games. In: Proceeding of the 17th International Workshop on Computer Science Logic, pp. 314-329 (2003)
18. Kolaitis, Ph.G., Vardi, M.Y.: On the expressive power of Datalog: tools and case study. Journal of Computer and System Sciences 51(1), 110-134 (1995)
19. Kolaitis, P.G., Vardi, M.Y.: A game-theoretic approach to constraint satisfaction. In: Proceedings of the 17th National (US) Conference on Artificial Intelligence, AAAI'00, pp. 175-181 (2000)
20. Rossman, B.: Existential Positive Types and Preservation under Homomorphisms. In: Proceedings of the 20th IEEE Symposium on Logic in Computer Science, pp. 467-476. IEEE Computer Society Press, Los Alamitos (2005)
21. Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th ACM Symposium on Theory of Computing (STOC'78), pp. 216-226. ACM Press, New York (1978)
22. Seymour, P., Thomas, R.: Graph searching, and a min-max theorem for treewidth. Journal of Combinatorial Theory, Series B 58, 22-23 (1993)