Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

 
 
DownloadE-Mail
  Decidability and Complexity of Simultaneous Rigid E-unification with One Variable and Related Results

Degtyarev, A., Gurevich, Y., Narendran, P., Veanes, M., & Voronkov, A. (2000). Decidability and Complexity of Simultaneous Rigid E-unification with One Variable and Related Results. Theoretical Computer Science, 243(1/2), 167-184.

Item is

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Degtyarev, Anatoli, Autor
Gurevich, Yuri, Autor
Narendran, Paliath1, Autor           
Veanes, Margus1, Autor           
Voronkov, Andrei1, Autor           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: We show that simultaneous rigid $E$-unification, or SREU for short, is decidable and in fact EXPTIME-complete in the case of one variable. This result implies that the A*EA*-fragment of intuitionistic logic with equality is decidable. Together with a previous result regarding the undecidability of the EE-fragment, we obtain {\em a complete classification of decidability of the prenex fragment of intuitionistic logic with equality, in terms of the quantifier prefix.} It is also proved that SREU with one variable and a constant bound on the number of rigid equations is P-complete. Moreover, we consider a case of SREU where one allows several variables, but each rigid equation either contains one variable, or has a ground left-hand side and an equality between two variables as a right-hand side. We show that SREU is decidable also in this restricted case.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2010-03-122000
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: Expertenbegutachtung
 Identifikatoren: eDoc: 519742
Anderer: Local-ID: C1256104005ECAFC-F9C6459652E4B317C125675B0068D57A-DGNVV99
 Art des Abschluß: -

Veranstaltung

einblenden:

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Theoretical Computer Science
Genre der Quelle: Zeitschrift
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: -
Seiten: - Band / Heft: 243 (1/2) Artikelnummer: - Start- / Endseite: 167 - 184 Identifikator: -