Sciweavers

ASIAN
1998
Springer
83views Algorithms» more  ASIAN 1998»
14 years 3 months ago
Rigid Reachability
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 ...
Harald Ganzinger, Florent Jacquemard, Margus Veane...