AC-KBO revisited
From MaRDI portal
Publication:4593023
DOI10.1017/S1471068415000083zbMath1379.68277MaRDI QIDQ4593023
Aart Middeldorp, Nao Hirokawa, Akihisa Yamada, Sarah Winkler
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Termination of rewriting systems by polynomial interpretations and its implementation
- Orderings for term-rewriting systems
- KBO orientability
- Things to know when implementing KBO
- Termination orderings for associative-commutative rewriting systems
- On recursive path ordering
- Simple termination of rewrite systems
- A fully syntactic AC-RPO.
- Orienting rewrite rules with the Knuth-Bendix order.
- Trees in algebra and programming. 6 papers presented at the 22nd and last CAAP conference, Lille, France, April 14--18, 1997
- SAT solving for termination proofs with recursive path orders and dependency pairs
- Modular and incremental proofs of AC-termination
- Ordinals and Knuth-Bendix Orders
- An Extension of the Knuth-Bendix Ordering with LPO-Like Properties
- A Dependency Pair Framework for A ∨ C-Termination
- AC-Termination of rewrite systems: A modified Knuth-Bendix ordering
- On the Formalization of Termination Techniques based on Multiset Orderings
- AC-KBO Revisited
- Automated Deduction – CADE-19
This page was built for publication: AC-KBO revisited
