Obtaining Finite Local Theory Axiomatizations via Saturation
Identifieur interne : 000153 ( Istex/Checkpoint ); précédent : 000152; suivant : 000154Obtaining Finite Local Theory Axiomatizations via Saturation
Auteurs : Matthias Horbach [Allemagne] ; Viorica Sofronie-Stokkermans [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: In this paper we present a method for obtaining local sets of clauses from possibly non-local ones. For this, we follow the work of Basin and Ganzinger and use saturation under a version of ordered resolution. In order to address the fact that saturation can generate infinite sets of clauses, we use constrained clauses and show that a link can be established between saturation and locality also for constrained clauses: This often allows us to give a finite representation of possibly infinite saturated sets of clauses.
Url:
DOI: 10.1007/978-3-642-40885-4_14
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
ISTEX:5BB3F2A9A79846A2A54B064A59E4F4C2133CEB67Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Obtaining Finite Local Theory Axiomatizations via Saturation</title>
<author><name sortKey="Horbach, Matthias" sort="Horbach, Matthias" uniqKey="Horbach M" first="Matthias" last="Horbach">Matthias Horbach</name>
</author>
<author><name sortKey="Sofronie Stokkermans, Viorica" sort="Sofronie Stokkermans, Viorica" uniqKey="Sofronie Stokkermans V" first="Viorica" last="Sofronie-Stokkermans">Viorica Sofronie-Stokkermans</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:5BB3F2A9A79846A2A54B064A59E4F4C2133CEB67</idno>
<date when="2013" year="2013">2013</date>
<idno type="doi">10.1007/978-3-642-40885-4_14</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-988NXHQF-B/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001527</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001527</idno>
<idno type="wicri:Area/Istex/Curation">001509</idno>
<idno type="wicri:Area/Istex/Checkpoint">000153</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000153</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Obtaining Finite Local Theory Axiomatizations via Saturation</title>
<author><name sortKey="Horbach, Matthias" sort="Horbach, Matthias" uniqKey="Horbach M" first="Matthias" last="Horbach">Matthias Horbach</name>
<affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>University Koblenz-Landau and Max-Planck-Institut für Informatik, Saarbrücken</wicri:regionArea>
<placeName><region type="land" nuts="2">Sarre (Land)</region>
<settlement type="city">Sarrebruck</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Sofronie Stokkermans, Viorica" sort="Sofronie Stokkermans, Viorica" uniqKey="Sofronie Stokkermans V" first="Viorica" last="Sofronie-Stokkermans">Viorica Sofronie-Stokkermans</name>
<affiliation wicri:level="3"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>University Koblenz-Landau and Max-Planck-Institut für Informatik, Saarbrücken</wicri:regionArea>
<placeName><region type="land" nuts="2">Sarre (Land)</region>
<settlement type="city">Sarrebruck</settlement>
</placeName>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: In this paper we present a method for obtaining local sets of clauses from possibly non-local ones. For this, we follow the work of Basin and Ganzinger and use saturation under a version of ordered resolution. In order to address the fact that saturation can generate infinite sets of clauses, we use constrained clauses and show that a link can be established between saturation and locality also for constrained clauses: This often allows us to give a finite representation of possibly infinite saturated sets of clauses.</div>
</front>
</TEI>
<affiliations><list><country><li>Allemagne</li>
</country>
<region><li>Sarre (Land)</li>
</region>
<settlement><li>Sarrebruck</li>
</settlement>
</list>
<tree><country name="Allemagne"><region name="Sarre (Land)"><name sortKey="Horbach, Matthias" sort="Horbach, Matthias" uniqKey="Horbach M" first="Matthias" last="Horbach">Matthias Horbach</name>
</region>
<name sortKey="Sofronie Stokkermans, Viorica" sort="Sofronie Stokkermans, Viorica" uniqKey="Sofronie Stokkermans V" first="Viorica" last="Sofronie-Stokkermans">Viorica Sofronie-Stokkermans</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000153 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 000153 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Istex |étape= Checkpoint |type= RBID |clé= ISTEX:5BB3F2A9A79846A2A54B064A59E4F4C2133CEB67 |texte= Obtaining Finite Local Theory Axiomatizations via Saturation }}
This area was generated with Dilib version V0.6.33. |