Semantical considerations on nonmonotonic logic
Artificial Intelligence
Journal of Logic Programming
Possible-world semantics for autoepistemic logic
Readings in nonmonotonic reasoning
All I know: a study in autoepistemic logic
Artificial Intelligence
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
On the decidability and complexity of autoepistemic reasoning
Fundamenta Informaticae - Special issue on modal logics in knowledge representation
Translating default logic into standard autoepistemic logic
Journal of the ACM (JACM)
Nonmonotonic Logic: Context-Dependent Reasoning
Nonmonotonic Logic: Context-Dependent Reasoning
Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
Logic-based artificial intelligence
Uniform semantic treatment of default and autoepistemic logics
Artificial Intelligence
Splitting an operator: Algebraic modularity results for logics with fixpoint semantics
ACM Transactions on Computational Logic (TOCL)
Predicate Introduction for Logics with Fixpoint Semantics. Part II: Autoepistemic Logic
Fundamenta Informaticae
Predicate Introduction for Logics with Fixpoint Semantics. Part II: Autoepistemic Logic
Fundamenta Informaticae
| Hi-index | 0.00 |
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).