Non-deterministic approximation operators: ultimate operators, semi-equilibrium semantics and aggregates (full version)

Jesse Heyninck, Bart Bogaerts
5/18/2023
cs.AIcs.LO

No confident code implementation found for this paper.

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, i.e.\ 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 characterisations of disjunctive logic programs to disjunctive logic programs with aggregates.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{heyninck2023nondeterministic,
  title  = {Non-deterministic approximation operators: ultimate operators, semi-equilibrium semantics and aggregates (full version)},
  author = {Jesse Heyninck and Bart Bogaerts},
  year   = {2023},
  eprint = {2305.10846},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.10846v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.10846.svg)](https://codeofpaper.com/paper/2305.10846)

Discussion