Matching in a Class of Combined Non-disjoint Theories
Identifieur interne : 007E12 ( Main/Merge ); précédent : 007E11; suivant : 007E13Matching in a Class of Combined Non-disjoint Theories
Auteurs : Christophe Ringeissen [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Solving equational problems is an ubiquitous process in automated deduction, where one needs for instance unification in completion procedures to compute critical pairs, and matching to apply rewrite rules. We present new equational matching and unification results in some combinations of non-disjoint equational theories. Some results are already known for theories sharing an appropriate notion of constructors. We investigate the idea of considering theories that are not explicitly based on the notion of constructors. In this direction, a new class of theories is presented, where a theory is defined as a union of two subtheories, one such that shared symbols do not affect the behavior of the theory, and another one given by a term rewrite system on shared symbols. Matching and unification problems are studied for this class of theories, and for unions of theories in this class. Results obtained for the matching problem are particularly relevant.
Url:
DOI: 10.1007/978-3-540-45085-6_17
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001E68
- to stream Istex, to step Curation: 001E44
- to stream Istex, to step Checkpoint: 001A23
Links to Exploration step
ISTEX:848CD1B788CEF025D0459457FAA34FA0A26EDE99Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Matching in a Class of Combined Non-disjoint Theories</title><author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:848CD1B788CEF025D0459457FAA34FA0A26EDE99</idno><date when="2003" year="2003">2003</date><idno type="doi">10.1007/978-3-540-45085-6_17</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-73CMT166-6/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001E68</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001E68</idno><idno type="wicri:Area/Istex/Curation">001E44</idno><idno type="wicri:Area/Istex/Checkpoint">001A23</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001A23</idno><idno type="wicri:doubleKey">0302-9743:2003:Ringeissen C:matching:in:a</idno><idno type="wicri:Area/Main/Merge">007E12</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Matching in a Class of Combined Non-disjoint Theories</title><author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name><affiliation wicri:level="3"><country xml:lang="fr">France</country><wicri:regionArea>LORIA – INRIA, 615, rue du Jardin Botanique, BP 101, 54602, Villers-lès-Nancy Cedex</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Villers-lès-Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></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: Solving equational problems is an ubiquitous process in automated deduction, where one needs for instance unification in completion procedures to compute critical pairs, and matching to apply rewrite rules. We present new equational matching and unification results in some combinations of non-disjoint equational theories. Some results are already known for theories sharing an appropriate notion of constructors. We investigate the idea of considering theories that are not explicitly based on the notion of constructors. In this direction, a new class of theories is presented, where a theory is defined as a union of two subtheories, one such that shared symbols do not affect the behavior of the theory, and another one given by a term rewrite system on shared symbols. Matching and unification problems are studied for this class of theories, and for unions of theories in this class. Results obtained for the matching problem are particularly relevant.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 007E12 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 007E12 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:848CD1B788CEF025D0459457FAA34FA0A26EDE99
|texte= Matching in a Class of Combined Non-disjoint Theories
}}
| This area was generated with Dilib version V0.6.33. |  |