4 search results - page 1 / 1 » Decidable and Undecidable Second-Order Unification Problems |
RTA
1998
Springer
13 years 9 months ago
1998
Springer
There is a close relationship between word unification and second-order unification. This similarity has been exploited for instance for proving decidability of monadic second-orde...
RTA
2000
Springer
13 years 8 months ago
2000
Springer
Linear Second-Order Unification and Context Unification are closely related problems. However, their equivalence was never formally proved. Context unification is a restriction of ...
SIAMCOMP
2008
13 years 4 months ago
2008
Abstract. Monadic second-order unification is second-order unification where all function constants occurring in the equations are unary. Here we prove that the problem of deciding...
ASIAN
1998
Springer
13 years 9 months ago
1998
Springer
We show that rigid reachability, the non-symmetric form of rigid E-unification, is undecidable already in the case of a single constraint. From this we infer the undecidability of ...