PATCH Graphs: An efficient data structure for completion of finitely presented groups
Identifieur interne : 00C041 ( Main/Exploration ); précédent : 00C040; suivant : 00C042PATCH 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 ]
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
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
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001816
- to stream Istex, to step Curation: 001797
- to stream Istex, to step Checkpoint: 002942
- to stream Main, to step Merge: 00C862
- to stream PascalFrancis, to step Corpus: 000D00
- to stream PascalFrancis, to step Curation: 000B78
- to stream PascalFrancis, to step Checkpoint: 000C84
- to stream Main, to step Merge: 00C971
- to stream Main, to step Curation: 00C041
Le 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></author><author><name sortKey="Strogova, Polina" sort="Strogova, Polina" uniqKey="Strogova P" first="Polina" last="Strogova">Polina Strogova</name></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><idno type="wicri:Area/Istex/Checkpoint">002942</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">002942</idno><idno type="wicri:doubleKey">0302-9743:1996:Lynch C:patch:graphs:an</idno><idno type="wicri:Area/Main/Merge">00C862</idno><idno type="wicri:source">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><idno type="wicri:doubleKey">0302-9743:1996:Lynch C:patch:graphs:an</idno><idno type="wicri:Area/Main/Merge">00C971</idno><idno type="wicri:Area/Main/Curation">00C041</idno><idno type="wicri:Area/Main/Exploration">00C041</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="3"><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><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><author><name sortKey="Strogova, Polina" sort="Strogova, Polina" uniqKey="Strogova P" first="Polina" last="Strogova">Polina Strogova</name><affiliation wicri:level="3"><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><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><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><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>Consistance sémantique</term><term>Cycle graphe</term><term>Graphe Cayley</term><term>Partage</term><term>Règle inférence</term><term>Structure donnée</term><term>Sémantique</term><term>Théorie graphe</term></keywords></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><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, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name></region><name sortKey="Lynch, Christopher" sort="Lynch, Christopher" uniqKey="Lynch C" first="Christopher" last="Lynch">Christopher Lynch</name><name sortKey="Strogova, Polina" sort="Strogova, Polina" uniqKey="Strogova P" first="Polina" last="Strogova">Polina Strogova</name><name sortKey="Strogova, Polina" sort="Strogova, Polina" uniqKey="Strogova P" first="Polina" last="Strogova">Polina Strogova</name></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 00C041 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00C041 | 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:67DA9E6D9D304D82D80E853240AB62AAA64EF745
|texte= PATCH Graphs: An efficient data structure for completion of finitely presented groups
}}
| This area was generated with Dilib version V0.6.33. |  |