Verifying orientability of rewrite rules using the Knuth-Bendix order

DOI10.1007/3-540-45127-7_12MaRDI QIDQ2778876zbMATH OpenFDO

Authors Konstantin Korovin, Andrei Voronkov

Publication date 21 March 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2051/20510137

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Orienting rewrite rules with the Knuth-Bendix order.
• KBO orientability
• Automated Deduction – CADE-20
• Satisfying KBO Constraints
• Automating the Knuth Bendix ordering

Cited in

(6)

• Orienting rewrite rules with the Knuth-Bendix order.
• Modular termination proofs for rewriting using dependency pairs
• On the Expressivity of Optimality Theory versus Ordered Rewrite Rules
• Automated Deduction – CADE-20
• Satisfying KBO Constraints
• KBO orientability

This page was built for publication: Verifying orientability of rewrite rules using the Knuth-Bendix order

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778876)