PATCH graphs : An efficient data structure for complementation of finitely presented groups
Identifieur interne : 000C84 ( PascalFrancis/Checkpoint ); précédent : 000C83; suivant : 000C85PATCH graphs : An efficient data structure for complementation of finitely presented groups
Auteurs : C. Lynch [France] ; P. Strogova [France]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 1996.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
Based on a new data structure called PATCH Graph, an efficient completion procedure for finitely presented groups is described. A PATCH Graph represents rules and their symmetrized forms as cycles in a Cayley graph structure. Completion is easily performed directly on the graph, and structure sharing is enforced. The structure of the graph allows us to avoid certain redundant inferences. The PATCH Graph data structure and inference rules complement other extensions of Knuth-Bendix completion for finitely presented groups.
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Pascal:97-0017995Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">PATCH graphs : An efficient data structure for complementation of finitely presented groups</title><author><name sortKey="Lynch, C" sort="Lynch, C" uniqKey="Lynch C" first="C." last="Lynch">C. Lynch</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>INRIA Lorraine -CRIN, Technopôle de Nancy-Brabois, B.P. 101</s1><s2>54602 Villers-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><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><author><name sortKey="Strogova, P" sort="Strogova, P" uniqKey="Strogova P" first="P." last="Strogova">P. Strogova</name><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>INRIA Lorraine - CRIN and INRIA Rocquencourt, Technopôle de Nancy-Brabois, B.P. 101</s1><s2>54602 Villers-lès-Nancy</s2><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><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></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">97-0017995</idno><date when="1996">1996</date><idno type="stanalyst">PASCAL 97-0017995 INIST</idno><idno type="RBID">Pascal:97-0017995</idno><idno type="wicri:Area/PascalFrancis/Corpus">000D00</idno><idno type="wicri:Area/PascalFrancis/Curation">000B78</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000C84</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000C84</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">PATCH graphs : An efficient data structure for complementation of finitely presented groups</title><author><name sortKey="Lynch, C" sort="Lynch, C" uniqKey="Lynch C" first="C." last="Lynch">C. Lynch</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>INRIA Lorraine -CRIN, Technopôle de Nancy-Brabois, B.P. 101</s1><s2>54602 Villers-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ></inist:fA14><country>France</country><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><author><name sortKey="Strogova, P" sort="Strogova, P" uniqKey="Strogova P" first="P." last="Strogova">P. Strogova</name><affiliation wicri:level="3"><inist:fA14 i1="02"><s1>INRIA Lorraine - CRIN and INRIA Rocquencourt, Technopôle de Nancy-Brabois, B.P. 101</s1><s2>54602 Villers-lès-Nancy</s2><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><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><series><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno><imprint><date when="1996">1996</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Lecture notes in computer science</title><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Cayley graph</term><term>Cycle(graph)</term><term>Data structure</term><term>Graph theory</term><term>Inference rule</term><term>Semantics</term><term>Sharing</term><term>Soundness</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Partage</term><term>Cycle graphe</term><term>Graphe Cayley</term><term>Structure donnée</term><term>Règle inférence</term><term>Théorie graphe</term><term>Sémantique</term><term>Consistance sémantique</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Based on a new data structure called PATCH Graph, an efficient completion procedure for finitely presented groups is described. A PATCH Graph represents rules and their symmetrized forms as cycles in a Cayley graph structure. Completion is easily performed directly on the graph, and structure sharing is enforced. The structure of the graph allows us to avoid certain redundant inferences. The PATCH Graph data structure and inference rules complement other extensions of Knuth-Bendix completion for finitely presented groups.</div></front></TEI><inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0></fA01><fA05><s2>1138</s2></fA05><fA08 i1="01" i2="1" l="ENG"><s1>PATCH graphs : An efficient data structure for complementation of finitely presented groups</s1></fA08><fA09 i1="01" i2="1" l="ENG"><s1>AISMC-3 : artificial intelligence and symbolic mathematical computation : Steyr, September 23-25, 1996</s1></fA09><fA11 i1="01" i2="1"><s1>LYNCH (C.)</s1></fA11><fA11 i1="02" i2="1"><s1>STROGOVA (P.)</s1></fA11><fA12 i1="01" i2="1"><s1>CALMET (Jacques)</s1><s9>ed.</s9></fA12><fA12 i1="02" i2="1"><s1>CAMPBELL (John A.)</s1><s9>ed.</s9></fA12><fA12 i1="03" i2="1"><s1>PFALZGRAF (Jochen)</s1><s9>ed.</s9></fA12><fA14 i1="01"><s1>INRIA Lorraine -CRIN, Technopôle de Nancy-Brabois, B.P. 101</s1><s2>54602 Villers-lès-Nancy</s2><s3>FRA</s3><sZ>1 aut.</sZ></fA14><fA14 i1="02"><s1>INRIA Lorraine - CRIN and INRIA Rocquencourt, Technopôle de Nancy-Brabois, B.P. 101</s1><s2>54602 Villers-lès-Nancy</s2><s3>FRA</s3><sZ>2 aut.</sZ></fA14><fA20><s1>176-190</s1></fA20><fA21><s1>1996</s1></fA21><fA23 i1="01"><s0>ENG</s0></fA23><fA43 i1="01"><s1>INIST</s1><s2>16343</s2><s5>354000063989120110</s5></fA43><fA44><s0>0000</s0><s1>© 1997 INIST-CNRS. All rights reserved.</s1></fA44><fA45><s0>18 ref.</s0></fA45><fA47 i1="01" i2="1"><s0>97-0017995</s0></fA47><fA60><s1>P</s1><s2>C</s2></fA60><fA61><s0>A</s0></fA61><fA64 i1="01" i2="1"><s0>Lecture notes in computer science</s0></fA64><fA66 i1="01"><s0>DEU</s0></fA66><fA66 i1="02"><s0>USA</s0></fA66><fC01 i1="01" l="ENG"><s0>Based on a new data structure called PATCH Graph, an efficient completion procedure for finitely presented groups is described. A PATCH Graph represents rules and their symmetrized forms as cycles in a Cayley graph structure. Completion is easily performed directly on the graph, and structure sharing is enforced. The structure of the graph allows us to avoid certain redundant inferences. The PATCH Graph data structure and inference rules complement other extensions of Knuth-Bendix completion for finitely presented groups.</s0></fC01><fC02 i1="01" i2="X"><s0>001D02A06</s0></fC02><fC02 i1="02" i2="X"><s0>001D02A02</s0></fC02><fC02 i1="03" i2="X"><s0>001D02C02</s0></fC02><fC03 i1="01" i2="X" l="FRE"><s0>Partage</s0><s5>01</s5></fC03><fC03 i1="01" i2="X" l="ENG"><s0>Sharing</s0><s5>01</s5></fC03><fC03 i1="01" i2="X" l="SPA"><s0>Partición</s0><s5>01</s5></fC03><fC03 i1="02" i2="X" l="FRE"><s0>Cycle graphe</s0><s5>02</s5></fC03><fC03 i1="02" i2="X" l="ENG"><s0>Cycle(graph)</s0><s5>02</s5></fC03><fC03 i1="02" i2="X" l="SPA"><s0>Ciclo diagrama</s0><s5>02</s5></fC03><fC03 i1="03" i2="X" l="FRE"><s0>Graphe Cayley</s0><s5>03</s5></fC03><fC03 i1="03" i2="X" l="ENG"><s0>Cayley graph</s0><s5>03</s5></fC03><fC03 i1="03" i2="X" l="SPA"><s0>Grafo Cayley</s0><s5>03</s5></fC03><fC03 i1="04" i2="X" l="FRE"><s0>Structure donnée</s0><s5>04</s5></fC03><fC03 i1="04" i2="X" l="ENG"><s0>Data structure</s0><s5>04</s5></fC03><fC03 i1="04" i2="X" l="SPA"><s0>Estructura datos</s0><s5>04</s5></fC03><fC03 i1="05" i2="X" l="FRE"><s0>Règle inférence</s0><s5>05</s5></fC03><fC03 i1="05" i2="X" l="ENG"><s0>Inference rule</s0><s5>05</s5></fC03><fC03 i1="05" i2="X" l="SPA"><s0>Regla inferencia</s0><s5>05</s5></fC03><fC03 i1="06" i2="X" l="FRE"><s0>Théorie graphe</s0><s5>06</s5></fC03><fC03 i1="06" i2="X" l="ENG"><s0>Graph theory</s0><s5>06</s5></fC03><fC03 i1="06" i2="X" l="SPA"><s0>Teoría grafo</s0><s5>06</s5></fC03><fC03 i1="07" i2="X" l="FRE"><s0>Sémantique</s0><s5>07</s5></fC03><fC03 i1="07" i2="X" l="ENG"><s0>Semantics</s0><s5>07</s5></fC03><fC03 i1="07" i2="X" l="SPA"><s0>Semántica</s0><s5>07</s5></fC03><fC03 i1="08" i2="X" l="FRE"><s0>Consistance sémantique</s0><s5>08</s5></fC03><fC03 i1="08" i2="X" l="ENG"><s0>Soundness</s0><s5>08</s5></fC03><fC03 i1="08" i2="X" l="SPA"><s0>Consistencia semantica</s0><s5>08</s5></fC03><fN21><s1>006</s1></fN21></pA><pR><fA30 i1="01" i2="1" l="ENG"><s1>Artificial intelligence and symbolic mathematical computation. International conference</s1><s2>3</s2><s3>Steyr AUT</s3><s4>1996-09-23</s4></fA30></pR></standard></inist><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="Lynch, C" sort="Lynch, C" uniqKey="Lynch C" first="C." last="Lynch">C. Lynch</name></region><name sortKey="Strogova, P" sort="Strogova, P" uniqKey="Strogova P" first="P." last="Strogova">P. Strogova</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000C84 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000C84 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= PascalFrancis
|étape= Checkpoint
|type= RBID
|clé= Pascal:97-0017995
|texte= PATCH graphs : An efficient data structure for complementation of finitely presented groups
}}
| This area was generated with Dilib version V0.6.33. |  |