Solved forms for path ordering constraints

DOI10.1007/3-540-48685-2_1MaRDI QIDQ4938596zbMATH OpenFDO

Authors Robert Nieuwenhuis, José Miguel Rivero

Publication date 23 February 2000

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

Full work available at URL https://doi.org/10.1007/3-540-48685-2_1

zbMATH Keywords

symbolic constraint solving

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Practical algorithms for deciding path ordering constraint satisfaction.
• Solving simplification ordering constraints
• SOLVING SYMBOLIC ORDERING CONSTRAINTS
• Ordered Solutions for Dynamic Programs
• Formal-Language-Constrained Path Problems
• Formal language constrained path problems
• scientific article; zbMATH DE number 2084756
• scientific article; zbMATH DE number 1962829
• Optimal ordered problem solver

Cited in

(7)

• Practical algorithms for deciding path ordering constraint satisfaction.
• Stratified resolution
• Constraint solving for term orderings compatible with abelian semigroups, monoids and groups
• Solving simplification ordering constraints
• SOLVING SYMBOLIC ORDERING CONSTRAINTS
• KBO Constraint Solving Revisited
• Superposition-based equality handling for analytic tableaux

This page was built for publication: Solved forms for path ordering constraints

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