Abstract
Approximation fixpoint theory (AFT) is an abstract and general algebraic framework for studying the semantics of non-monotonic logics. In recent work, AFT was generalized to non-deterministic operators, that is, operators whose range are sets of elements rather than single elements. In this paper, we make three further contributions to non-deterministic AFT: (1) we define and study ultimate approximations of non-deterministic operators, (2) we give an algebraic formulation of the semi-equilibrium semantics by Amendola et al., and (3) we generalize the characterizations of disjunctive logic programs to disjunctive logic programs with aggregates.
| Original language | English |
|---|---|
| Pages (from-to) | 632-647 |
| Number of pages | 16 |
| Journal | Theory and Practice of Logic Programming |
| Volume | 23 |
| Issue number | 4 |
| Early online date | 11 Jul 2023 |
| DOIs | |
| Publication status | Published - Jul 2023 |
Keywords
- approximation fixpoint theory
- disjunctive logic programming
- semi-equilibrium semantics