Dominance constraints in stratified context unification
From MaRDI portal
Publication:845917
DOI10.1016/J.IPL.2006.09.009zbMATH Open1185.68386OpenAlexW2030656394MaRDI QIDQ845917FDOQ845917
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
Cites Work
- Conjunctive queries over trees
- Generalized finite automata theory with an application to a decision problem of second-order logic
- The constraint language for lambda structures
- Logics for Unranked Trees: An Overview
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solvability of context equations with two context variables is decidable
- On rewrite constraints and context unification
- Title not available (Why is that?)
- Stratified Context Unification Is NP-Complete
- Title not available (Why is that?)
- A Decision Algorithm for Stratified Context Unification
- Linear second-order unification
- Completion of rewrite systems with membership constraints
- Automated Deduction – CADE-20
- A new algorithm for normal dominance constraints
Cited In (1)
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)
