Computer Science – Logic in Computer Science
Scientific paper
1999-01-12
Computer Science
Logic in Computer Science
Proceedings of the Fifteenth National Conference on Artificial Intelligence (AAAI-98), pages 840--845, (MIT Press, 1998)
Scientific paper
The paper presents a constructive fixpoint semantics for autoepistemic logic (AEL). This fixpoint characterizes a unique but possibly three-valued belief set of an autoepistemic theory. It may be three-valued in the sense that for a subclass of formulas F, the fixpoint may not specify whether F is believed or not. The paper presents a constructive 3-valued semantics for autoepistemic logic (AEL). We introduce a derivation operator and define the semantics as its least fixpoint. The semantics is 3-valued in the sense that, for some formulas, the least fixpoint does not specify whether they are believed or not. We show that complete fixpoints of the derivation operator correspond to Moore's stable expansions. In the case of modal representations of logic programs our least fixpoint semantics expresses well-founded semantics or 3-valued Fitting-Kunen semantics (depending on the embedding used). We show that, computationally, our semantics is simpler than the semantics proposed by Moore (assuming that the polynomial hierarchy does not collapse).
Denecker Marc
Marek Victor
Truszczynski Miroslaw
No associations
LandOfFree
Fixpoint 3-valued semantics for autoepistemic logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Fixpoint 3-valued semantics for autoepistemic logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fixpoint 3-valued semantics for autoepistemic logic will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-340943