TY - CONF
T1 - Fixpoint 3-valued semantics for autoepistemic logic
AU - Denecker, Marc
AU - Marek, Victor
AU - Truszczynski, Miroslaw
PY - 1998
Y1 - 1998
N2 - 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).
AB - 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).
UR - https://www.scopus.com/pages/publications/0031636092
UR - https://www.scopus.com/pages/publications/0031636092#tab=citedBy
M3 - Paper
AN - SCOPUS:0031636092
SP - 840
EP - 845
T2 - Proceedings of the 1998 15th National Conference on Artificial Intelligence, AAAI
Y2 - 26 July 1998 through 30 July 1998
ER -