Abstract
Existential k-pebble games, k≥ 2, are combinatorial games played between two players, called the Spoiler and the Duplicator, on two structures. These games were originally introduced in order to analyze the expressive power of Datalog and related infinitary logics with finitely many variables. More recently, however, it was realized that existential k-pebble games have tight connections with certain consistency properties which play an important role in identifying tractable classes of constraint satisfaction problems and in designing heuristic algorithms for solving such problems. Specifically, it has been shown that strong k-consistency can be established for an instance of constraint satisfaction if and only if the Duplicator has a winnning strategy for the existential k-pebble game between two finite structures associated with the given instance of constraint satisfaction. In this paper, we pinpoint the computational complexity of determining the winner of the existential k-pebble game. The main result is that the following decision problem is EXPTIME-complete: given a positive integer k and two finite structures A and B, does the Duplicator win the existential k-pebble game on A and B? Thus, all algorithms for determining whether strong k-consistency can be established (when k is part of the input) are inherently exponential.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the ACM 28, 114–233 (1981)
Cooper, M.C.: An optimal k-consistency algorithm. Artificial Intelligence 41, 89–95 (1989)
Dalmau, V., Kolaitis, P.G., Vardi, M.Y.: Constraint satisfaction, bounded treewidth, and finite-variable logics. In: Proc. of Eighth International Conference on Principles and Practice of Constraint Programming, pp. 310–326 (2002)
Dechter, R.: Constraint networks. In: Shapiro, S.C. (ed.) Encyclopedia of Artificial Intelligence, pp. 276–285. Wiley, NewYork (1992)
Dechter, R.: From local to global consistency. Artificial Intelligence 55, 87–107 (1992)
Feder, T., Vardi, M.Y.: 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)
Grohe, M.: Equivalence in finite-variable logics is complete for polynomial time. Combinatorica 19(4), 507–523 (1999)
Kasai, T., Adachi, A., Iwata, S.: Classes of pebble games and complete problems. SIAM Journal of Computing 8(4), 574–586 (1979)
Kasai, T., Iwata, S.: Gradually intractable problems and nondeterminitstic log-space lower bounds. Mathematical Systems Theory 18, 153–170 (1985)
Kasif, S.: On the parallel complexity of some constraint satisfaction problems. In: Proc. of Fifth National Conference on Artificial Intelligencee, vol. 1, pp. 349–353 (1986)
Kolaitis, P.G., Vardi, M.Y.: On the expressive power of Datalog: Tools and a case study. Journal of Computer and System Sciences 51, 110–134 (1995)
Kolaitis, P.G., Vardi, M.Y.: A game-theoretic approach to constraint satisfaction. In: Proc. of the Seventeenth National Conference on Artificial Intelligence, pp. 175–181 (2000)
Pezzoli, E.: Computational complexity of Ehrenfeucht-Fraïssé games on finite structures. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol. 1584, pp. 159–170. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kolaitis, P.G., Panttaja, J. (2003). On the Complexity of Existential Pebble Games. In: Baaz, M., Makowsky, J.A. (eds) Computer Science Logic. CSL 2003. Lecture Notes in Computer Science, vol 2803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45220-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-540-45220-1_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40801-7
Online ISBN: 978-3-540-45220-1
eBook Packages: Springer Book Archive