Practical algorithms for deciding path ordering constraint satisfaction.

DOI10.1006/inco.2002.3146zbMath1053.68094OpenAlexW1986710156MaRDI QIDQ1400710

Robert Nieuwenhuis, José Miguel Rivero

Publication date: 2 November 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/8af53acb0d841214c1121c2a40861f36ea28237e

zbMATH Keywords

automated deductionordered strategiessymbolic constraints

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• Saturate

Cites Work

• Simple LPO constraint solving methods
• On the recursive decomposition ordering with lexicographical status and other related orderings
• On recursive path ordering
• Termination of rewriting
• Theorem proving with ordering and equality constrained clauses
• SOLVING SYMBOLIC ORDERING CONSTRAINTS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item