Yann Loyer, Umberto Straccia  Home/Search
Context Related
| faure.isti.cnr.it/~stracci...TPLP06.pdf 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: faure.isti.cnr.it/~stracc...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Stable model semantics has become a very popular approach for the management of negation in logic programming. This approach relies mainly on the closed world assumption to complete the available knowledge and its formulation has its basis in the so-called Gelfond-Lifschitz transformation. (Update)
Cited by: More
Any-World Assumptions in Logic Programming - Loyer, Straccia (2005) (Correct)
Active bibliography (related documents): More All
1.4: Epistemic Foundation of the Well-Founded Semantics over.. - Loyer, Straccia (Correct)
0.9: Default Knowledge in Logic Programs with Uncertainty - Yann Loyer And (2003) (Correct)
0.9: The Approximate Well-founded Semantics for Logic Programs.. - Loyer, Straccia (2003) (Correct)
Similar documents based on text:
6.0: Unknown - (Correct)
BibTeX entry: (Update)
Yann Loyer and Umberto Straccia. An epistemic foundation of stable model semantics. Technical Report ISTI-2003. http://citeseer.ist.psu.edu/loyer06epistemic.html More
@misc{ loyer03epistemic,
author = "Y. Loyer and U. Straccia",
title = "An epistemic foundation of stable model semantics",
text = "Yann Loyer and Umberto Straccia. An epistemic foundation of stable model
semantics. Technical Report ISTI-2003.",
year = "2003",
url = "citeseer.ist.psu.edu/loyer06epistemic.html" }
Citations (may not include all citations):1838 Foundations of Logic Programming (context) - Lloyd - 1987
858 The stable model semantics for logic programming - Gelfond, Lifschitz - 1988
850 A logic for default reasoning (context) - Reiter - 1980
759 Negation as failure (context) - Clark - 1978
374 Classical negation in logic programs and disjunctive databas.. - Gelfond, Lifschitz - 1991
295 On closed world data bases (context) - Reiter - 1978
258 A lattice-theoretical fixpoint theorem and its applications (context) - Tarski - 1955
248 The semantics of predicate logic as a programming language (context) - Emden, Kowalski - 1976
234 The well-founded semantics for general logic programs - van Gelder, Ross et al. - 1991
186 Negation in logic programming (context) - Kunen - 1987
183 A useful four-valued logic (context) - Belnap - 1977
161 A logic of implicit and explicit belief (context) - Levesque - 1984
150 Entailment - the logic of relevance and necessity (context) - Anderson, Belnap - 1975
125 The well-founded semantics coincides with the three-valued s.. - Przymusinski - 1990
120 Bilattices and the semantics of logic programming - Fitting - 1991
106 Paraconsistent logic programming (context) - Blair, Subrahmanian - 1989
99 Multi-valued logics: a uniform approach to reasoning in arti.. (context) - Ginsberg - 1988
98 Extended stable semantics for normal and disjunctive program.. (context) - Przymusinski - 1990
73 Relevance logic and entailment (context) - Dunn - 1986
61 Disjunctive stable models: Unfounded sets (context) - Leone, Rullo et al. - 1997
58 The alternating fixpoint of logic programs with negation (context) - van Gelder - 1989
55 Possible-world semantics for autoepistemic logic (context) - Moore - 1984
46 Fixpoint semantics for logic programming - a survey - Fitting - 2002
42 A Kripke-Kleene-semantics for general logic programs (context) - Fitting - 1985
38 The family of stable models - Fitting - 1993
36 Logic and the complexity of reasoning (context) - Levesque - 1988
36 Reasoning with logical bilattices - Arieli, Avron - 1996
34 Stationary semantics for disjunctive logic programs and dedu.. (context) - Przymusinski - 1990
23 Intuitive semantics for first-degree entailments and coupled.. (context) - Dunn - 1976
22 The value of the four values - Arieli, Avron - 1998
19 Stable models are generated by a stable chain - Herre, Wagner - 1997
18 The well-founded semantics is the principle of inductive def.. - Denecker - 1998
14 Logic programming revisited: logic programs as inductive def.. - Denecker, Bruynooghe et al. - 2001
13 A survey of paraconsistent semantics for logic programs - asio, Pereira - 1998
12 Uniform semantic treatment of default and autoepistemic logi.. - Denecker, Marek et al. - 2003
10 Antitonic logic programs - asio, Pereira - 2001
9 Ultimate approximations in nonmonotonic knowledge representa.. - Denecker, Marek et al. - 2002
8 The structure of interlaced bilattices - Avron - 1996
8 Fixpoint characterizations for many-valued disjunctive logic.. - Lukasiewicz - 2001
6 Stable model semantics for probabilistic deductive databases (context) - Ng, Subrahmanian - 1991
6 The approximate well-founded semantics for logic programs wi.. - Loyer, Straccia - 2003
5 Paraconsistent declarative semantics for extended logic prog.. - Arieli - 2002
4 Paraconsistent logic programs (context) - ara, Dam et al. - 2002
4 Uncertainty and partial non-uniform assumptions in parametri.. - Loyer, Straccia - 2002
4 The well-founded semantics in normal logic programs with unc.. (context) - Loyer, Straccia - 2002
4 Default knowledge in logic programs with uncertainty - Loyer, Straccia - 2003
3 The well-founded semantics of logic programs over bilattices.. (context) - Loyer, Straccia - 2003
2 Approximating operators (context) - Denecker, Marek et al. - 1999
1 Kleene's logic (context) - Fitting - 1992
Documents on the same site (http://faure.isti.cnr.it/~straccia/papers/index.html): More
Fuzzy Description Logics and the Semantic Web - Straccia (2005) (Correct)
A Framework for the Retrieval of Multimedia Objects Based on.. - Straccia (1999) (Correct)
A Relevance Terminological Logic for Information Retrieval - Meghini, Straccia (1996) (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