(Enter summary)
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. 1 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, ... (Update)
Context of citations to this paper: More
.... semantics [33] Two representative methods were then proposed for topdown evaluation of such a new semantics: Global SLS resolution [18, 22] and SLG resolution [6, 7] Global SLS resolution is a direct extension of SLDNF resolution. It overcomes the semantic anomalies of...
Cited by: More
Bottom-up Evaluation and Query Optimization of Well-Founded - Models David Kemp (1995)
(Correct)
A Comparative Study of Well-founded Semantics for Disjunctive.. - Wang (2001)
(Correct)
A Top-down Procedure for Disjunctive Well-founded Semantics - Wang (2001)
(Correct)
Active bibliography (related documents): More All
0.3: On the Declarative and Procedural Semantics of Logic Programs - Przymusinski (1995)
(Correct)
0.3: Logic Programming and Negation: A Survey - Apt, Bol (1994)
(Correct)
0.3: The Well-Founded Semantics for General Logic Programs - Van Gelder, Ross, Schlipf (1991)
(Correct)
Similar documents based on text: More All
0.5: SLT-Resolution for the Well-Founded Semantics - Shen, Yuan, You
(Correct)
0.3: The Limits of Fixed-Order Computation - Sagonas, Swift, Warren (1996)
(Correct)
0.2: Logic Programming Semantics Made Easy - Els Laenens Dirk (1992)
(Correct)
Related documents from co-citation: More All
41: Foundations of Logic Programming (context) - Lloyd - 1987
40: Every logic program has a natural stratification and an iterated least fixed poi..
- Przymusinski - 1989
38: The Stable Model Semantics for Logic Programming
- Gelfond - 1988
BibTeX entry: (Update)
K.A. Ross. A procedural semantics for well founded negation in logic programs. In ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 22--33, 1989. http://citeseer.ist.psu.edu/ross89procedural.html More
@inproceedings{ ross89procedural,
author = "K. A. Ross",
title = "A procedural semantics for well founded negation in logic programs",
pages = "22--33",
year = "1989",
url = "citeseer.ist.psu.edu/ross89procedural.html" }
Citations (may not include all citations):
1838
Foundations of Logic Programming (context) - Lloyd - 1987 ACM
858
The stable model semantics for logic programming
- Gelfond, Lifschitz - 1988 DBLP
759
Negation as failure (context) - Clark - 1978 ACM DBLP
451
Circumscription -- a form of non-monotonic reasoning (context) - McCarthy - 1980
435
Towards a theory of declarative knowledge (context) - Apt, Blair et al. - 1988 ACM DBLP
248
The semantics of predicate logic as a programming language (context) - Van Emden, Kowalski - 1976 ACM DBLP
204
the declarative semantics of deductive databases and logic p.. (context) - Przymusinski - 1988
186
Negation in logic programming (context) - Kunen - 1987 ACM DBLP
185
On indefinite databases and the closed world assumption (context) - Minker - 1982 ACM DBLP
174
A Kripke-Kleene semantics for logic programs (context) - Fitting - 1985 DBLP
120
Elementary Induction on Abstract Structures (context) - Moschovakis - 1974
118
Unfounded sets and well-founded semantics for general logic .. (context) - Van Gelder, Ross et al. - 1988 ACM DBLP
118
Unfounded sets and well-founded semantics for general logic .. (context) - Van Gelder, Ross et al. ACM DBLP
109
Constructive negation based on the completed database (context) - Chan - 1988 DBLP
90
Horn clause queries and generalizations (context) - Chandra, Harel - 1985
88
Every logic program has a natural stratification and an iter..
- Przymusinski - 1989
78
Acyclic programs (context) - Apt, Bezem - 1990 ACM DBLP
68
Negation in logic programming (context) - Shepherdson - 1988 ACM DBLP
62
the declarative and procedural semantics of logic programs
- Przymusinski - 1989
61
Equivalences of logic programs (context) - Maher - 1988 ACM DBLP
55
A procedural semantics for well-founded negation in logic pr..
- Ross - 1989 ACM
54
Inferring negative information from disjunctive databases (context) - Ross, Topor - 1988 ACM DBLP
38
Weakly perfect model semantics for logic programs (context) - Przymusinska, Przymusinski - 1988 DBLP
29
and completeness properties for logic programs (context) - Cavedon, consistency - 1989
25
Explicit representation of terms defined by counter examples (context) - Lassez, Marriott - 1987 ACM DBLP
22
Completeness of a top down query evaluation procedure for st.. (context) - Kemp, Topor - 1988
22
Completeness of the negation-as-failure rule (context) - Jaffar, Lassez et al. - 1983
21
On constructive negation in logic programming
- Przymusinski - 1989 DBLP
19
Modular acyclicity and tail recursion in logic programs (context) - Ross - 1990 ACM DBLP
19
A query evaluation method for stratified programs under the .. (context) - Seki, Itoh - 1988 DBLP
9
Negation as failure (context) - Shepherdson - 1985 ACM DBLP
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.columbia.edu/~kar/pubsk/pubsk.html): More
Glue-Nail: A Deductive Database System - Phipps, Derr, Ross (1991)
(Correct)
Monotonic Aggregation in Deductive Databases - Ross, Sagiv (1992)
(Correct)
Structural Totality and Constraint Stratification - Ross
(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