Teodor Przymusinski  Home/Search
Context Related
| ucr.edu/pub/teodor/wfstable.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: ucr.edu/~teodor/papers (more) Homepages: T.Przymusinski |
Rate this article:      (best)Comment on this article |
Abstract: We introduce 3-valued stable models which are a natural generalization of standard (2-valued) stable models. We show that every logic program P has at least one 3-valued stable model and that the wellfounded model of any program P [VGRS90] coincides with the smallest 3-valued stable model of P. We conclude that the well-founded semantics of an arbitrary logic program coincides with the 3-valued stable model semantics. The 3-valued stable semantics is closely related to non-monotonic formalisms... (Update)
Cited by: More
Epistemic Foundation of Stable Model Semantics - Loyer, Straccia (2006) (Correct)
Minimum Model Semantics for Logic Programs with.. - Rondogiannis, Wadge (Correct)
Strong Equivalence of Nonmonotonic Theories - an Algebraic.. - Truszczynski (Correct)
Similar documents (at the sentence level):
15.7%: Stable Semantics for Disjunctive Programs - Przymusinski (1991) (Correct)
8.4%: Three-Valued Non-Monotonic Formalisms And Semantics of Logic.. - Przymusinski (1991) (Correct)
8.4%: Semantic Issues in Deductive Databases and Logic Programs - Przymusinska, Przymusinski (1990) (Correct)
Active bibliography (related documents): More All
0.2: Logic Programming and Negation: A Survey - Apt, Bol (1994) (Correct)
0.2: Well-Founded and Stationary Models of Logic Programs - Przymusinski (1994) (Correct)
0.2: Well-Founded Completions of Logic Programs - Przymusinski (1991) (Correct)
Similar documents based on text: More All
0.3: Autoepistemic Logics of Closed Beliefs and Logic Programming - Przymusinski (1995) (Correct)
0.3: Fixpoint 3-Valued Semantics for Autoepistemic Logic - Denecker, Marek, Truszczy'nski (1998) (Correct)
0.3: An Environment for the Exploration of Non Monotonic Logic.. - Castro, Warren (Correct)
Related documents from co-citation: More All
69: The Stable Model Semantics for Logic Programming - Gelfond - 1988
54: The Well-Founded Semantics for General Logic Programs - Van Gelder, Ross et al. - 1991
33: Circumscription -- a form of non-monotonic reasoning (context) - McCarthy - 1980
BibTeX entry: (Update)
T. C. Przymusinski. The well-founded semantics coincides with the three-valued stable semantics. Fundamenta Informaticae, 13(4):445--464, 1990. http://citeseer.ist.psu.edu/przymusinski90wellfounded.html More
@article{ przymusinski90wellfounded,
author = "Teodor C. Przymusinski",
title = "The Well-Founded Semantics Coincides with the Three-Valued Stable Semantics",
journal = "Fundamenta Informaticae",
volume = "13",
number = "4",
pages = "445-463",
year = "1990",
url = "citeseer.ist.psu.edu/przymusinski90wellfounded.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1984
858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
759 Negation as failure (context) - Clark - 1978
435 Towards a theory of declarative knowledge (context) - Apt, Blair et al. - 1988
270 Logic programs with classical negation (context) - Gelfond, Lifschitz - 1989
248 The semantics of predicate logic as a programming language (context) - Van Emden, Kowalski - 1976
186 Negation in logic programming (context) - Kunen - 1987
174 A Kripke-Kleene semantics for logic programs (context) - Fitting - 1985
115 The alternating fixpoint of logic programs with negation (context) - Van Gelder - 1989
98 Extended stable semantics for normal and disjunctive logic p.. (context) - Przymusinski - 1990
88 Every logic program has a natural stratification and an iter.. - Przymusinski - 1989
79 On stratified autoepistemic theories (context) - Gelfond - 1987
54 the declarative semantics of stratified deductive databases .. (context) - Przymusinski - 1988
44 Stable and extension class theory for logic programs and def.. (context) - Baral, Subrahmanian - 1990
37 General logical databases and programs: Default logic semant.. (context) - Bidoit, Froidevaux - 1988
34 Stationary semantics for disjunctive logic programs and dedu.. (context) - Przymusinski - 1990
24 Logic programming as constructivism: A formalization and its.. (context) - Bry - 1989
23 Semantic issues in deductive databases and logic programs (context) - Przymusinska, Przymusinski - 1990
18 Generalized well-founded semantics for logic programs - Baral, Lobo et al. - 1990
11 Non-monotonic formalisms and logic programming - Przymusinski - 1989
11 The XWAM: A machine that integrates Prolog and deductive dat.. (context) - Warren - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ucr.edu/~teodor/papers.html): More
Stationary Default Extensions - Przymusinska, Prymusinski (1992) (Correct)
Autoepistemic Logic of Knowledge and Beliefs - Przymusinski (1998) (Correct)
Soundness and Completeness of Partial Deductions for.. - Przymusinska.. (1992) (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