Solving simplification ordering constraints

DOI10.1007/BFb0016865zbMath1495.03011MaRDI QIDQ5096318

Patricia Johann, Rolf Socher-Ambrosius

Publication date: 16 August 2022

Published in: Constraints in Computational Logics (Search for Journal in Brave)

Mathematics Subject Classification ID

Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simple LPO constraint solving methods
• Termination of rewriting
• A new method for undecidability proofs of first order theories
• About the theory of tree embedding
• Polynomial time termination and constraint satisfaction tests
• SOLVING SYMBOLIC ORDERING CONSTRAINTS

This page was built for publication: Solving simplification ordering constraints