Datalog and Constraint Satisfaction with Infinite Templates

28 pages. This is an extended long version of a conference paper that appeared at STACS'06. In the third version in the arxiv we have revised the presentation again and added a section that relates our results to formalizations of CSPs using relation algebras

Data and Resources

Additional Info

Field Value
Source https://hal.science/hal-00757438
Author Bodirsky, Manuel, Dalmau, Victor
Maintainer CCSD
Last Updated June 4, 2026, 01:28 (UTC)
Created June 4, 2026, 01:28 (UTC)
Identifier hal-00757438
Language en
contributor Laboratoire d'informatique de l'École polytechnique [Palaiseau] (LIX) ; École polytechnique (X) ; Institut Polytechnique de Paris (IP Paris)-Institut Polytechnique de Paris (IP Paris)-Centre National de la Recherche Scientifique (CNRS)
creator Bodirsky, Manuel
date 2012-04-15T00:00:00
harvest_object_id b0559147-ff1c-45a7-9e57-3506d8140f6d
harvest_source_id 3374d638-d20b-4672-ba96-a23232d55657
harvest_source_title test moissonnage SELUNE
metadata_modified 2024-08-01T00:00:00
relation info:eu-repo/semantics/altIdentifier/arxiv/0809.2386
set_spec type:UNDEFINED