Nicola Leone, Pasquale Rullo, Francesco Scarcello  Home/Search
Context Related
| dbai.tuwien.ac.at/staff/...infcom.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: dbai.tuwien.ac.at/proj/dl...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Disjunctive logic programs have become a powerful tool in knowledge representation and commonsense reasoning. This paper focuses on stable model semantics, currently the most widely acknowledged semantics for disjunctive logic programs. After presenting a new notion of unfounded sets for disjunctive logic programs, we provide two declarative characterizations of stable models in terms of unfounded sets. One shows that the set of stable models coincides with the family of unfounded-free... (Update)
Similar documents based on text: More All
1.5: Assumption Sets for Extended Logic Programs - Eiter, Leone, Pearce (Correct)
0.8: Enhancing Disjunctive Datalog by Constraints - Buccafurri, Leone, Rullo (1999) (Correct)
0.7: Logic Programming Semantics Made Easy - Els Laenens Dirk (1992) (Correct)
BibTeX entry: (Update)
N. Leone, P. Rullo, and F. Scarcello, "Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation," Information and Computation, vol. 135, no. 2, pp. 69-112, June 1997. http://citeseer.ist.psu.edu/leone97disjunctive.html More
@article{ leone97disjunctive,
author = "Nicola Leone and Pasquale Rullo and Francesco Scarcello",
title = "Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation",
journal = "Information and Computation",
volume = "135",
number = "2",
pages = "69-112",
year = "1997",
url = "citeseer.ist.psu.edu/leone97disjunctive.html" }
Citations (may not include all citations):858 The Stable Model Semantics for Logic Programming - Gelfond, Lifschitz - 1988
459 A Computing Procedure for Quantification Theory (context) - Davis, Putnam - 1960
379 Complexity of relational query languages (context) - Vardi - 1982
374 Classical Negation in Logic Programs and Disjunctive Databas.. - Gelfond, Lifschitz - 1991
312 The Well-Founded Semantics for General Logic Programs - Van Gelder, Ross et al. - 1991
295 On Closed-World Data Bases (context) - Reiter - 1978
204 the Declarative Semantics of Deductive Databases and Logic P.. (context) - Przymusinski - 1988
189 Foundations of disjunctive logic programming (context) - Lobo, Minker et al. - 1992
185 On Indefinite Data Bases and the Closed World Assumption (context) - Minker - 1982
180 Logic Programming and Negation: A Survey - Apt, Bol - 1994
156 SATCHMO: A theorem prover implemented in Prolog (context) - Manthey, Bry - 1988
151 Autoepistemic Logic (context) - Marek, Truszczy'nski - 1991
149 Logic Programming and Knowledge Representation Journal of Lo.. - Baral, Gelfond - 1994
120 Stable Semantics for Disjunctive Programs - Przymusinski - 1991
82 Semantics of Logic Programs: Their Intuitions and Formal Pro.. - Dix - 1992
[Article contains additional citations not shown here]
Documents on the same site (http://www.dbai.tuwien.ac.at/proj/dlv/index.html): More
The Diagnosis Frontend of the dlv System - Eiter, Faber, Leone, Pfeifer (1998) (Correct)
Expressive Power and Complexity of Partial Models for.. - Eiter, Leone.. (1998) (Correct)
Pruning Operators for Answer Set Programming Systems - Calimeri, al. (2001) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC