Theory Path Orderings

Authors:
Jürgen Stuber
Affiliations:
-
Venue:
RtA '99 Proceedings of the 10th International Conference on Rewriting Techniques and Applications
Year:
1999

Citing 12
Cited 0

Termination orderings for associative-commutative rewriting systems

Journal of Symbolic Computation
Rewrite systems

Handbook of theoretical computer science (vol. B)
Natural termination

RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
A total AC-compatible ordering based on RPO

RTA-93 Selected papers of the fifth international conference on Rewriting techniques and applications
Normalized rewriting: an alternative to rewriting modulo a set of equations

Journal of Symbolic Computation
Term rewriting and all that

Term rewriting and all that
Superposition theorem proving for abelian groups represented as integer modules

Theoretical Computer Science - Special issue on rewriting techniques and applications
Extending reduction orderings to ACU-compatible reduction orderings

Information Processing Letters
Combining Algebra and Universal Algebra in First-Order Theorem Proving: The Case of Commutative Rings

Selected papers from the 10th Workshop on Specification of Abstract Data Types Joint with the 5th COMPASS Workshop on Recent Trends in Data Type Specification
Extension of the Associative Path Ordering to a Chain of Associative Commutative Symbols

RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
A Total, Ground path Ordering for Proving Termination of AC-Rewrite Systems

RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Combination of Compatible Reduction Orderings that are Total on Ground Terms

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the notion of a theory path ordering (TPO), which simplifies the construction of term orderings for superposition theorem proving in algebraic theories. To achieve refutational completeness of such calculi we need total, E-compatible and E-antisymmetric simplification quasi-orderings. The construction of a TPO takes as its ingredients a status function for interpreted function symbols and a precedence that makes the interpreted function symbols minimal. The properties of the ordering then follow from related properties of the status function. Theory path orderings generalize associative path orderings.