SOLVING SYMBOLIC ORDERING CONSTRAINTS

DOI10.1142/S0129054190000278zbMath0722.03012OpenAlexW2056096615MaRDI QIDQ5753928

Hubert Comon

Publication date: 1990

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054190000278

zbMATH Keywords

constraint solvingsimplification orderingsterm algebrasordered strategiesHerbrand Universelexicographic path ordering extending a total precedence

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Grammars and rewriting systems (68Q42)

Related Items

About the theory of tree embedding, Encompassment properties and automata with constraints, A precedence-based total AC-compatible ordering, Solving simplification ordering constraints, The first-order theory of lexicographic path orderings is undecidable, Unification of infinite sets of terms schematized by primal grammars, Practical algorithms for deciding path ordering constraint satisfaction., Orienting rewrite rules with the Knuth-Bendix order., Stratified resolution, Redundancy criteria for constrained completion, A total AC-compatible ordering based on RPO, Simple LPO constraint solving methods, A new method for undecidability proofs of first order theories