Maximal extensions of simplification orderings

DOI10.1007/3-540-60692-0_51MaRDI QIDQ2956685zbMATH OpenOpenAlexFDO

Authors Deepak Kapur, G. Sivakumar

Publication date 19 January 2017

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

Full work available at URL https://doi.org/10.1007/3-540-60692-0_51

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• scientific article; zbMATH DE number 3905845
• Extensions and comparison of simplification orderings
• On recursive path ordering
• Solving simplification ordering constraints
• scientific article; zbMATH DE number 1696827

Cited in

(13)

• On recursive path ordering
• Linear extensions of semiorders: A maximization problem
• Relaxed weighted path order in theorem proving
• scientific article; zbMATH DE number 1614707 (Why is no real title available?)
• Extending reduction orderings to ACU-compatible reduction orderings
• Maximal compatible extensions of partial orders
• A Computation of the Maximal Order Type of the Term Ordering on Finite Multisets
• scientific article; zbMATH DE number 3921961 (Why is no real title available?)
• scientific article; zbMATH DE number 176755 (Why is no real title available?)
• Extension orderings
• scientific article; zbMATH DE number 1405624 (Why is no real title available?)
• The maximal order of hyper-(b-ary)-expansions
• SOLVING SYMBOLIC ORDERING CONSTRAINTS

This page was built for publication: Maximal extensions of simplification orderings

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