Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/comparisons-and-computation-of-well-founded-semantics-for-disjunctive-E0o2G8C5mV
References (34)
-
P. Dung (1995)
An Argumentation-Theoretic Foundations for Logic ProgrammingJ. Log. Program., 22
-
Teodor Przymusinski (1995)
Static semantics for normal and disjunctive logic programsAnnals of Mathematics and Artificial Intelligence, 14
-
Thomas Eiter, N. Leone, D. Saccá (2004)
On the partial semantics for disjunctive deductive databasesAnnals of Mathematics and Artificial Intelligence, 19
-
If S |= body(r), then there is a sub-disjunction A of head (r) − X such that A ∈ S -
C. Chesñevar, J. Dix, F. Stolzenburg, Guillermo Simari (2000)
Relating defeasible and normal logic programming through transformation propertiesTheor. Comput. Sci., 290
-
Stefan Brass, J. Dix (1997)
Characterizations of the Disjunctive Stable Semantics by Partial EvaluationJ. Log. Program., 32
-
(2003)
Received January -
N. Leone, P. Rullo, Francesco Scarcello (1997)
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and ComputationInf. Comput., 135
-
D. Saccá, C. Zaniolo (1990)
Stable models and non-determinism in logic programs with negationProceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
-
Chitta Baral, M. Gelfond (1994)
Logic Programming and Knowledge Representation, 1471
-
A. Kakas, R. Kowalski, Francesca Toni (1995)
The role of abduction in logic programming -
There exists x ∈ X such that x ∈ body + (r): It is obvious that x ∈ U -
Acknowledgments The author would like to thank Philippe Besnard, Alexander Bochman, James Delgrande Torsten Schaub and Yan Zhang for helpful comments on this work -
Stefan Brass, J. Dix, I. Niemelä, Teodor Przymusinski (2001)
On the equivalence of the static and disjunctive well-founded semantics and its computationTheor. Comput. Sci., 258
-
M. Gelfond, Vladimir Lifschitz (1988)
The Stable Model Semantics for Logic Programming -
A. Gelder, K. Ross, J. Schlipf (1991)
The well-founded semantics for general logic programsJ. ACM, 38
-
Kewen Wang (2000)
Argumentation-based abduction in disjunctive logic programmingJ. Log. Program., 45
-
Stefan Brass, J. Dix (1998)
Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWAJournal of Automated Reasoning, 20
-
body(r) is false wrt S -
ACM Transactions on Computational Logic -
H. Gaifman (1990)
Semantics of Logic Programs -
K. Apt, R. Bol (1994)
Logic Programming and Negation: A SurveyJ. Log. Program., 19/20
-
Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs · 31 REFERENCES -
François Bry (1990)
Negation in Logic Programming: A Formalization in Constructive Logic -
Kewen Wang (2001)
A Top-Down Procedure for Disjunctive Well-Founded Semantics -
This means that U is also an unfounded set for P wrt S -
J. Minker (1987)
On Indefinite Databases and the Closed World Assumption -
K. Ross (1989)
A procedural semantics for well founded negation in logic programsProceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
-
Jia-Huai You, Li-Yan Yuan, R. Goebel (2000)
An abductive approach to disjunctive logic programmingJ. Log. Program., 44
-
J. Minker, Jorge Lobo, A. Rajasekar (1991)
Circumscription and Disjunctive Logic Programming -
J. Minker (1994)
Overview of disjunctive logic programmingAnnals of Mathematics and Artificial Intelligence, 12
-
Jorge Lobo, J. Minker, A. Rajasekar (1992)
Foundations of disjunctive logic programming -
Zhou Having the above lemma, the conclusion of Theorem 7.1 is obvious. Proof of Theorem 7.1. By Lemma 7 -
Stefan Brass, J. Dix (1999)
Semantics of (disjunctive) Logic Programs Based on Partial EvaluationJ. Log. Program., 40
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2005 by ACM Inc.
- ISSN
- 1529-3785
- DOI
- 10.1145/1055686.1055690
- Publisher site
- See Article on Publisher Site
Abstract
Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, these semantics are different from each other and no consensus is reached about which semantics is the most intended. In this article, we look at disjunctive well-founded reasoning from different angles. We show that there is an intuitive form of the well-founded reasoning in disjunctive logic programming which can be characterized by slightly modifying some existing approaches to defining disjunctive well-founded semantics, including program transformations, argumentation, unfounded sets (and resolution-like procedure). By employing the techniques developed by Brass and Dix in their transformation-based approach, we also provide a bottom-up procedure for this semantics. The significance of our work is not only in clarifying the relationship among different approaches, but also shed some light on what is an intended well-founded semantics for disjunctive logic programs.
Journal
ACM Transactions on Computational Logic (TOCL) – Association for Computing Machinery
Published: Apr 1, 2005