An Alternative Theory of Stable Revision for Nondeterministic Approximation Fixpoint Theory and the Relationships
Spencer Killen, Jia-Huai You, Jesse Heyninck
摘要
Approximation fixpoint theory (AFT) is a robust and popular mathematical framework that characterizes many nonmonotonic semantics, where the construction of stable fixpoints, called stable revision, plays a central role. Nondeterministic AFT is a recent development that redefines AFT for a nondeterministic setting to capture disjunctive semantics. This theory departs from traditional AFT by introducing distinct definitions, thus raising the question of whether deterministic AFT can be adopted directly to define nondeterministic stable revision. This work proposes such an alternate theory and creates a new way to study disjunctive semantics in terms of normal (non-disjunctive) knowledge bases. To demonstrate the viability of our framework, we show how to capture stable and partial stable models for disjunctive logic programs. We then study the relationships between this alternative theory and the state-of-the-art nondeterministic AFT.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
相关 Paper
- An Algebraic Notion of Conditional Independence, and Its Application to Knowledge RepresentationJesse HeyninckAAAI 2025 · 被引用 1 次
- Defeasible Normative Reasoning: A Proof-Theoretic Integration of Logical ArgumentationOfer Arieli, Kees van Berkel, Christian StraßerAAAI 2024 · 被引用 5 次
- Forgetting an ArgumentRingo Baumann, Dov M. Gabbay, Odinaldo RodriguesAAAI 2020 · 被引用 14 次
- A Unified View on Forgetting and Strong Equivalence Notions in Answer Set ProgrammingZeynep G. Saribatur, Stefan WoltranAAAI 2024 · 被引用 2 次
- Resilient Logic Programs: Answer Set Programs Challenged by OntologiesSanja Lukumbuzya, Magdalena Ortiz, Mantas SimkusAAAI 2020 · 被引用 8 次
