On the complexity of existential pebble games

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

Volumn 2803, Issue , 2003, Pages 314-329

  Kolaitis, Phokion G ^a   Panttaja, Jonathan ^a  

^a University of California Santa Cruz   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS; PROBLEM SOLVING;

COMBINATORIAL GAME; CONSISTENCY PROPERTY; CONSTRAINT SATISFACTION; DECISION PROBLEMS; EXPRESSIVE POWER; FINITE STRUCTURES; POSITIVE INTEGERS; TRACTABLE CLASS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 35048839449     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45220-1_26     Document Type: Article

References (13)

1. A. K. Chandra, D. C. Kozen, and L. J. Stockmeyer. Alternation. Journal of the ACM, 28:114-233, January 1981.
2. M. C. Cooper. An optimal k-consistency algorithm. Artificial Intelligence, 41:89-95, 1989.
3. V. Dalmau, Ph. G. Kolaitis, and M. Y. Vardi. Constraint satisfaction, bounded treewidth, and finite-variable logics. In Proc. of Eighth International Conference on Principles and Practice of Constraint Programming, pages 310-326, 2002.
4. R. Dechter. Constraint networks. In S.C. Shapiro, editor. Encyclopedia of Artificial Intelligence, pages 276-285. Wiley, New York, 1992.
5. R. Dechter. From local to global consistency. Artificial Intelligence, 55:87-107, 1992.
6. T. Feder and M. Y. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: a study through Datalog and group theory. SIAM Journal on Computing, 28:57-104, 1998.
7. M. Grohe. Equivalence in finite-variable logics is complete for polynomial time. Combinatorica, 19(4):507-523, 1999.
8. T. Kasai, A. Adachi, and S. Iwata. Classes of pebble games and complete problems. SIAM Journal of Computing, 8(4):574-586, 1979.
9. T. Kasai and S. Iwata. Gradually intractable problems and nondeterminitstic log-space lower bounds. Mathematical Systems Theory, 18:153-170, 1985.
10. S. Kasif. On the parallel complexity of some constraint satisfaction problems. In Proc. of Fifth National Conference on Artificial Intelligencee, volume 1, pages 349-353, 1986.
11. 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:110-134, 1995.
12. Ph. G. Kolaitis and M. Y. Vardi. A game-theoretic approach to constraint satisfaction. In Proc. of the Seventeenth National Conference on Artificial Intelligence, pages 175-181, 2000.
13. E. Pezzoli. Computational complexity of Ehrenfeucht-Fraïssé games on finite structures. In Computer Science Logic. 12th International Workshop, CSL'98., pages 159-170, 1999.