MPI-I-98-2-013

Rigid reachability

Ganzinger, Harald and Jacquemard, Florent and Veanes, Margus

MPI-I-98-2-013. September 1998, 24 pages. | Status: available - back from printing | Next --> Entry | Previous <-- Entry

Abstract in LaTeX format:
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.
Acknowledgement:
References to related material:

To download this research report, please select the type of document that fits best your needs.	Attachement Size(s):
	1329 KBytes
Please note: If you don't have a viewer for PostScript on your platform, try to install GhostScript and GhostView

URL to this document: http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/1998-2-013

BibTeX
@TECHREPORT{GanzingerJacquemardVeanes98, AUTHOR = {Ganzinger, Harald and Jacquemard, Florent and Veanes, Margus}, TITLE = {Rigid reachability}, TYPE = {Research Report}, INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik}, ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany}, NUMBER = {MPI-I-98-2-013}, MONTH = {September}, YEAR = {1998}, ISSN = {0946-011X},}