See this document in CiteSeerX!

Computation of the Semantics of Autoepistemic Belief Theories (1999)  (Make Corrections)  (8 citations)
Stefan Brass, Jürgen Dix, Teodor C. Przymusinski
Artificial Intelligence



  Home/Search   Context   Related

 
View or download:
umd.edu/users/dix/NewNote.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  umd.edu/users/dix/pub_journals (more)
(Enter author homepages)

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

Abstract: Recently, one of the authors introduced a simple and yet powerful non-monotonic knowledge representation framework, called the Autoepistemic Logic of Beliefs, AEB. Theories in AEB are called autoepistemic belief theories. Every belief theory T has been shown to have the least static expansion T which is computed by iterating a natural monotonic belief closure operator \Psi T . This way, the least static expansion T of any belief theory provides its natural non-monotonic semantics which is... (Update)

Context of citations to this paper:   More

.... Theorem 16 (STABLE in terms of CS 1 and comp, BD95] For a program P , STABLE(P ) MOD(comp(norm CS 1 (P ) As shown in [BD95,BDP99], this relation opens the way to compute STABLE by doing hyperresolution on norm CS 1 (P) Theorem 17 (Weak Cautious Monotonicity of...

...G. Super Logic Programs Delta 7 When you replace Not (F ) in these axioms by B( F ) you get the axioms of AELB as stated in [Brass et al. 1999]. That paper also proves the equivalence to the original axioms of [Przymusinski 1994; Przymusinski 1998] Conversely, in order to...

Cited by:   More
Meta-Agent Programs - Dix, Subrahmanian, Pick (2001)   (Correct)
On the Equivalence of the Static and Disjunctive Well-Founded .. - Brass, Dix, al. (1999)   (Correct)
Super Logic Programs - Brass, Przymusinski (2000)   (Correct)

Similar documents (at the sentence level):
5.3%:   Autoepistemic Logic of Knowledge and Beliefs - Przymusinski (1998)   (Correct)

Active bibliography (related documents):   More   All
0.3:   Semantics Of (disjunctive) Logic Programs Based On Partial.. - Brass, Dix (1998)   (Correct)
0.2:   Computation of the Semantics of Autoepistemic Belief.. - Stefan Brass, Jürgen.. (1999)   (Correct)
0.2:   Disjunctive Semantics based upon Partial and Bottom-Up.. - Stefan Brass, Jürgen Dix (1995)   (Correct)

Similar documents based on text:   More   All
0.3:   Characterizations and Implementation of Static Semantics .. - Brass, Dix, Przymusinski (1996)   (Correct)
0.3:   Belief Revision in Non-Monotonic Reasoning - Alferes, Pereira, l. (1995)   (Correct)
0.3:   Semantics of Normal and Disjunctive Logic Programs A Unifying.. - Przymusinski (1995)   (Correct)

Related documents from co-citation:   More   All
5:   Logic Programs with Classical Negation (context) - Gelfond - 1990
5:   The Stable Model Semantics for Logic Programming - Gelfond - 1988
4:   Transformation Based BottomUp Computation of the Well-Founded Model - Brass, Zukowski et al. - 1997

BibTeX entry:   (Update)

Stefan Brass, Jurgen Dix, and Teodor Przymusinski. Computation of the semantics of autoepistemic belief theories. Artificial Intelligence, 112(12) , 1999. http://citeseer.ist.psu.edu/article/brass99computation.html   More

@article{ brass99computation,
    author = "Stefan Brass and Jurgen Dix and Teodor C. Przymusinski",
    title = "Computation of the Semantics of Autoepistemic Belief Theories",
    journal = "Artificial Intelligence",
    volume = "112",
    number = "1-2",
    pages = "233-250",
    year = "1999",
    url = "citeseer.ist.psu.edu/article/brass99computation.html" }
Citations (may not include all citations):
759   Negation as Failure (context) - Clark - 1978
451   Circumscription: A Form of Nonmonotonic Reasoning (context) - McCarthy - 1980
185   On indefinite databases and the closed world assumption (context) - Minker - 1982
96   the Relationship between Circumscription and Negation as Fai.. (context) - Gelfond, Przymusinska et al. - 1989
76   Static semantics for normal and disjunctive logic programs - Przymusinski - 1995
40   A General Approach to Bottom-Up Computation of Disjunctive S.. - Brass, Dix - 1995
30   Super Logic Programs - Brass, Dix et al. - 1996
24   A fixpoint approach to declarative semantics of logic progra.. (context) - Dung, Kanchansut - 1989
14   A natural semantics for logic programs with negation (context) - Dung, Kanchansut - 1989
13   Negation in logic programming: A formalization in constructi.. (context) - cois - 1990
12   Autoepistemic logic of knowledge and beliefs - Przymusinski - 1998
11   Logic programming as constructivism: A formalization and its.. (context) - cois - 1989



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


Documents on the same site (http://www.cs.umd.edu/users/dix/pub_journals.html):
On the Equivalence of the Static and Disjunctive.. - Stefan Brass.. (1999)   (Correct)
Explaining Updates by Minimal Sums - Schlechta, Dix (1999)   (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