Completion of rewrite systems with membership constraints

DOI10.1007/3-540-55719-9_91zbMath1427.68134OpenAlexW1510057365MaRDI QIDQ5204334

Hubert Comon

Publication date: 4 December 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55719-9_91

zbMATH Keywords

equational logictree automatoncritical pairdeduction rule

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Grammars and rewriting systems (68Q42) Higher-order logic (03B16)

Related Items (5)

More problems in rewriting ⋮ Dominance constraints in stratified context unification ⋮ Unification of infinite sets of terms schematized by primal grammars ⋮ On the non-termination of MDG-based abstract state enumeration ⋮ A semantic approach to order-sorted rewriting

Cites Work

• Order-sorted unification
• Termination orderings for associative-commutative rewriting systems
• A unification algorithm for second-order monadic terms
• The undecidability of the second-order unification problem
• Schematization of infinite sets of rewrite rules generated by divergent completion processes
• Completion of rewrite systems with membership constraints. II: Constraint solving
• An algorithm for finding canonical sets of ground rewrite rules in polynomial time
• Higher-order unification, polymorphism, and subsorts
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Completion of rewrite systems with membership constraints