Rigid Reachability - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport Année : 1998

Rigid Reachability

Résumé

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 a new rather restricted kind of second-order unification. We also show that certain decidable subclasses of the problem which are PTIME-complete in the equational case become EXPTIME-complete when symmetry is absent. By applying automata-theoretic methods, simultaneous monadic rigid reachability with ground rules is shown to be in EXPTIME.
Fichier principal
Vignette du fichier
98-R-388.pdf (224.19 Ko) Télécharger le fichier
Loading...

Dates et versions

inria-00098741 , version 1 (26-09-2006)

Identifiants

  • HAL Id : inria-00098741 , version 1

Citer

Harald Ganzinger, Florent Jacquemard, Margus Veanes. Rigid Reachability. [Intern report] 98-R-388 || ganzinger98a, 1998, 24 p. ⟨inria-00098741⟩
72 Consultations
31 Téléchargements

Partager

Gmail Facebook X LinkedIn More