The Well-Founded Semantics for General Logic Programs

The Well-Founded Semantics for General Logic Programs (1991)

Cached

Download Links

[cs.ucsc.edu]
[www.cse.ucsc.edu]
[www.cs.columbia.edu]

Other Repositories/Bibliography

DBLP

by Kenneth A. Ross

Venue:	Journal of the ACM
Citations:	743 - 14 self

BibTeX

@ARTICLE{Ross91thewell-founded,
    author = {Kenneth A. Ross},
    title = {The Well-Founded Semantics for General Logic Programs},
    journal = {Journal of the ACM},
    year = {1991},
    volume = {38},
    pages = {620--650}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

1739	Foundations of logic programming - Lloyd
1263	The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
855	Negation as Failure - Clark - 1978
641	Predicate logic as a programming language - Kowalski - 1974
570	Towards a theory of declarative knowledge - Apt, Blair, et al. - 1988
485	The Complexity of Relational Query Languages - Vardi - 1982
407	Semantical considerations on nonmonotonic logic - Moore - 1985
347	A Kripke-Kleene Semantics of logic Programs - Fitting - 1985
254	Relational queries computable in polynomial time - Immerman - 1986
241	On the declarative semantics of deductive databases and logic programs - Przymusinski - 1998
233	Structure and complexity of relational queries - Chandra, Harel - 1982
219	Negation in logic Programming - Kunen - 1987
205	Unfounded sets and well-founded semantics for general logic programs - Gelder, Ross, et al. - 1991
189	The alternating fixpoint of logic programs with negation - Gelder - 1989
171	Autoepistemic Logic - Marek, Truszczynski - 1991
170	Contributions to the theory of logic programming - Apt, Emden - 1982
161	Making Prolog more expressive - Lloyd, Topor - 1984
154	Elemantary Induction on Abstract Structures - Moschovakis - 1974
134	Default reasoning, nonmonotonic logics, and the frame problem - Hanks, McDermott - 1986
129	Every Logic Program has a natural Stratification and an iterated fixed point Model. Pages 11–21 of: Proc. of the eight acm sigact-sigmod-sigart symposium on principles of database systems - Przymusinski - 1989
127	On indefinite databases and the closed world assumption - Minker - 1987
124	Negation as failure using tight derivations for general logic programs - Gelder - 1988
118	Elements of Intuitionism - Dummett - 1977
103	On stratified autoepistemic theories - Gelfond - 1987
101	On Closed World databases - Reiter - 1978
70	Clause Queries and Generalizations - Horn - 1985
70	Equivalence of logic programs - Maher - 1988
67	Negation in Logic Programming - SHEPHERDSON - 1986
54	On the declarative semantics of logic programs with negation - Lifschitz - 1988
52	A Procedural Semantics for Well-Founded Negation in Logic Programs - Ross - 1992
47	Inferring Negative Information from Disjunctive Databases - Ross, Topor - 1988
46	Przymusinski; Weakly Perfect Model Semantics For Logic Programs - PRZYMUSINSKA - 1988
45	Design overview of the NAIL! system - MORRIS, ULLMAN, et al. - 1986
36	Logic Programming as Constructivism: A Formalization and its Application to Databases. Pages 34–50 of - Bry - 1989
24	Some remarks on the completed database - Kunen - 1990
17	Negation as Failure - Shepherdson - 1985
11	A natural semantics of logic programs with negation. Pages 70–80 of - Dung, Kanchansut - 1989
11	Stable theories in autoepistemic logic - Marek - 1989
10	S.: Fixed-point extensions of first order logic - Gurevich, Shelah - 1986
10	The expressive power of stratified programs - Kolaitis - 1991
3	Completeness of the negation-as-failure rule - Jaffar, Lassez, et al. - 1983
2	Modeling simultaneous events with default reasoning and tight derivations - Gelder - 1990
2	Negation by securable failure in logic programming. (manuscript - Schlipf - 1987
1	Talk at Workshop XP8.3i - Morris - 1987
1	Negation by securable failure in logic programming - Schlipf - 1987