<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-00756929</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-14T00:43:10+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Constraint Satisfaction Tractability from Semi-lattice Operations on Infinite Sets</title>
            <author role="aut">
              <persName>
                <forename type="first">Manuel</forename>
                <surname>Bodirsky</surname>
              </persName>
              <idno type="halauthorid">509050-0</idno>
              <affiliation ref="#struct-2071"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Dugald</forename>
                <surname>Macpherson</surname>
              </persName>
              <idno type="halauthorid">674486-0</idno>
              <affiliation ref="#struct-51546"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Johan</forename>
                <surname>Thapper</surname>
              </persName>
              <email type="md5">bab80f2867bd4c53e864fecc4575f13c</email>
              <email type="domain">u-pem.fr</email>
              <idno type="idhal" notation="string">johan-thapper</idno>
              <idno type="idhal" notation="numeric">5553</idno>
              <idno type="halauthorid" notation="string">16501-5553</idno>
              <idno type="IDREF">https://www.idref.fr/253131766</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-1993-9571</idno>
              <affiliation ref="#struct-2071"/>
              <affiliation ref="#struct-2544"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Manuel</forename>
                <surname>Bodirsky</surname>
              </persName>
              <email type="md5">4ab95ee803d510a613ca9847bfbc5bba</email>
              <email type="domain">tu-dresden.de</email>
            </editor>
            <funder ref="#projeurop-86649"/>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-03-13 14:23:18</date>
              <date type="whenWritten">2011-11-28</date>
              <date type="whenModified">2025-08-20 10:49:20</date>
              <date type="whenReleased">2018-04-09 17:09:55</date>
              <date type="whenProduced">2013-11-01</date>
              <date type="whenEndEmbargoed">2018-03-13</date>
              <ref type="file" target="https://hal.science/hal-00756929v1/document">
                <date notBefore="2018-03-13"/>
              </ref>
              <ref type="file" subtype="greenPublisher" n="1" target="https://hal.science/hal-00756929v1/file/bdt13tocl-preprint.pdf" id="file-1730618-1794323">
                <date notBefore="2018-03-13"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/1111.6616"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="177691">
                <persName>
                  <forename>Manuel</forename>
                  <surname>Bodirsky</surname>
                </persName>
                <email type="md5">4ab95ee803d510a613ca9847bfbc5bba</email>
                <email type="domain">tu-dresden.de</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00756929</idno>
            <idno type="halUri">https://hal.science/hal-00756929</idno>
            <idno type="halBibtex">bodirsky:hal-00756929</idno>
            <idno type="halRefHtml">&lt;i&gt;ACM Transactions on Computational Logic&lt;/i&gt;, 2013, 14 (4), pp.30:1-19. &lt;a target="_blank" href="https://dx.doi.org/10.1145/2528933"&gt;&amp;#x27E8;10.1145/2528933&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">ACM Transactions on Computational Logic, 2013, 14 (4), pp.30:1-19. &amp;#x27E8;10.1145/2528933&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1730618-1794323"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="X">École polytechnique</idno>
            <idno type="stamp" n="EC-PARIS">Ecole Centrale Paris</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="UNIV-PSUD">Université Paris Sud - Paris XI</idno>
            <idno type="stamp" n="LIX" corresp="X">Laboratoire d'informatique de l'Ecole polytechnique</idno>
            <idno type="stamp" n="X-DEP-INFO">Département d'informatique de l’École polytechnique</idno>
            <idno type="stamp" n="OPENAIRE">OpenAIRE</idno>
            <idno type="stamp" n="UMR8623">Laboratoire de Recherche en Informatique</idno>
            <idno type="stamp" n="TDS-MACS">Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes</idno>
            <idno type="stamp" n="UNIV-PARIS-SACLAY">Université Paris-Saclay</idno>
            <idno type="stamp" n="UNIV-PSUD-SACLAY" corresp="UNIV-PARIS-SACLAY">Université Paris Sud pour Paris Saclay</idno>
            <idno type="stamp" n="DEPARTEMENT-DE-MATHEMATIQUES">Collection du Département de Mathématiques</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Constraint Satisfaction Tractability from Semi-lattice Operations on Infinite Sets</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Manuel</forename>
                    <surname>Bodirsky</surname>
                  </persName>
                  <idno type="halauthorid">509050-0</idno>
                  <affiliation ref="#struct-2071"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Dugald</forename>
                    <surname>Macpherson</surname>
                  </persName>
                  <idno type="halauthorid">674486-0</idno>
                  <affiliation ref="#struct-51546"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Johan</forename>
                    <surname>Thapper</surname>
                  </persName>
                  <email type="md5">bab80f2867bd4c53e864fecc4575f13c</email>
                  <email type="domain">u-pem.fr</email>
                  <idno type="idhal" notation="string">johan-thapper</idno>
                  <idno type="idhal" notation="numeric">5553</idno>
                  <idno type="halauthorid" notation="string">16501-5553</idno>
                  <idno type="IDREF">https://www.idref.fr/253131766</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-1993-9571</idno>
                  <affiliation ref="#struct-2071"/>
                  <affiliation ref="#struct-2544"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">9525</idno>
                <idno type="issn">1529-3785</idno>
                <idno type="eissn">1557-945X</idno>
                <title level="j">ACM Transactions on Computational Logic</title>
                <imprint>
                  <publisher>Association for Computing Machinery</publisher>
                  <biblScope unit="volume">14</biblScope>
                  <biblScope unit="issue">4</biblScope>
                  <biblScope unit="pp">30:1-19</biblScope>
                  <date type="datePub">2013-11-01</date>
                </imprint>
              </monogr>
              <idno type="arxiv">1111.6616</idno>
              <idno type="doi">10.1145/2528933</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">ω-categoricity</term>
                <term xml:lang="en">semi-lattice operations</term>
                <term xml:lang="en">constraint satisfaction problems</term>
                <term xml:lang="en">Computational complexity</term>
                <term xml:lang="en">Theory</term>
                <term xml:lang="en">Algorithms</term>
                <term xml:lang="en">Model theory</term>
                <term xml:lang="en">Mathematical Logic—Logic and constraint programming</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-cc">Computer Science [cs]/Computational Complexity [cs.CC]</classCode>
              <classCode scheme="halDomain" n="info.info-dm">Computer Science [cs]/Discrete Mathematics [cs.DM]</classCode>
              <classCode scheme="halDomain" n="math.math-lo">Mathematics [math]/Logic [math.LO]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>A famous result by Jeavons, Cohen, and Gyssens shows that every constraint satisfaction problem (CSP) where the constraints are preserved by a semi-lattice operation can be solved in polynomial time. This is one of the basic facts for the so-called universal-algebraic approach to a systematic theory of tractability and hardness in finite domain constraint satisfaction. Not surprisingly, the theorem of Jeavons et al. fails for arbitrary infinite domain CSPs. Many CSPs of practical interest, though, and in particular those CSPs that are motivated by qualitative reasoning calculi from Artificial Intelligence, can be formulated with constraint languages that are rather well-behaved from a model-theoretic point of view. In particular, the automorphism group of these constraint languages tends to be large in the sense that the number of orbits of n-subsets of the automorphism group is bounded by some function in n. In this paper we present a generalization of the theorem by Jeavons et al. to infinite domain CSPs where the number of orbits of n-subsets grows sub-exponentially in n, and prove that preservation under a semi-lattice operation for such CSPs implies polynomial-time tractability. Unlike the result of Jeavons et al., this includes many CSPs that cannot be solved by Datalog.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-2071" status="VALID">
          <idno type="IdRef">196509955</idno>
          <idno type="ISNI">0000000403673665</idno>
          <idno type="RNSR">200519331V</idno>
          <idno type="ROR">https://ror.org/04afed728</idno>
          <idno type="Wikidata">Q16009025</idno>
          <orgName>Laboratoire d'informatique de l'École polytechnique [Palaiseau]</orgName>
          <orgName type="acronym">LIX</orgName>
          <date type="start">2005-01-01</date>
          <desc>
            <address>
              <addrLine>1 Rue Honoré d’Estienne d’Orves, Bâtiment Alain Turing, 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lix.polytechnique.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300340" type="direct"/>
            <relation active="#struct-563936" type="indirect"/>
            <relation name="UMR7161" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-51546" status="VALID">
          <orgName>School of Mathematics [Leeds]</orgName>
          <desc>
            <address>
              <addrLine>Woodhouse Lane, University of Leeds, Leeds LS2 9JT United Kingdom</addrLine>
              <country key="GB"/>
            </address>
            <ref type="url">https://eps.leeds.ac.uk/maths</ref>
          </desc>
          <listRelation>
            <relation active="#struct-123346" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-2544" status="OLD">
          <idno type="RNSR">199812948M</idno>
          <orgName>Laboratoire de Recherche en Informatique</orgName>
          <orgName type="acronym">LRI</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>LRI - Bâtiments 650-660 Université Paris-Sud 91405 Orsay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lri.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-92966" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation name="UMR8623" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300340" status="VALID">
          <idno type="IdRef">027309320</idno>
          <idno type="ISNI">0000000121581279</idno>
          <idno type="ROR">https://ror.org/05hy3tk52</idno>
          <idno type="Wikidata">Q273626</idno>
          <orgName>École polytechnique</orgName>
          <orgName type="acronym">X</orgName>
          <date type="start">1794-03-11</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91128 Palaiseau Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.polytechnique.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-563936" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-563936" status="VALID">
          <idno type="IdRef">238327159</idno>
          <idno type="ISNI">0000000502717600</idno>
          <idno type="ROR">https://ror.org/042tfbd02</idno>
          <idno type="Wikidata">Q48759778</idno>
          <orgName>Institut Polytechnique de Paris</orgName>
          <orgName type="acronym">IP Paris</orgName>
          <date type="start">2019-06-02</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91120 Palaiseau Cedex, France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ip-paris.fr</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-123346" status="VALID">
          <idno type="ROR">https://ror.org/024mrxd33</idno>
          <orgName>University of Leeds</orgName>
          <desc>
            <address>
              <addrLine>Woodhouse Lane, Leeds  LS2 9JT</addrLine>
              <country key="GB"/>
            </address>
            <ref type="url">http://www.leeds.ac.uk/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-92966" status="OLD">
          <idno type="ROR">https://ror.org/028rypz17</idno>
          <orgName>Université Paris-Sud - Paris 11</orgName>
          <orgName type="acronym">UP11</orgName>
          <date type="end">2019-12-31</date>
          <desc>
            <address>
              <addrLine>Bâtiment 300 - 91405 Orsay cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.u-psud.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
      </listOrg>
      <listOrg type="projects">
        <org type="europeanProject" xml:id="projeurop-86649" status="VALID">
          <idno type="number">257039</idno>
          <idno type="program">ERC-2010-StG_20091028</idno>
          <idno type="call">ERC-2010-StG_20091028</idno>
          <orgName>CSP-COMPLEXITY</orgName>
          <desc>Constraint Satisfaction Problems: Algorithms and Complexity</desc>
          <date type="start">2011-01-01</date>
          <date type="end">2015-12-31</date>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>