Marc Denecker, et al.  Home/Search
Context Related
| uky.edu/cs/manuscr...imateapproxic.ps 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: uky.edu/~mirek/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we study fixpoints of operators on lattices and bilattices in a systematic and principled way. The key concept is that of an approximating operator, a monotone operator on the product bilattice, which gives approximate information on the original operator in an intuitive and well-defined way. With any given approximating operator our theory associates several di#erent types of fixpoints, including the Kripke-Kleene fixpoint, stable fixpoints and the well-founded fixpoint, and... (Update)
Cited by: More
Towards a Unified Theory of Logic Programming Semantics.. - Hitzler, Knorr (2005) (Correct)
Similar documents (at the sentence level):
5.6%: Ultimate Approximations in Nonmonotonic Knowledge.. - Denecker, Marek.. (2002) (Correct)
Active bibliography (related documents): More All
1.5: Ultimate Approximation and Its Application in.. - Denecker, Marek.. (2004) (Correct)
0.4: Uniform Semantic Treatment of Default and Autoepistemic Logics - Denecker, Marek (2000) (Correct)
0.4: Approximations, Stable Operators, Well-Founded.. - Denecker, Marek.. (2000) (Correct)
Similar documents based on text: More All
0.2: Extending Classical Logic with Inductive Definitions - Denecker (2000) (Correct)
0.2: An Inductive Definition Approach to Ramifications - Denecker, Dupre, Van Belleghem (1998) (Correct)
BibTeX entry: (Update)
Denecker, M., Marek, V., Truszczynski, M.: Ultimate approximation and its application in nonmonotonic knowledge representation systems. Information and Computation 192 (2004) 84--121 http://citeseer.ist.psu.edu/denecker04ultimate.html More
@misc{ denecker04ultimate,
author = "M. Denecker and V. Marek and M. Truszczynski",
title = "Ultimate approximation and its application in nonmonotonic knowledge representation
systems",
text = "Denecker, M., Marek, V., Truszczynski, M.: Ultimate approximation and its
application in nonmonotonic knowledge representation systems. Information
and Computation 192 (2004) 84--121",
year = "2004",
url = "citeseer.ist.psu.edu/denecker04ultimate.html" }
Citations (may not include all citations):850 A logic for default reasoning (context) - Reiter - 1980
759 Negation as failure (context) - Clark - 1978
234 The well-founded semantics for general logic programs - Van Gelder, Ross et al. - 1991
186 Negation in logic programming (context) - Kunen - 1987
174 A Kripke-Kleene semantics for logic programs (context) - Fitting - 1985
162 The semantics of predicate logic as a programming language (context) - van Emden, Kowalski - 1976
151 Autoepistemic logic (context) - Marek, Truszczynski - 1991
144 Contributions to the theory of logic programming (context) - Apt, van Emden - 1982
125 The well-founded semantics coincides with the threevalued st.. - Przymusinski - 1990
120 Bilattices and the semantics of logic programming - Fitting - 1991
99 Multivalued logics: a uniform approach to reasoning in artif.. (context) - Ginsberg - 1988
97 An Introduction to Inductive Definitions (context) - Aczel - 1977
94 the relation between default and autoepistemic logic (context) - Konolige - 1988
58 The alternating fixpoint of logic programs with negation (context) - Van Gelder - 1993
55 Possible-world semantics for autoepistemic logic (context) - Moore - 1990
47 Dualities between alternative semantics for logic programmin.. - Baral, Subrahmanian - 1991
46 Fixpoint semantics for logic programming -- a survey - Fitting - 2002
44 The stable semantics for logic programs (context) - Gelfond, Lifschitz - 1988
34 Lattice-theoretic fixpoint theorem and its applications (context) - Tarski - 1955
28 On open defaults - Lifschitz - 1990
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
12 Chain-complete posets and directed sets with applications (context) - Markowsky - 1976
12 Fixpoint 3-valued semantics for autoepistemic logic - Denecker, Marek et al. - 1999
12 well-founded fixpoints and applications in nonmonotonic reas.. (context) - Denecker, Marek et al. - 2000
12 Uniform semantic treatment of default and autoepistemic logi.. - Denecker, Marek et al. - 2003
9 Ultimate approximations in nonmonotonic knowledge representa.. - Denecker, Marek et al. - 2002
5 Unified semantic treatment of default and autoepistemic logi.. (context) - Denecker, Marek et al. - 2000
4 truth-value gaps (context) - van Fraassen - 1966
3 Tableaux for logic programming (context) - Fitting - 1994
3 Well-founded and stable semantics for logic programs with ag.. (context) - Denecker, Pelov et al. - 2001
Documents on the same site (http://www.cs.engr.uky.edu/~mirek/papers.html): More
Skeptical Rational Extensions - Mikitiuk, Truszczynski (1995) (Correct)
Nonmonotonic Reasoning is Sometimes Simpler! - Schwarz, Truszczynski (1993) (Correct)
Extremal Problems in Logic Programming and Stable Model.. - Cholewinski, Truszczynski (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