A precedence-based total AC-compatible ordering
From MaRDI portal
Recommendations
Cites work
- Any ground associative-commutative theory has a finite canonical system
- Associative-commutative reduction orderings
- scientific article; zbMATH DE number 18651 (Why is no real title available?)
- scientific article; zbMATH DE number 176755 (Why is no real title available?)
- scientific article; zbMATH DE number 1348468 (Why is no real title available?)
- SOLVING SYMBOLIC ORDERING CONSTRAINTS
- Termination of rewriting
- Termination of rewriting systems by polynomial interpretations and its implementation
- Termination orderings for associative-commutative rewriting systems
Cited in
(14)- Superposition theorem proving for abelian groups represented as integer modules
- A fully syntactic AC-RPO.
- scientific article; zbMATH DE number 2043535 (Why is no real title available?)
- AC-KBO revisited
- scientific article; zbMATH DE number 1405623 (Why is no real title available?)
- AC unification through order-sorted AC1 unification
- More problems in rewriting
- On narrowing, refutation proofs and constraints
- AC-KBO revisited
- Ordered chaining for total orderings
- Associative-commutative deduction with constraints
- An AC-compatible Knuth-Bendix order.
- Positive deduction modulo regular theories
- A total AC-compatible ordering based on RPO
This page was built for publication: A precedence-based total AC-compatible ordering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5055808)