Name
Abstract | ||
|---|---|---|
In the past, compelling arguments in favour of the well-founded semantics for autoepistemic logic have been presented. In this article, we show that for certain classes of theories, this semantics fails to identify the unique intended model. We solve this problem by refining the well-founded semantics. We develop our work in approximation fixpoint theory, an abstract algebraical study of semantics of nonmonotonic logics. As such, our results also apply to logic programming, default logic, Dung’s argumentation frameworks, and abstract dialectical frameworks. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1145/2963096 | ACM Trans. Comput. Log. |
Keywords | Field | DocType |
Approximation fixpoint theory,autoepistemic logic,lattice operator,logic programming,nonmonotonic reasoning,well-founded semantics | Discrete mathematics,Operational semantics,Autoepistemic logic,Non-monotonic logic,Classical logic,Stable model semantics,Game semantics,Mathematics,Well-founded semantics,Higher-order logic | Journal |
Volume | Issue | ISSN |
17 | 4 | 1529-3785 |
Citations | PageRank | References |
0 | 0.34 | 21 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bart Bogaerts | 1 | 83 | 16.49 |
| Joost Vennekens | 2 | 434 | 37.36 |
| Marc Denecker | 3 | 1626 | 106.40 |