PATCH Graphs: An efficient data structure for completion of finitely presented groups
Identifieur interne : 001797 ( Istex/Curation ); précédent : 001796; suivant : 001798PATCH Graphs: An efficient data structure for completion of finitely presented groups
Auteurs : Christopher Lynch [France] ; Polina Strogova [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
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.
Url:
DOI: 10.1007/3-540-61732-9_57
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: Pour aller vers cette notice dans l'étape Curation :001816
Links to Exploration step
ISTEX:67DA9E6D9D304D82D80E853240AB62AAA64EF745Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">PATCH Graphs: An efficient data structure for completion of finitely presented groups</title><author><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name><affiliation wicri:level="1"><mods:affiliation>Technopôle de Nancy-Brabois, INRIA Lorraine-CRIN, B.P. 101, 54602, Villers-lès-Nancy Cedex, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>Technopôle de Nancy-Brabois, INRIA Lorraine-CRIN, B.P. 101, 54602, Villers-lès-Nancy Cedex</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: lynch@loria.fr</mods:affiliation><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Strogova, Polina" sort="Strogova, Polina" uniqKey="Strogova P" first="Polina" last="Strogova">Polina Strogova</name><affiliation wicri:level="1"><mods:affiliation>Technopôle de Nancy-Brabois, INRIA Lorraine-CRIN and INRIA Rocquencourt, B.P. 101, 54602, Villers-lès-Nancy Cedex, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>Technopôle de Nancy-Brabois, INRIA Lorraine-CRIN and INRIA Rocquencourt, B.P. 101, 54602, Villers-lès-Nancy Cedex</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: strogova@loria.fr</mods:affiliation><country wicri:rule="url">France</country></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:67DA9E6D9D304D82D80E853240AB62AAA64EF745</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1007/3-540-61732-9_57</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-RHR38WQ5-7/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">001816</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001816</idno><idno type="wicri:Area/Istex/Curation">001797</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">PATCH Graphs: An efficient data structure for completion of finitely presented groups</title><author><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name><affiliation wicri:level="1"><mods:affiliation>Technopôle de Nancy-Brabois, INRIA Lorraine-CRIN, B.P. 101, 54602, Villers-lès-Nancy Cedex, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>Technopôle de Nancy-Brabois, INRIA Lorraine-CRIN, B.P. 101, 54602, Villers-lès-Nancy Cedex</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: lynch@loria.fr</mods:affiliation><country wicri:rule="url">France</country></affiliation></author><author><name sortKey="Strogova, Polina" sort="Strogova, Polina" uniqKey="Strogova P" first="Polina" last="Strogova">Polina Strogova</name><affiliation wicri:level="1"><mods:affiliation>Technopôle de Nancy-Brabois, INRIA Lorraine-CRIN and INRIA Rocquencourt, B.P. 101, 54602, Villers-lès-Nancy Cedex, France</mods:affiliation><country xml:lang="fr">France</country><wicri:regionArea>Technopôle de Nancy-Brabois, INRIA Lorraine-CRIN and INRIA Rocquencourt, B.P. 101, 54602, Villers-lès-Nancy Cedex</wicri:regionArea></affiliation><affiliation wicri:level="1"><mods:affiliation>E-mail: strogova@loria.fr</mods:affiliation><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><title level="s" type="abbrev">Lect Notes Comput Sci</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: 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></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001797 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Curation/biblio.hfd -nk 001797 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Curation
|type= RBID
|clé= ISTEX:67DA9E6D9D304D82D80E853240AB62AAA64EF745
|texte= PATCH Graphs: An efficient data structure for completion of finitely presented groups
}}
| This area was generated with Dilib version V0.6.33. |  |