Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT
Zur Ablage hinzufügen
 Lokale TagsFreigabegeschichteDetailsÜbersicht
  Computing Stable Models by Program Transformation

Stuber, J. (1994). Computing Stable Models by Program Transformation. In P. Van Hentenryck (Ed.), Logic Programming (pp. 58-73). Cambridge, USA: MIT Press.

Item is

 

einblenden: alle

Basisdaten

ausblenden:
Datensatz-Permalink: https://hdl.handle.net/11858/00-001M-0000-0014-AD6D-7 Versions-Permalink: https://hdl.handle.net/21.11116/0000-000E-14E8-6
Genre: Konferenzbeitrag

Externe Referenzen

einblenden:

Urheber

ausblenden:
 Urheber:
Stuber, Jürgen1, Autor           
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045              

Inhalt

ausblenden:
Schlagwörter: -
 Zusammenfassung: In analogy to the Davis-Putnam procedure we develop a new procedure for
computing stable models of propositional normal disjunctive logic programs,
using case analysis and simplification. Our procedure enumerates all stable
models without repetition and without the need for a minimality check. Since it
is not necessary to store the set of stable models explicitly, the procedure
runs in polynomial space. We allow clauses with empty heads, in order to
represent truth or falsity of a proposition as a one-literal clause. In
particular, a clause of form $\mathop\sim A\rightarrow$ expresses that~$A$ is
constrained to be true, without providing a justification for~$A$. Adding this
clause to a program restricts its stable models to those containing~$A$,
without introducing new stable models. Together with $A\rightarrow$ this
provides the basis for case analysis. We present our procedure as a set of
rules which transform a program into a set of solved forms, which resembles the
standard method for presenting unification algorithms. Rules are sound in the
sense that they preserve the set of stable models. A subset of the rules is
shown to be complete in the sense that for each stable model a solved form can
be obtained. The method allows for concise presentation, flexible choice of a
control strategy and simple correctness proofs."

Details

ausblenden:
Sprache(n): eng - English
 Datum: 2010-03-121994
 Publikationsstatus: Erschienen
 Seiten: -
 Ort, Verlag, Ausgabe: -
 Inhaltsverzeichnis: -
 Art der Begutachtung: -
 Identifikatoren: eDoc: 519588
Anderer: Local-ID: C1256104005ECAFC-AD86182F6BDAFE20C125614400623891-StuberICLP94
DOI: 10.7551/mitpress/4316.001.0001
BibTex Citekey: Stuber_ICLP94
 Art des Abschluß: -

Veranstaltung

ausblenden:
Titel: 11th International Conference on Logic Programming
Veranstaltungsort: Santa Margherita Ligure, Italy
Start-/Enddatum: 1994

Entscheidung

einblenden:

Projektinformation

einblenden:

Quelle 1

ausblenden:
Titel: Logic Programming
  Kurztitel : ICLP 1994
  Untertitel : Proceedings of the 11th International Conference on Logic Programming
Genre der Quelle: Konferenzband
 Urheber:
Van Hentenryck, Pascal, Herausgeber
Affiliations:
-
Ort, Verlag, Ausgabe: Cambridge, USA : MIT Press
Seiten: - Band / Heft: - Artikelnummer: - Start- / Endseite: 58 - 73 Identifikator: ISBN: 0-262-72022-1