2 search results - page 1 / 1 » Stratified Context Unification Is NP-Complete |
103
Voted
IPL
2000
15 years 25 days ago
2000
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability proble...
103
Voted
CADE
2006
Springer
16 years 1 months ago
2006
Springer
Context Unification is the problem to decide for a given set of second-order equations E where all second-order variables are unary, whether there exists a unifier, such that for e...