Dominance constraints in stratified context unification

DOI10.1016/J.IPL.2006.09.009MaRDI QIDQ845917zbMATH OpenOpenAlexFDO

Authors Katrin Erk, Joachim Niehren

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

treesformal languagesunificationcomputational logics

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites work

• scientific article; zbMATH DE number 1689581 (Why is no real title available?)
• scientific article; zbMATH DE number 1689586 (Why is no real title available?)
• scientific article; zbMATH DE number 1189059 (Why is no real title available?)
• scientific article; zbMATH DE number 3590511 (Why is no real title available?)
• A Decision Algorithm for Stratified Context Unification
• A new algorithm for normal dominance constraints
• Automated Deduction – CADE-20
• Completion of rewrite systems with membership constraints
• Conjunctive queries over trees
• Generalized finite automata theory with an application to a decision problem of second-order logic
• Linear second-order unification
• Logics for Unranked Trees: An Overview
• On rewrite constraints and context unification
• Solvability of context equations with two context variables is decidable
• Stratified Context Unification Is NP-Complete
• The constraint language for lambda structures

Cited in

(1)

• Stratified Context Unification Is NP-Complete

This page was built for publication: Dominance constraints in stratified context unification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845917)