Fatal steps of Knuth-Bendix completion

Authors:
Henrik Linnestad
Affiliations:
Department of Informatics, University of Oslo, P.O. Box 1080 Blindern, 0316 Oslo, Norway
Venue:
Nordic Journal of Computing
Year:
1996

Citing 14
Cited 0

Completion of a set of rules modulo a set of equations

SIAM Journal on Computing
On word problems in equational theories

14th International Colloquium on Automata, languages and programming
Critical pair criteria for completion

Journal of Symbolic Computation
Only prime superpositions need be considered in the Knuth-Bendix completion procedure

Journal of Symbolic Computation
Existence, uniqueness, and construction of rewrite systems

SIAM Journal on Computing
Rewrite systems

Handbook of theoretical computer science (vol. B)
Term rewriting systems

Handbook of logic in computer science (vol. 2)
Complete Sets of Reductions for Some Equational Theories

Journal of the ACM (JACM)
Canonical Equational Proofs

Canonical Equational Proofs
Completion of Rewrite Systems with Membership Constraints

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A criterion for detecting unnecessary reductions in the construction of Groebner bases

EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
Redundancy Criteria for Constrained Completion

RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Topics in Termination

RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Confluent and Coherent Equational Term Rewriting Systems: Application to Proofs in Abstract Data Types

CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Extended completion of term rewriting systems may abort or succeed for given input, depending on the strategy used for selecting a derivation step from the set of possible ones. Thus, some derivation steps are fatal in the sense that they destroy the possibility of a successful derivation sequence. In this paper we characterize such steps. The results presented are of relevance to efficiency improvement, especially for implementations applying backtracking.