Download:
|
by Christopher Lynch, Polina Strogova
http://dmtcs.loria.fr/volumes/abstracts/ps.gzpapers/dm020101.ps.gz
Add To MetaCart
Abstract:
We introduce a data structure called SOUR graphs and present an efficient Knuth-Bendix completion procedure based on it. SOUR 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.
Citations
|
418
|
Simple word problems in universal algebras
– Knuth, Bendix
- 1970
|
|
263
|
Otter 3.0 Reference Manual and Guide
– McCune
- 1994
|
|
69
|
Basic paramodulation
– Bachmair, Ganzinger, et al.
- 1995
|
|
56
|
Complexity of Finitely Presented Algebras
– Kozen
- 1977
|
|
50
|
Basic superposition is complete
– Nieuwenhuis, Rubio
- 1992
|
|
38
|
Canonical forms in finitely presented algebras
– Chenadec
- 1986
|
|
29
|
A Proof Theory for General Unification
– Snyder
- 1991
|
|
13
|
Paramodulation without duplication
– Lynch
- 1995
|
|
10
|
Proof lengths for equational completion
– Plaisted, Sattler-Klein
- 1996
|
|
10
|
A fast algorithm for generating reduced ground rewriting systems from a set of ground equations
– Snyder
- 1993
|
|
6
|
Finding canonical rewriting systems equivalent to a finite set of ground equations in polynomial time
– Gallier, Narandran, et al.
- 1993
|
|
4
|
Goal directed completion using SOUR graphs
– Lynch
- 1997
|
|
3
|
A fine-grained concurrent completion procedure
– Kirchner, Lynch, et al.
- 1996
|
|
2
|
Leda manual
– Naher
- 1993
|
|
2
|
Patch graphs: an efficient data structure for completion of finitely presented groups
– Lynch, Strogova
- 1996
|
|
1
|
A proof theory for general unification, volume 11 of Progress in computer science and applied logic. Birkhauser
– Snyder
- 1991
|
