Abstract
We relate the expressive power of Datalog and constraint satisfaction with infinite templates. The relationship is twofold: On the one hand, we prove that every non-empty problem that is closed under disjoint unions and has Datalog width one can be formulated as a constraint satisfaction problem (CSP) with a countable template that is ω-categorical. Structures with this property are of central interest in classical model theory. On the other hand, we identify classes of CSPs that can be solved in polynomial time with a Datalog program. For that, we generalise the notion of the canonical Datalog program of a CSP, which was previously defined only for CSPs with finite templates by Feder and Vardi. We show that if the template Γ is ω-categorical, then CSP(Γ) can be solved by an (l,k)-Datalog program if and only if the problem is solved by the canonical (l,k)-Datalog program for Γ. Finally, we prove algebraic characterisations for those ω-categorical templates whose CSP has Datalog width (1,k), and for those whose CSP has strict Datalog width l.
Topic: Logic in Computer Science, Computational Complexity.
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.
Similar content being viewed by others
References
Achlioptas, D.: The complexity of G-free colourability. Discrete Mathematics 165, 21–30 (1997)
Andréka, H., Maddux, R.D.: Representations for small relation algebras. Notre Dame Journal of Formal Logic 35(4), 550–562 (1994)
Atserias, A.: On digraph coloring problems and treewidth duality. In: 20th IEEE Symposium on Logic in Computer Science (LICS), pp. 106–115 (2005)
Bodirsky, M.: The core of a countably categorical structure. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 100–110. Springer, Heidelberg (2005)
Bodirsky, M., Chen, H.: Oligomorphic clones. Preprint (2005)
Bodirsky, M., Nešetřil, J.: Constraint satisfaction with countable homogeneous templates. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 44–57. Springer, Heidelberg (2003)
Bulatov, A., Krokhin, A., Jeavons, P.G.: Classifying the complexity of constraints using finite algebras. SIAM Journal on Computing 34, 720–742 (2005)
Cameron, P.J.: Oligomorphic Permutation Groups. Cambridge University Press, Cambridge (1990)
Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proceddings of STOC 1977, pp. 77–90 (1977)
Cherlin, G., Shelah, S., Shi, N.: Universal graphs with forbidden subgraphs and algebraic closure. Advances in Applied Mathematics 22, 454–491 (1999)
Covington, J.: Homogenizable relational structures. Illinois Journal of Mathematics 34(4), 731–743 (1990)
Cristiani, M., Hirsch, R.: The complexity of the constraint satisfaction problem for small relation algebras. Artificial Intelligence Journal 156, 177–196 (2004)
Dalmau, V.: A new tractable class of constraint satisfaction problems. Ann. Math. Artif. Intell. 44(1-2), 61–85 (2005)
Dalmau, V., Krokhin, A.A., Larose, B.: First-order definable retraction problems for posets and reflexive graph. In: LICS 2004, pp. 232–241 (2004)
Dalmau, V., Pearson, J.: Closure functions and width 1 problems. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 159–173. Springer, Heidelberg (1999)
Düntsch, I.: Relation algebras and their application in temporal and spatial reasoning. Artificial Intelligence Review 23, 315–357 (2005)
Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)
Feder, T., Vardi, M.: The computational structure of monotone monadic SNP and constraint satisfaction: A study through Datalog and group theory. SIAM Journal on Computing 28, 57–104 (1999)
Feder, T., Vardi, M.: Homomorphism closed vs. existential positive. In: Feder, T., Vardi, M. (eds.) Symposium on Logic in Computer Science (LICS 2003), pp. 311–320 (2003)
Hell, P., Nešetřil, J.: On the complexity of H-coloring. Journal of Combinatorial Theory, Series B 48, 92–110 (1990)
Hirsch, R.: Expressive power and complexity in algebraic logic. Journal of Logic and Computation 7(3), 309–351 (1997)
Hodges, W.: A shorter model theory. Cambridge University Press, Cambridge (1997)
Jeavons, P., Cohen, D., Cooper, M.: Constraints, consistency and closure. AI 101(1-2), 251–265 (1998)
Jeavons, P., Cohen, D., Gyssens, M.: Closure properties of constraints. Journal of the ACM 44(4), 527–548 (1997)
Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. In: Proceedings of PODS 1998, pp. 205–213 (1998)
Krokhin, A., Bulatov, A., Jeavons, P.: The complexity of constraint satisfaction: An algebraic approach (survey paper). Structural Theory of Automata, Semigroups and Universal Algebra, NATO Science Series II: Mathematics, Physics, and Chemistry 207, 181–213 (2005)
Kun, G.: Every problem in MMSNP is polynomial time equivalent to a CSP. Personal communication (2005)
Ladkin, P.B., Maddux, R.D.: On binary constraint problems. Journal of the Association for Computing Machinery 41(3), 435–469 (1994)
Larose, B., Tardif, C.: Strongly rigid graphs and projectivity. Multiple-Valued Logic 7, 339–361 (2001)
Madelaine, F., Stewart, I.A.: Some problems not definable using structure homomorphisms. MCS technical report. University of Leicester 99(18) (1999)
Nešetřil, J., Tardif, C.: Duality theorems for finite structures (characterising gaps and good characterisations). Journal of Combininatorial Theory Series B 80, 80–97 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bodirsky, M., Dalmau, V. (2006). Datalog and Constraint Satisfaction with Infinite Templates. In: Durand, B., Thomas, W. (eds) STACS 2006. STACS 2006. Lecture Notes in Computer Science, vol 3884. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11672142_53
Download citation
DOI: https://doi.org/10.1007/11672142_53
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32301-3
Online ISBN: 978-3-540-32288-7
eBook Packages: Computer ScienceComputer Science (R0)