A Procedural Semantics for Well Founded Negation in Logic Programs.
Kenneth A. Ross:
A Procedural Semantics for Well Founded Negation in Logic Programs.
PODS 1989: 22-33@inproceedings{DBLP:conf/pods/Ross89,
author = {Kenneth A. Ross},
title = {A Procedural Semantics for Well Founded Negation in Logic Programs},
booktitle = {Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium
on Principles of Database Systems, March 29-31, 1989, Philadelphia,
Pennsylvania},
publisher = {ACM Press},
year = {1989},
isbn = {0-89791-308-6},
pages = {22-33},
ee = {http://doi.acm.org/10.1145/73721.73724, db/conf/pods/Ross89.html},
crossref = {DBLP:conf/pods/89},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
BibTeX
Abstract
We introduce global SLS-resolution, a procedural semantics for well-founded negation as
defined by Van Gelder, Ross and Schlipf.
Global SLS-resolution extends Przymusinski's
SLS-resolution, and may be applied to all programs,
whether locally stratified or not. Global
SLS-resolution is defined in terms of global trees,
a new data structure representing the dependence of goals on derived negative subgoals.
We prove that global SLS-resolution is sound with respect to the well-founded semantics, and complete for non-floundering queries.
Copyright © 1989 by the ACM,
Inc., used by permission. Permission to make
digital or hard copies is granted provided that
copies are not made or distributed for profit or
direct commercial advantage, and that copies show
this notice on the first page or initial screen of
a display along with the full citation.
Load The ACM SIGMOD Anthology, CDROM Edition, Volume 1-3, PODS '82-'98.
and ...
Load The ACM SIGMOD Anthology, Silver Edition, DVD 1, Proceedings.
and ...
BibTeX
Printed Edition
Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, March 29-31, 1989, Philadelphia, Pennsylvania.
ACM Press 1989, ISBN 0-89791-308-6
Contents BibTeX
Journal Version
Kenneth A. Ross:
A Prodedural Semantics for Well-Founded Negation in Logic Programs.
J. Log. Program. 13(1): 1-22(1992) BibTeX
References
- [ABW88]
- ...
- [CH85]
- Ashok K. Chandra, David Harel:
Horn Clauses Queries and Generalizations.
J. Log. Program. 2(1): 1-15(1985) BibTeX
- [Cha88]
- David Chan:
Constructive Negation Based on the Completed Database.
ICLP/SLP 1988: 111-125 BibTeX
- [Cla78]
- ...
- [Fit85]
- Melvin Fitting:
A Kripke-Kleene Semantics for Logic Programs.
J. Log. Program. 2(4): 295-312(1985) BibTeX
- [GL88]
- Michael Gelfond, Vladimir Lifschitz:
The Stable Model Semantics for Logic Programming.
ICLP/SLP 1988: 1070-1080 BibTeX
- [KT88]
- David B. Kemp, Rodney W. Topor:
Completeness of a Top-Down Query Evaluation Procedure for Stratified Databases.
ICLP/SLP 1988: 178-194 BibTeX
- [Kun87]
- Kenneth Kunen:
Negation in Logic Programming.
J. Log. Program. 4(4): 289-308(1987) BibTeX
- [Llo87]
- John W. Lloyd:
Foundations of Logic Programming, 2nd Edition.
Springer 1987, ISBN 3-540-18199-7
BibTeX
- [LM86]
- ...
- [Mah88]
- ...
- [McC80]
- ...
- [Min82]
- Jack Minker:
On Indefinite Databases and the Closed World Assumption.
CADE 1982: 292-308 BibTeX
- [Mos74]
- ...
- [PP88]
- Halina Przymusinska, Teodor C. Przymusinski:
Weakly Perfect Model Semantics for Logic Programs.
ICLP/SLP 1988: 1106-1120 BibTeX
- [Prz87]
- ...
- [Prz88a]
- Teodor C. Przymusinski:
On Constructive Negation in Logic Programming.
NACLP 1989: 0-0 BibTeX
- [Prz88b]
- ...
- [Prz89]
- Teodor C. Przymusinski:
Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model.
PODS 1989: 11-21 BibTeX
- [Ross88]
- ...
- [RT87]
- Kenneth A. Ross, Rodney W. Topor:
Inferring Negative Information from Disjunctive Databases.
J. Autom. Reasoning 4(4): 397-424(1988) BibTeX
- [She85]
- John C. Shepherdson:
Negation as Failure II.
J. Log. Program. 2(3): 185-202(1985) BibTeX
- [She88]
- ...
- [SI88]
- Hirohisa Seki, Hidenori Itoh:
A Query Evaluation Method for Stratified Programs Under the Extended CWA.
ICLP/SLP 1988: 195-211 BibTeX
- [VEK76]
- Maarten H. van Emden, Robert A. Kowalski:
The Semantics of Predicate Logic as a Programming Language.
J. ACM 23(4): 733-742(1976) BibTeX
- [VG86]
- Allen Van Gelder:
Negation as Failure Using Tight Derivations for General Logic Programs.
SLP 1986: 127-138 BibTeX
- [VGRS88a]
- Allen Van Gelder, Kenneth A. Ross, John S. Schlipf:
Unfounded Sets and Well-Founded Semantics for General Logic Programs.
PODS 1988: 221-230 BibTeX
- [VGRS88b]
- Allen Van Gelder, Kenneth A. Ross, John S. Schlipf:
The Well-Founded Semantics for General Logic Programs.
J. ACM 38(3): 620-650(1991) BibTeX
Referenced by
- Serge Abiteboul, Richard Hull, Victor Vianu:
Foundations of Databases.
Addison-Wesley 1995, ISBN 0-201-53771-0
Contents - Liwu Li:
High-Level Petri Net Model of Logic Program with Negation.
IEEE Trans. Knowl. Data Eng. 6(3): 382-395(1994)
- Weidong Chen, David Scott Warren:
Query Evaluation under the Well Founded Semantics.
PODS 1993: 168-179
- John S. Schlipf:
The Expressive Powers of the Logic Programming Semantics.
PODS 1990: 196-204
- Domenico Saccà, Carlo Zaniolo:
Stable Models and Non-Determinism in Logic Programs with Negation.
PODS 1990: 205-217
- Kenneth A. Ross:
Modular Stratification and Magic Sets for DATALOG Programs with Negation.
PODS 1990: 161-171
- Charles Elkan:
Independence of Logic Database Queries and Updates.
PODS 1990: 154-160
- Nicole Bidoit, P. Legay:
WELL!: An Evaluation Procedure for All Logic Programs.
ICDT 1990: 335-348
- Stefano Ceri, Georg Gottlob, Letizia Tanca:
What you Always Wanted to Know About Datalog (And Never Dared to Ask).
IEEE Trans. Knowl. Data Eng. 1(1): 146-166(1989)
- Teodor C. Przymusinski:
Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model.
PODS 1989: 11-21
- Allen Van Gelder:
The Alternating Fixpoint of Logic Programs with Negation.
PODS 1989: 1-10
BibTeX
ACM SIGMOD Anthology - DBLP:
[Home | Search: Author, Title | Conferences | Journals]
ACM SIGMOD Anthology: Copyright © by ACM (info@acm.org), Corrections: anthology@acm.org
DBLP: Copyright © by Michael Ley (ley@uni-trier.de), last change: Sat May 16 23:33:56 2009