An Alternative Theory of Stable Revision for Nondeterministic Approximation Fixpoint Theory and the Relationships
Spencer Killen, Jia-Huai You, Jesse Heyninck
Abstract
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, play 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.
BibTeX
@article{Killen_You_Heyninck_2025, title={An Alternative Theory of Stable Revision for Nondeterministic Approximation Fixpoint Theory and the Relationships}, volume={39}, url={https://ojs.aaai.org/index.php/AAAI/article/view/33648}, DOI={10.1609/aaai.v39i14.33648}, abstractNote={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, play 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.}, number={14}, journal={Proceedings of the AAAI Conference on Artificial Intelligence}, author={Killen, Spencer and You, Jia-Huai and Heyninck, Jesse}, year={2025}, month={Apr.}, pages={15033-15040} }