See this document in CiteSeerX!

Ultimate Approximations in Nonmonotonic Knowledge Representation Systems (2002)  (Make Corrections)  (9 citations)
Marc Denecker, Victor W. Marek, Miroslaw Truszczynski



  Home/Search   Context   Related

 
View or download:
uky.edu/cs/manuscr...imateapproxkr.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  uky.edu/~mirek/papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We study fixpoints of operators on lattices. (Update)


Cited by:   More
Epistemic Foundation of Stable Model Semantics - Loyer, Straccia (2006)   (Correct)
Any-World Assumptions in Logic Programming - Loyer, Straccia (2005)   (Correct)
Logic Programs With Monotone Cardinality Atoms - Marek, Niemelä, Truszczynski   (Correct)

Similar documents (at the sentence level):
53.2%:   Ultimate Approximations in Nonmonotonic Knowledge.. - Denecker, Marek.. (2002)   (Correct)
11.2%:   Ultimate Approximation and Its Application in Nonmonotonic.. - Denecker, al. (2004)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Uniform Semantic Treatment of Default and Autoepistemic Logics - Denecker, Marek (2000)   (Correct)
0.3:   Approximations, Stable Operators, Well-Founded.. - Denecker, Marek.. (2000)   (Correct)
0.1:   Strong Equivalence of Nonmonotonic Theories - an Algebraic.. - Truszczynski   (Correct)

Similar documents based on text:   More   All
1.1:   Ultimate Well-founded and Stable Semantics for Logic.. - Denecker, Pelov.. (2001)   (Correct)
0.6:   Compositionality Results for Stratified Nonmonotone Operators - Gilis, Denecker (2002)   (Correct)

Related documents from co-citation:   More   All
6:   Fixpoint semantics for logic programming -- a survey - Fitting - 1999
6:   well-founded fixpoints and applications in nonmonotonic reasoning (context) - Denecker, Marek et al. - 2000
5:   The Stable Model Semantics for Logic Programming - Gelfond - 1988

BibTeX entry:   (Update)

M. Denecker, V. Marek, and M. Truszczynsky. Ultimate approximations in nonmonotonic knowledge representation systems. In, KR'02, pages 177--188. Morgan Kaufmann, 2002. http://citeseer.ist.psu.edu/article/denecker02ultimate.html   More

@misc{ denecker02ultimate,
  author = "M. Denecker and V. Marek and M. Truszczynsky",
  title = "Ultimate approximations in nonmonotonic knowledge representation systems",
  text = "M. Denecker, V. Marek, and M. Truszczynsky. Ultimate approximations in
    nonmonotonic knowledge representation systems. In, KR'02, pages 177--188.
    Morgan Kaufmann, 2002.",
  year = "2002",
  url = "citeseer.ist.psu.edu/article/denecker02ultimate.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
144   Contributions to the theory of logic programming (context) - Apt, van Emden - 1982
125   The well-founded semantics coincides with the three-valued s.. - Przymusinski - 1990
99   Multivalued logics: a uniform approach to reasoning in artif.. (context) - Ginsberg - 1988
55   Possible-world semantics for autoepistemic logic (context) - Moore - 1990
46   Fixpoint semantics for logic programming -- a survey - Fitting - 2002
44   The stable semantics for logic programs (context) - Gelfond, Lifschitz - 1988
18   The well-founded semantics is the principle of inductive def.. - Denecker - 1998
12   well-founded fixpoints and applications in nonmonotonic reas.. (context) - Denecker, Marek et al. - 2000
12   Chain-complete posets and directed sets with applications (context) - Markowsky - 1976
5   Unified semantic treatment of default and autoepistemic logi.. (context) - Denecker, Marek et al. - 2000
3   Well-founded and stable semantics for logic programs with ag.. (context) - Denecker, Pelov et al. - 2001



The graph only includes citing articles where the year of publication is known.


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