Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Complexity Analysis Based on Ordered Resolution

Basin, D. A., & Ganzinger, H. (1996). Complexity Analysis Based on Ordered Resolution. In Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS'96) (pp. 456-465). Los Alamitos, USA: IEEE.

Item is

 

einblenden: alle ausblenden: alle

Basisdaten

einblenden: ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ABCB-3 Versions-Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-ABCC-1
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

einblenden:
ausblenden:
 Urheber:
Basin, David A.1, Autor           
Ganzinger, Harald1, Autor           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Inhalt

einblenden:
ausblenden:
Schlagwörter: -
 Zusammenfassung: We define \emph{order locality} to be a property of clauses relative to a term ordering. This property is a kind of generalization of the subformula property for proofs where terms arising in proofs are bounded, under the given ordering, by terms appearing in the goal clause. We show that when a clause set is order local, then the complexity of its ground entailment problem is a function of its structure (e.g., full versus Horn clauses), and the ordering used. We prove that, in many cases, order locality is equivalent to a clause set being saturated under ordered resolution. This provides a means of using standard resolution theorem provers for testing order locality and transforming non-local clause sets into local ones. We have used the Saturate system to automatically establish complexity bounds for a number of nontrivial entailment problems relative to complexity classes which include polynomial and exponential time and co-NP.

Details

einblenden:
ausblenden:
Sprache(n): eng - English
 Datum: 2010-03-121996
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: Los Alamitos, USA : IEEE
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 519598
Anderer: Local-ID: C1256104005ECAFC-B830EE59D3CA5518C12562D80050A20C-BasinGanzinger96a
 Art des Abschluß: -

Veranstaltung

einblenden:
ausblenden:
Titel: Untitled Event
Veranstaltungsort: New Brunswick, New Jersey, USA
Start-/Enddatum: 2003-07-08 - 2003-07-12

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

einblenden:
ausblenden:
Titel: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science (LICS'96)
Genre der Quelle: Konferenzband
 Urheber:
Affiliations:
Ort, Verlag, Ausgabe: Los Alamitos, USA : IEEE
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 456 - 465 Identifikator: ISBN: 0818674636