<?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 tel-01444799v1</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-26T13:59:14+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Harnessing tractability in constraint satisfaction problems</title>
            <title xml:lang="fr">Algorithmes paramétrés pour des problèmes de satisfaction de contraintes presque traitables</title>
            <author role="aut">
              <persName>
                <forename type="first">Clément</forename>
                <surname>Carbonnel</surname>
              </persName>
              <email type="md5">c74f55e1946173636658263e76fa187d</email>
              <email type="domain">laas.fr</email>
              <idno type="idhal" notation="string">clement-carbonnel</idno>
              <idno type="idhal" notation="numeric">13294</idno>
              <idno type="halauthorid" notation="string">1127774-13294</idno>
              <idno type="ORCID">https://orcid.org/0000-0003-2312-2687</idno>
              <idno type="IDREF">https://www.idref.fr/200673882</idno>
              <affiliation ref="#struct-395452"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Arlette</forename>
                <surname>Evrard</surname>
              </persName>
              <email type="md5">b2385a4c602954bb7e55759c88b44eff</email>
              <email type="domain">laas.fr.invalid</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2017-01-30 14:16:00</date>
              <date type="whenModified">2026-04-02 08:36:12</date>
              <date type="whenReleased">2017-02-03 18:22:03</date>
              <date type="whenProduced">2016-12-07</date>
              <date type="whenEndEmbargoed">2017-01-30</date>
              <ref type="file" target="https://laas.hal.science/tel-01444799v1/document">
                <date notBefore="2017-01-30"/>
              </ref>
              <ref type="file" n="1" target="https://laas.hal.science/tel-01444799v1/file/CARBONEL.pdf" id="file-1444799-1530854">
                <date notBefore="2017-01-30"/>
              </ref>
            </edition>
            <edition n="v2">
              <date type="whenSubmitted">2023-10-27 09:29:49</date>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="120939">
                <persName>
                  <forename>Arlette</forename>
                  <surname>Evrard</surname>
                </persName>
                <email type="md5">b2385a4c602954bb7e55759c88b44eff</email>
                <email type="domain">laas.fr.invalid</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">tel-01444799</idno>
            <idno type="halUri">https://laas.hal.science/tel-01444799</idno>
            <idno type="halBibtex">carbonnel:tel-01444799</idno>
            <idno type="halRefHtml">Computer Science [cs]. Institut National Polytechnique de Toulouse - INPT, 2016. English. &lt;a target="_blank" href="https://www.theses.fr/2016INPT0118"&gt;&amp;#x27E8;NNT : 2016INPT0118&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Computer Science [cs]. Institut National Polytechnique de Toulouse - INPT, 2016. English. &amp;#x27E8;NNT : 2016INPT0118&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1444799-1530854"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="AFPC">Thèses et HDR autour de la Programmation Par Contraintes</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="1">Not set</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Harnessing tractability in constraint satisfaction problems</title>
                <title xml:lang="fr">Algorithmes paramétrés pour des problèmes de satisfaction de contraintes presque traitables</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Clément</forename>
                    <surname>Carbonnel</surname>
                  </persName>
                  <email type="md5">c74f55e1946173636658263e76fa187d</email>
                  <email type="domain">laas.fr</email>
                  <idno type="idhal" notation="string">clement-carbonnel</idno>
                  <idno type="idhal" notation="numeric">13294</idno>
                  <idno type="halauthorid" notation="string">1127774-13294</idno>
                  <idno type="ORCID">https://orcid.org/0000-0003-2312-2687</idno>
                  <idno type="IDREF">https://www.idref.fr/200673882</idno>
                  <affiliation ref="#struct-395452"/>
                </author>
              </analytic>
              <monogr>
                <idno type="nnt">2016INPT0118</idno>
                <idno type="localRef">Rapport laas : 16478</idno>
                <imprint>
                  <date type="dateDefended">2016-12-07</date>
                </imprint>
                <authority type="institution">Institut National Polytechnique de Toulouse - INPT</authority>
                <authority type="school">École doctorale Mathématiques, informatique et télécommunications (Toulouse)</authority>
                <authority type="supervisor">Martin C. Cooper</authority>
                <authority type="supervisor">Emmanuel Hebrard</authority>
                <authority type="jury">Nadia Creignou [Président]</authority>
                <authority type="jury">Stanislav Zivny [Rapporteur]</authority>
                <authority type="jury">Stefan Szeider [Rapporteur]</authority>
                <authority type="jury">Philippe Jégou</authority>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">polymorphism</term>
                <term xml:lang="en">tractable class</term>
                <term xml:lang="en">Constraint satisfaction problem</term>
                <term xml:lang="en">backdoor</term>
                <term xml:lang="en">parameterized complexity</term>
                <term xml:lang="en">kernelization</term>
                <term xml:lang="fr"> Problème de satisfaction de contraintes</term>
                <term xml:lang="fr"> Polymorphisme</term>
                <term xml:lang="fr"> Classe traitable</term>
                <term xml:lang="fr"> Complexité paramétrée</term>
                <term xml:lang="fr"> Kernelization</term>
              </keywords>
              <classCode scheme="halDomain" n="info">Computer Science [cs]</classCode>
              <classCode scheme="halTypology" n="THESE">Theses</classCode>
              <classCode scheme="halOldTypology" n="THESE">Theses</classCode>
              <classCode scheme="halTreeTypology" n="THESE">Theses</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>The Constraint Satisfaction Problem (CSP) is a fundamental NP-complete problem with many applications in artificial intelligence. This problem has enjoyed considerable scientific attention in the past decades due to its practical usefulness and the deep theoretical questions it relates to. However, there is a wide gap between practitioners, who develop solving techniques that are efficient for industrial instances but exponential in the worst case, and theorists who design sophisticated polynomial-time algorithms for restrictions of CSP defined by certain algebraic properties. In this thesis we attempt to bridge this gap by providing polynomial-time algorithms to test for membership in a selection of major tractable classes. Even if the instance does not belong to one of these classes, we investigate the possibility of decomposing efficiently a CSP instance into tractable subproblems through the lens of parameterized complexity. Finally, we propose a general framework to adapt the concept of kernelization, central to parameterized complexity but hitherto rarely used in practice, to the context of constraint reasoning. Preliminary experiments on this last contribution show promising results.</p>
            </abstract>
            <abstract xml:lang="fr">
              <p>Le problème de satisfaction de contraintes (CSP) est un problème NP-complet classique en intelligence artificielle qui a suscité un engouement important de la communauté scientifique grâce à la richesse de ses aspects pratiques et théoriques. Cependant, au fil des années un gouffre s'est creusé entre les praticiens, qui développent des méthodes exponentielles mais efficaces pour résoudre des instances industrielles, et les théoriciens qui conçoivent des algorithmes sophistiqués pour résoudre en temps polynomial certaines restrictions de CSP dont l'intérêt pratique n'est pas avéré. Dans cette thèse nous tentons de réconcilier les deux communautés en fournissant des méthodes polynomiales pour tester automatiquement l'appartenance d'une instance de CSP à une sélection de classes traitables majeures. Anticipant la possibilité que les instances réelles ne tombent que rarement dans ces classes traitables, nous analysons également de manière systématique la possibilité de décomposer efficacement une instance en sous-problèmes traitables en utilisant des méthodes de complexité paramétrée. Finalement, nous introduisons un cadre général pour exploiter dans les CSP les idées développées pour la kernelization, un concept fondamental de complexité paramétrée jusqu'ici peu utilisé en pratique. Ce dernier point est appuyé par des expérimentations prometteuses.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-395452" status="OLD">
          <orgName>Équipe Recherche Opérationnelle, Optimisation Combinatoire et Contraintes</orgName>
          <orgName type="acronym">LAAS-ROC</orgName>
          <date type="end">2025-01-01</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.laas.fr/public/fr/roc</ref>
          </desc>
          <listRelation>
            <relation active="#struct-459" type="direct"/>
            <relation active="#struct-81148" type="indirect"/>
            <relation name="443875" active="#struct-443875" type="indirect"/>
            <relation active="#struct-116255" type="indirect"/>
            <relation active="#struct-301232" type="indirect"/>
            <relation active="#struct-443875" type="indirect"/>
            <relation active="#struct-116256" type="indirect"/>
            <relation active="#struct-217752" type="indirect"/>
            <relation name="UPR8001" active="#struct-441569" type="indirect"/>
            <relation active="#struct-448187" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-459" status="OLD">
          <idno type="IdRef">199278792</idno>
          <idno type="ISNI">0000 0001 2188 216X </idno>
          <idno type="RNSR">199517454Y</idno>
          <idno type="ROR">https://ror.org/03vcm6439</idno>
          <orgName>Laboratoire d'analyse et d'architecture des systèmes</orgName>
          <orgName type="acronym">LAAS</orgName>
          <date type="start">1968-01-01</date>
          <date type="end">2025-01-01</date>
          <desc>
            <address>
              <addrLine>7 Av du colonel Roche 31077 TOULOUSE CEDEX 4</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.laas.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-81148" type="direct"/>
            <relation name="443875" active="#struct-443875" type="indirect"/>
            <relation active="#struct-116255" type="direct"/>
            <relation active="#struct-301232" type="indirect"/>
            <relation active="#struct-443875" type="indirect"/>
            <relation active="#struct-116256" type="direct"/>
            <relation active="#struct-217752" type="direct"/>
            <relation name="UPR8001" active="#struct-441569" type="direct"/>
            <relation active="#struct-448187" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-81148" status="VALID">
          <idno type="IdRef">026404354</idno>
          <idno type="ISNI">0000000121902837</idno>
          <idno type="ROR">https://ror.org/0443n9e75</idno>
          <orgName>Université Toulouse Capitole</orgName>
          <orgName type="acronym">UT Capitole</orgName>
          <date type="start">1970-01-01</date>
          <desc>
            <address>
              <addrLine>2 rue du Doyen-Gabriel-Marty - 31042 Toulouse Cedex 9</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ut-capitole.fr/</ref>
          </desc>
          <listRelation>
            <relation name="443875" active="#struct-443875" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-443875" status="VALID">
          <idno type="ROR">https://ror.org/017tgbk05</idno>
          <orgName>Communauté d'universités et établissements de Toulouse</orgName>
          <orgName type="acronym">Comue de Toulouse</orgName>
          <desc>
            <address>
              <addrLine>41 Allée Jules Guesde, 31000 Toulouse</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.univ-toulouse.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-116255" status="VALID">
          <idno type="IdRef">026388766</idno>
          <idno type="ISNI">0000 0001 2286 8343</idno>
          <idno type="ROR">https://ror.org/01h8pf755</idno>
          <idno type="Wikidata">Q858979</idno>
          <orgName>Institut National des Sciences Appliquées - Toulouse</orgName>
          <orgName type="acronym">INSA Toulouse</orgName>
          <date type="start">1963-10-21</date>
          <desc>
            <address>
              <addrLine>135, avenue de Rangueil - 31077 Toulouse cedex 4</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.insa-toulouse.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301232" type="direct"/>
            <relation active="#struct-443875" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-301232" status="VALID">
          <idno type="IdRef">162105150</idno>
          <orgName>Institut National des Sciences Appliquées</orgName>
          <orgName type="acronym">INSA</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
          </desc>
        </org>
        <org type="institution" xml:id="struct-116256" status="VALID">
          <idno type="IdRef">026403994</idno>
          <idno type="ROR">https://ror.org/04ezk3x31</idno>
          <orgName>Université Toulouse - Jean Jaurès</orgName>
          <orgName type="acronym">UT2J</orgName>
          <date type="start">1971-01-01</date>
          <desc>
            <address>
              <addrLine>5 allées Antonio Machado - 31058 Toulouse Cedex 9</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-tlse2.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-443875" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-217752" status="OLD">
          <idno type="IdRef">026404672</idno>
          <idno type="ISNI">0000000121617331</idno>
          <idno type="ROR">https://ror.org/02v6kpv12</idno>
          <idno type="Wikidata">Q1273188</idno>
          <orgName>Université Toulouse III - Paul Sabatier</orgName>
          <orgName type="acronym">UT3</orgName>
          <date type="end">2025-01-01</date>
          <desc>
            <address>
              <addrLine>118 route de Narbonne - 31062 Toulouse</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-tlse3.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-443875" type="direct"/>
          </listRelation>
        </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-448187" status="VALID">
          <idno type="IdRef">026388820</idno>
          <idno type="ISNI">0000000121766169</idno>
          <idno type="ROR">https://ror.org/033p9g875</idno>
          <orgName>Institut National Polytechnique (Toulouse)</orgName>
          <orgName type="acronym">Toulouse INP</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.inp-toulouse.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-443875" type="direct"/>
          </listRelation>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>