Constructing rewrite-based decision procedures for embeddings and termination

Authors:
Georg Struth
Affiliations:
Department of Computer Science, University of Sheffield, Sheffield, UK
Venue:
MPC'06 Proceedings of the 8th international conference on Mathematics of Program Construction
Year:
2006

Citing 10
Cited 0

Termination of rewriting

Journal of Symbolic Computation
Bi-rewrite systems

Journal of Symbolic Computation
Term rewriting and all that

Term rewriting and all that
An Algebra of Resolution

RTA '00 Proceedings of the 11th International Conference on Rewriting Techniques and Applications
Efficient Ground Completion: An O(n log n) Algorithm for Generating Reduced Sets of Ground Rewrite Rules Equivalent to a Set of Ground Equations E

RTA '89 Proceedings of the 3rd International Conference on Rewriting Techniques and Applications
Polynomial Time Termination and Constraint Satisfaction Tests

RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Shostak's Congruence Closure as Completion

RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
A Roadmap to Metacomputation by Supercompilation

Selected Papers from the Internaltional Seminar on Partial Evaluation
Complexity of Finitely Presented Algebras

Complexity of Finitely Presented Algebras
Knuth-Bendix completion as a data structure

RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove tractability of ground relational Knuth-Bendix completion procedures. We apply this result to formally develop three dynamic rule-based declarative and tractable decision procedures for termination analysis: for detection of simple and homeomorphic embeddings of ground terms and for termination of ground term rewrite systems. Our algorithms are of general interest for the automated analysis of dynamic reachability, termination and ordering constraints. Our approach is particularly suited for declarative rule-based programming environments.