SOUR graphs for efficient completion - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 1998

SOUR graphs for efficient completion


We introduce a data structure called \emphSOUR graphs and present an efficient Knuth-Bendix completion procedure based on it. \emphSOUR graphs allow for a maximal structure sharing of terms in rewriting systems. The term representation is a dag representation, except that edges are labelled with equational constraints and variable renamings. The rewrite rules correspond to rewrite edges, the unification problems to unification edges. The Critical Pair and Simplification inferences are recognized as patterns in the graph and are performed as local graph transformations. Our algorithm avoids duplicating term structure while performing inferences, which causes exponential behavior in the standard procedure. This approach gives a basis to design other completion algorithms, such as goal-oriented completion, concurrent completion and group completion procedures.
Fichier principal
Vignette du fichier
dm020101.pdf (274.73 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00958899 , version 1 (13-03-2014)



Christopher Lynch, Polina Strogova. SOUR graphs for efficient completion. Discrete Mathematics and Theoretical Computer Science, 1998, Vol. 2, pp.1-25. ⟨10.46298/dmtcs.247⟩. ⟨hal-00958899⟩
172 View
872 Download



Gmail Mastodon Facebook X LinkedIn More