<?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-00189067</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-19T03:31:50+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Path constraints in semistructured data</title>
            <author role="aut">
              <persName>
                <forename type="first">Yves</forename>
                <surname>André</surname>
              </persName>
              <idno type="halauthorid">114230-0</idno>
              <affiliation ref="#struct-2546"/>
              <affiliation ref="#struct-56014"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Anne-Cécile</forename>
                <surname>Caron</surname>
              </persName>
              <email type="md5">ed1d31bb490305593d2573f095070e46</email>
              <email type="domain">univ-lille.fr</email>
              <idno type="idhal" notation="string">anne-cecile-caron</idno>
              <idno type="idhal" notation="numeric">8109</idno>
              <idno type="halauthorid" notation="string">7668-8109</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-6672-5686</idno>
              <idno type="IDREF">https://www.idref.fr/122579127</idno>
              <affiliation ref="#struct-2546"/>
              <affiliation ref="#struct-56014"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Denis</forename>
                <surname>Debarbieux</surname>
              </persName>
              <idno type="halauthorid">243596-0</idno>
              <affiliation ref="#struct-2546"/>
              <affiliation ref="#struct-56014"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Yves</forename>
                <surname>Roos</surname>
              </persName>
              <email type="md5">cedea25c8a2ba0b544957e25fcd43304</email>
              <email type="domain">univ-lille.fr</email>
              <idno type="idhal" notation="string">yves-roos</idno>
              <idno type="idhal" notation="numeric">20132</idno>
              <idno type="halauthorid" notation="string">5630-20132</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-5045-4399</idno>
              <idno type="IDREF">https://www.idref.fr/121208915</idno>
              <affiliation ref="#struct-2546"/>
              <affiliation ref="#struct-56014"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Sophie</forename>
                <surname>Tison</surname>
              </persName>
              <email type="md5">5b40f527b823c65138088ebe318ac779</email>
              <email type="domain">univ-lille.fr</email>
              <idno type="idhal" notation="string">sophie-tison</idno>
              <idno type="idhal" notation="numeric">176672</idno>
              <idno type="halauthorid" notation="string">145945-176672</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-8426-6230</idno>
              <idno type="IDREF">https://www.idref.fr/080475205</idno>
              <affiliation ref="#struct-2546"/>
              <affiliation ref="#struct-56014"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Denis</forename>
                <surname>Debarbieux</surname>
              </persName>
              <email type="md5">0489edd3e77a607ede45d12b0d46f6b2</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2011-09-08 17:07:58</date>
              <date type="whenModified">2025-02-26 15:33:49</date>
              <date type="whenReleased">2011-09-09 09:25:50</date>
              <date type="whenProduced">2007-10-15</date>
              <date type="whenEndEmbargoed">2011-09-08</date>
              <ref type="file" target="https://hal.science/hal-00189067v1/document">
                <date notBefore="2011-09-08"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-00189067v1/file/tcs.pdf" id="file-189067-627461">
                <date notBefore="2011-09-08"/>
              </ref>
              <ref type="externalLink" target="https://doi.org/10.1016/j.tcs.2007.05.010"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="164410">
                <persName>
                  <forename>Denis</forename>
                  <surname>Debarbieux</surname>
                </persName>
                <email type="md5">0489edd3e77a607ede45d12b0d46f6b2</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00189067</idno>
            <idno type="halUri">https://hal.science/hal-00189067</idno>
            <idno type="halBibtex">andre:hal-00189067</idno>
            <idno type="halRefHtml">&lt;i&gt;Theoretical Computer Science&lt;/i&gt;, 2007, 385 (1-3), pp.11-33. &lt;a target="_blank" href="https://dx.doi.org/10.1016/j.tcs.2007.05.010"&gt;&amp;#x27E8;10.1016/j.tcs.2007.05.010&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">Theoretical Computer Science, 2007, 385 (1-3), pp.11-33. &amp;#x27E8;10.1016/j.tcs.2007.05.010&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-189067-627461"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="UNIV-LILLE3">Université de Lille Sciences humaines et sociales</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA-LILLE">INRIA Lille - Nord Europe</idno>
            <idno type="stamp" n="LIFL">Laboratoire d'Informatique Fondamentale de Lille</idno>
            <idno type="stamp" n="MOSTRARE">MOSTRARE- Modeling Tree Structures, Machine Learning, and Information Extraction</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</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">Path constraints in semistructured data</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Yves</forename>
                    <surname>André</surname>
                  </persName>
                  <idno type="halauthorid">114230-0</idno>
                  <affiliation ref="#struct-2546"/>
                  <affiliation ref="#struct-56014"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Anne-Cécile</forename>
                    <surname>Caron</surname>
                  </persName>
                  <email type="md5">ed1d31bb490305593d2573f095070e46</email>
                  <email type="domain">univ-lille.fr</email>
                  <idno type="idhal" notation="string">anne-cecile-caron</idno>
                  <idno type="idhal" notation="numeric">8109</idno>
                  <idno type="halauthorid" notation="string">7668-8109</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-6672-5686</idno>
                  <idno type="IDREF">https://www.idref.fr/122579127</idno>
                  <affiliation ref="#struct-2546"/>
                  <affiliation ref="#struct-56014"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Denis</forename>
                    <surname>Debarbieux</surname>
                  </persName>
                  <idno type="halauthorid">243596-0</idno>
                  <affiliation ref="#struct-2546"/>
                  <affiliation ref="#struct-56014"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Yves</forename>
                    <surname>Roos</surname>
                  </persName>
                  <email type="md5">cedea25c8a2ba0b544957e25fcd43304</email>
                  <email type="domain">univ-lille.fr</email>
                  <idno type="idhal" notation="string">yves-roos</idno>
                  <idno type="idhal" notation="numeric">20132</idno>
                  <idno type="halauthorid" notation="string">5630-20132</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-5045-4399</idno>
                  <idno type="IDREF">https://www.idref.fr/121208915</idno>
                  <affiliation ref="#struct-2546"/>
                  <affiliation ref="#struct-56014"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Sophie</forename>
                    <surname>Tison</surname>
                  </persName>
                  <email type="md5">5b40f527b823c65138088ebe318ac779</email>
                  <email type="domain">univ-lille.fr</email>
                  <idno type="idhal" notation="string">sophie-tison</idno>
                  <idno type="idhal" notation="numeric">176672</idno>
                  <idno type="halauthorid" notation="string">145945-176672</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-8426-6230</idno>
                  <idno type="IDREF">https://www.idref.fr/080475205</idno>
                  <affiliation ref="#struct-2546"/>
                  <affiliation ref="#struct-56014"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">19594</idno>
                <idno type="issn">0304-3975</idno>
                <idno type="eissn">1879-2294</idno>
                <title level="j">Theoretical Computer Science</title>
                <imprint>
                  <publisher>Elsevier</publisher>
                  <biblScope unit="volume">385</biblScope>
                  <biblScope unit="issue">1-3</biblScope>
                  <biblScope unit="pp">11-33</biblScope>
                  <date type="datePub">2007-10-15</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1016/j.tcs.2007.05.010</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Semistructured data graph</term>
                <term xml:lang="en">Path inclusion</term>
                <term xml:lang="en">Prefix rewriting</term>
                <term xml:lang="en">(finite) Exact model</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-cl">Computer Science [cs]/Computation and Language [cs.CL]</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>We consider semistructured data as multirooted edge-labelled directed graphs, and path inclusion constraints on these graphs. A path inclusion constraint pnot precedes, equalsq is satisfied by a semistructured data if any node reached by the regular query p is also reached by the regular query q. In this paper, two problems are mainly studied: the implication problem and the problem of the existence of a finite exact model. - We give a new decision algorithm for the implication problem of a constraint pnot precedes, equalsq by a set of bounded path constraints pinot precedes, equalsui where p, q, and the pi's are regular path expressions and the ui's are words, improving in this particular case, the more general algorithms of S. Abiteboul and V. Vianu, and N. Alechina et al. In the case of a set of word equalities ui≡vi, we provide a more efficient decision algorithm for the implication of a word equality u≡v, improving the more general algorithm of P. Buneman et al. We prove that, in this case, implication for nondeterministic models is equivalent to implication for (complete) deterministic ones. - We introduce the notion of exact model: an exact model of a set of path constraints Click to view the MathML source satisfies the constraint pnot precedes, equalsq if and only if this constraint is implied by Click to view the MathML source. We prove that any set of constraints has an exact model and we give a decidable characterization of data which are exact models of bounded path inclusion constraints sets.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-2546" status="OLD">
          <orgName>Laboratoire d'Informatique Fondamentale de Lille</orgName>
          <orgName type="acronym">LIFL</orgName>
          <desc>
            <address>
              <addrLine>Bâtiment M3 59655 Villeneuve d'Ascq Cédex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.lifl.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-92973" type="direct"/>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-301700" type="direct"/>
            <relation name="UMR8022" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="researchteam" xml:id="struct-56014" status="OLD">
          <idno type="RNSR">200418288R</idno>
          <orgName>Modeling Tree Structures, Machine Learning, and Information Extraction</orgName>
          <orgName type="acronym">MOSTRARE</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/mostrare</ref>
          </desc>
          <listRelation>
            <relation active="#struct-2546" type="direct"/>
            <relation active="#struct-92973" type="indirect"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-301700" type="indirect"/>
            <relation name="UMR8022" active="#struct-441569" type="indirect"/>
            <relation active="#struct-104752" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-92973" status="OLD">
          <idno type="IdRef">026404184</idno>
          <idno type="ROR">https://ror.org/0546v5182</idno>
          <orgName>Université de Lille, Sciences et Technologies</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>Cité Scientifique - 59655 Villeneuve d'Ascq Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lille1.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-301700" status="OLD">
          <idno type="IdRef">026404524</idno>
          <idno type="ISNI">0000000121517701</idno>
          <idno type="ROR">https://ror.org/025b4c754</idno>
          <orgName>Université de Lille, Sciences Humaines et Sociales</orgName>
          <date type="end">2017-12-31</date>
          <desc>
            <address>
              <addrLine>Domaine universitaire du "Pont de Bois"Rue du Barreau BP 60149 59653 Villeneuve d'Ascq Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lille3.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="laboratory" xml:id="struct-104752" status="VALID">
          <idno type="RNSR">200818245B</idno>
          <idno type="ROR">https://ror.org/04eej9726</idno>
          <orgName>Centre Inria de l'Université de Lille</orgName>
          <desc>
            <address>
              <addrLine>Parc Scientifique de la Haute Borne 40, avenue Halley Bât.A, Park Plaza 59650 Villeneuve d'Ascq</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/lille/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>