Dominance constraints in stratified context unification

DOI10.1016/j.ipl.2006.09.009zbMath1185.68386OpenAlexW2030656394MaRDI QIDQ845917

Joachim Niehren, Katrin Erk

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.09.009

zbMATH Keywords

treesunificationformal languagescomputational logics

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solvability of context equations with two context variables is decidable
• On rewrite constraints and context unification
• Conjunctive queries over trees
• Stratified Context Unification Is NP-Complete
• A Decision Algorithm for Stratified Context Unification
• Linear second-order unification
• Completion of rewrite systems with membership constraints
• Logics for Unranked Trees: An Overview
• Automated Deduction – CADE-20
• Generalized finite automata theory with an application to a decision problem of second-order logic
• The constraint language for lambda structures