Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories
Identifieur interne : 00C082 ( Main/Exploration ); précédent : 00C081; suivant : 00C083Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories
Auteurs : Christophe Ringeissen [France]Source :
- Information and Computation [ 0890-5401 ] ; 1996.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
- Teeft :
- Admissible identifications, Algorithm, Alien subterm, Alien subterms, Artificial intelligence, Axiom, Baader, Boolean theory, Boudet, Christophe, Christophe ringeissen, Combinable, Combinable problems, Combination problem, Combination techniques, Compound cycle, Computer science, Constant elimination algorithm, Constant elimination problem, Constant restriction, Decidable, Decision algorithms, Disjoint, Disjoint theories, Empty theory, Equational, Equational theories, Equational theory, Finitary, Free constants, Free symbol, Free symbols, General case, Ground term, Idempotent substitution, Instantiated, International conference, Kirchner, Lecture notes, Linear term, Linear theories, Linear theory, Lop8m, Nipkow, Page codes, Pure problems, Pure unification problems, Regular case, Regular theories, Resp, Restriction, Right purification, Ringeissen, Schmidt schau, Schulz, Skolemized, Skolemized variables, Solvable, Substitution, Subterms, Symbolic comput, Unification, Unification algorithm, Unification algorithms, Unification problem, Unification problems, Variable abstraction, Variables instantiated, Vran.
Abstract
Abstract: This paper addresses the problem of systematically building a matching algorithm for the union of two disjoint theoriesE1∪E2provided that matching algorithms are known in both theoriesE1andE2. In general, the blind use of combination techniques introduces unification. Two different restrictions are considered in order to reduce this unification to matching. First, we show that combining matching algorithms (with linear constant restriction) is always sufficient for solving a pure fragment of combined matching problems. Second, the investigated method is complete for the largest class of theories where unification is not needed, including regular collapse-free theories and linear theories. Syntactic conditions are given to define this class of theories in which solving the combined matching problem is performed in a modular way.
Url:
DOI: 10.1006/inco.1996.0042
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002B19
- to stream Istex, to step Curation: 002A82
- to stream Istex, to step Checkpoint: 002983
- to stream Main, to step Merge: 00C903
- to stream PascalFrancis, to step Corpus: 000D39
- to stream PascalFrancis, to step Curation: 000B52
- to stream PascalFrancis, to step Checkpoint: 000D00
- to stream Main, to step Merge: 00C987
- to stream Main, to step Curation: 00C082
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Combining Decision Algorithms for Matching in the Union of Disjoint Equational 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:B688D1C4DF509AD183118B1DC142C6BAC35430DF</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1006/inco.1996.0042</idno><idno type="url">https://api.istex.fr/ark:/67375/6H6-M0R3H1MF-R/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002B19</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002B19</idno><idno type="wicri:Area/Istex/Curation">002A82</idno><idno type="wicri:Area/Istex/Checkpoint">002983</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002983</idno><idno type="wicri:doubleKey">0890-5401:1996:Ringeissen C:combining:decision:algorithms</idno><idno type="wicri:Area/Main/Merge">00C903</idno><idno type="wicri:source">INIST</idno><idno type="RBID">Pascal:96-0319471</idno><idno type="wicri:Area/PascalFrancis/Corpus">000D39</idno><idno type="wicri:Area/PascalFrancis/Curation">000B52</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000D00</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000D00</idno><idno type="wicri:doubleKey">0890-5401:1996:Ringeissen C:combining:decision:algorithms</idno><idno type="wicri:Area/Main/Merge">00C987</idno><idno type="wicri:Area/Main/Curation">00C082</idno><idno type="wicri:Area/Main/Exploration">00C082</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Combining Decision Algorithms for Matching in the Union of Disjoint Equational 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>INRIA-Lorraine and CRIN-CNRS, Technopôle de Nancy-Brabois—Campus Scientifique, 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></author></analytic><monogr></monogr><series><title level="j">Information and Computation</title><title level="j" type="abbrev">YINCO</title><idno type="ISSN">0890-5401</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1996">1996</date><biblScope unit="volume">126</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="144">144</biblScope><biblScope unit="page" to="160">160</biblScope></imprint><idno type="ISSN">0890-5401</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0890-5401</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithms</term><term>Combinatorial problem</term><term>Decision tree</term><term>Order restriction</term><term>Pattern matching</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Algorithme</term><term>Arbre décision</term><term>Concordance forme</term><term>Problème combinatoire</term><term>Restriction ordre</term></keywords><keywords scheme="Teeft" xml:lang="en"><term>Admissible identifications</term><term>Algorithm</term><term>Alien subterm</term><term>Alien subterms</term><term>Artificial intelligence</term><term>Axiom</term><term>Baader</term><term>Boolean theory</term><term>Boudet</term><term>Christophe</term><term>Christophe ringeissen</term><term>Combinable</term><term>Combinable problems</term><term>Combination problem</term><term>Combination techniques</term><term>Compound cycle</term><term>Computer science</term><term>Constant elimination algorithm</term><term>Constant elimination problem</term><term>Constant restriction</term><term>Decidable</term><term>Decision algorithms</term><term>Disjoint</term><term>Disjoint theories</term><term>Empty theory</term><term>Equational</term><term>Equational theories</term><term>Equational theory</term><term>Finitary</term><term>Free constants</term><term>Free symbol</term><term>Free symbols</term><term>General case</term><term>Ground term</term><term>Idempotent substitution</term><term>Instantiated</term><term>International conference</term><term>Kirchner</term><term>Lecture notes</term><term>Linear term</term><term>Linear theories</term><term>Linear theory</term><term>Lop8m</term><term>Nipkow</term><term>Page codes</term><term>Pure problems</term><term>Pure unification problems</term><term>Regular case</term><term>Regular theories</term><term>Resp</term><term>Restriction</term><term>Right purification</term><term>Ringeissen</term><term>Schmidt schau</term><term>Schulz</term><term>Skolemized</term><term>Skolemized variables</term><term>Solvable</term><term>Substitution</term><term>Subterms</term><term>Symbolic comput</term><term>Unification</term><term>Unification algorithm</term><term>Unification algorithms</term><term>Unification problem</term><term>Unification problems</term><term>Variable abstraction</term><term>Variables instantiated</term><term>Vran</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This paper addresses the problem of systematically building a matching algorithm for the union of two disjoint theoriesE1∪E2provided that matching algorithms are known in both theoriesE1andE2. In general, the blind use of combination techniques introduces unification. Two different restrictions are considered in order to reduce this unification to matching. First, we show that combining matching algorithms (with linear constant restriction) is always sufficient for solving a pure fragment of combined matching problems. Second, the investigated method is complete for the largest class of theories where unification is not needed, including regular collapse-free theories and linear theories. Syntactic conditions are given to define this class of theories in which solving the combined matching problem is performed in a modular way.</div></front></TEI><affiliations><list><country><li>France</li></country><region><li>Grand Est</li><li>Lorraine (région)</li></region><settlement><li>Villers-lès-Nancy</li></settlement></list><tree><country name="France"><region name="Grand Est"><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C082 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00C082 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:B688D1C4DF509AD183118B1DC142C6BAC35430DF
|texte= Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories
}}
| This area was generated with Dilib version V0.6.33. |  |