English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Rigid Reachability: The Non-Symmetric Form of Rigid E-unification

Ganzinger, H., Jacquemard, F., & Veanes, M. (2000). Rigid Reachability: The Non-Symmetric Form of Rigid E-unification. International Journal of Foundations of Computer Science, 11(1), 3-27.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Ganzinger, Harald1, Author           
Jacquemard, Florent1, Author           
Veanes, Margus1, Author           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Content

show
hide
Free keywords: -
 Abstract: We show that rigid reachability, the non-symmetric form of rigid E-unification, is already undecidable in the case of a single constraint. From this we infer the undecidability of a new and 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 PSPACE-complete. Moreover, we identify two decidable non-monadic fragments that are complete for EXPTIME.

Details

show
hide
Language(s): eng - English
 Dates: 2010-03-122000
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 519774
Other: Local-ID: C1256104005ECAFC-ED721AE17360EEF6C12569E0004C19F3-GanzingerJacquemardVeanes-00-ijfcs
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: International Journal of Foundations of Computer Science
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 11 (1) Sequence Number: - Start / End Page: 3 - 27 Identifier: ISSN: 0129-0541