An Alternative Theory of Stable Revision for Nondeterministic Approximation Fixpoint Theory and the Relationships

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.

Authors

Institutions

Publication Details

Journal
Proceedings of the AAAI Conference on Artificial Intelligence
Published
2025-04-11
DOI
https://doi.org/10.1609/aaai.v39i14.33648
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Alternative Theory of Stable Revision for Nondeterministic Approximation Fixpoint Theory and the Relationships

Jesse Heyninck, Jia-Huai You, Spencer Killen
Proceedings of the AAAI Conference on Artificial Intelligence
Advanced Numerical Methods in Computational Mathematics
article

An Alternative Theory of Stable Revision for Nondeterministic Approximation Fixpoint Theory and the Relationships

Jesse Heyninck, Jia-Huai You, Spencer Killen
article en

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.

Proceedings of the AAAI Conference on Artificial IntelligenceVol. 39(14)
University of Alberta (CA), Open University of the Netherlands (NL)
Nederlandse Organisatie voor Wetenschappelijk Onderzoek, Alberta Innovates
Openalex Percentile: Top 84%
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

An Alternative Theory of Stable Revision for Nondeterministic Approximation Fixpoint Theory and the Relationships — Jesse Heyninck, Jia-Huai You, et al. · Proceedings of the AAAI Conference on Artificial Intelligence (2025) | TGRS Research Map | TGRS