MPI-INF Logo
Publications

Server    halma.mpi-inf.mpg.de

Proceedings Article, Paper


@InProceedings
Beitrag in Tagungsband, Workshop
Author, Editor
Author(s):
Stuber, Jürgendblp
Editor(s):
Van Hentenryck, Pascaldblp
BibTeX cite key*:
StuberICLP94
Title, Booktitle
Title*:
Computing Stable Models by Program Transformation
Booktitle*:
Proceedings of the 11th International Conference on Logic Programming (ICLP'94)
Event, URLs
Conference URL::
Downloading URL:
Event Address*:
Santa Margherita Ligure, Italy
Language:
English
Event Date*
(no longer used):
June 13-18, 1994
Organization:
Event Start Date:
2 June 2024
Event End Date:
2 June 2024
Publisher
Name*:
MIT Press
URL:
Address*:
Cambridge, USA
Type:
Vol, No, Year, pp.
Series:
Volume:
Number:
Month:
Pages:
58-73
Year*:
1994
VG Wort Pages:
ISBN/ISSN:
Sequence Number:
DOI:
Note, Abstract, ©
(LaTeX) Abstract:
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."
Download
Access Level:

Correlation
MPG Unit:
Max-Planck-Institut für Informatik
MPG Subunit:
Programming Logics Group
Audience:
experts only
Appearance:
MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, CCL bibliography



BibTeX Entry:
@INPROCEEDINGS{StuberICLP94,
AUTHOR = {Stuber, J{\"u}rgen},
 EDITOR = {Van Hentenryck, Pascal},
 TITLE = {Computing Stable Models by Program Transformation},
 BOOKTITLE = {Proceedings of the 11th International Conference on Logic Programming (ICLP'94)},
 PUBLISHER = {MIT Press},
 YEAR = {1994},
 PAGES = {58--73},
 ADDRESS = {Santa Margherita Ligure, Italy},
}

Entry last modified by Christine Kiesel, 03/12/2010
Hide details for Edit History (please click the blue arrow to see the details)Edit History (please click the blue arrow to see the details)

Editor(s)
Uwe Brahm		Created
01/14/1995 06:52:50 PM
Revisions
9.
8.
7.
6.
5.		Editor(s)
Christine Kiesel
Christine Kiesel/AG2/MPII/DE
Christine Kiesel/AG2/MPII/DE
Christine Kiesel/AG2/MPII/DE
Christine Kiesel/AG2/MPII/DE		Edit Dates
04.09.2001 12:29:17
01/03/95 11:31:11
01/03/95 09:52:37
24/02/95 12:56:34
15/02/95 12:13:14