Abstract
We study the definability of constraint satisfaction problems (CSP) in various fixed-point and infinitary logics. We show that testing the solvability of systems of equations over a finite Abelian group, a tractable CSP that was previously known not to be definable in Datalog, is not definable in an infinitary logic with counting and hence that it is not definable in least fixed point logic or its extension with counting. We relate definability of CSPs to their classification obtained from tame congruence theory of the varieties generated by the algebra of polymorphisms of the template structure. In particular, we show that if this variety admits either the unary or affine type, the corresponding CSP is not definable in the infinitary logic with counting. We also study the complexity of determining whether a CSP omits unary and affine types.
Research supported by the Isaac Newton Institute, LAA programme.
This is a preview of subscription content, log in via an institution to check access.
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
Feder, T., Vardi, M.: Computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing 28, 57–104 (1998)
Dalmau, V.: Linear datalog and bounded path duality of relational structures. Logical Methods in Computer Science 1(1) (2005)
Larose, B., Loten, C., Tardif, C.: A characterisation of first-order constraint satisfaction problems. In: LICS, pp. 201–210 (2006)
Bulatov, A.: Mal’tsev constraints are tractable. Technical Report PRG-RR-02-05, Computing Laboratory, University of Oxford, Oxford, UK (2002)
Bulatov, A.A., Dalmau, V.: A simple algorithm for Mal’tsev constraints. SIAM J. Comput. 36(1), 16–27 (2006)
Dalmau, V., Kolaitis, P., Vardi, M.: Constraint satisfaction, bounded treewidth, and finite variable logics. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 311–326. Springer, Heidelberg (2002)
Kolaitis, P., Vardi, M.: A game-theoretic approach to constraint satisfaction. In: Proc. 17th National Conference on Artificial Intelligence, AAAI- 2000, pp. 175–181 (2000)
Blass, A., Gurevich, Y., Shelah, S.: On polynomial time computation over unordered structures. J. Symbolic Logic 67(3), 1093–1125 (2002)
Bulatov, A., Jeavons, P., Krokhin, A.: Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34, 720–742 (2005)
Hobby, D., McKenzie, R.: The Structure of Finite Algebras. Volume 76 of Contemporary Mathematics. American Mathematical Society, Providence, R.I. (1988)
Larose, B., Zádori, L.: Bounded width problems and algebras. Algebra Universalis (to appear)
Larose, B., Valeriote, M.: personal communication (2006)
Diestel, R.: Graph Theory. Springer, Heidelberg (1997)
Seymour, P., Thomas, R.: Graph searching and a min-max theorem for treewidth. Journal of Combinatorial Theory Series B 58, 22–33 (1993)
Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)
Ebbinghaus, H.D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)
Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1999)
Hella, L.: Logical hierarchies in PTIME. Info. and Comput. 129, 1–19 (1996)
Burris, S., Sankappanavar, H.: A course in universal algebra. In: Graduate Texts in Mathematics, vol. 78, Springer, New York (1981)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Atserias, A., Bulatov, A., Dawar, A. (2007). Affine Systems of Equations and Counting Infinitary Logic . In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds) Automata, Languages and Programming. ICALP 2007. Lecture Notes in Computer Science, vol 4596. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73420-8_49
Download citation
DOI: https://doi.org/10.1007/978-3-540-73420-8_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73419-2
Online ISBN: 978-3-540-73420-8
eBook Packages: Computer ScienceComputer Science (R0)