Non-deterministic Approximation Operators: Ultimate Operators, Semi-equilibrium Semantics, and Aggregates

Jesse Heyninck; Bart Bogaerts

doi:10.1017/S1471068423000236

Non-deterministic Approximation Operators: Ultimate Operators, Semi-equilibrium Semantics, and Aggregates

Jesse Heyninck, Bart Bogaerts

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

24 Downloads (Pure)

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
DOIs	https://doi.org/10.1017/S1471068423000236
Publication status	Published - 2023

Bibliographical note

Funding Information:
This work was partially supported by Fonds Wetenschappelijk Onderzoek – Vlaanderen (project G0B2221N) and the Flemish Government (Onderzoeksprogramma Artificiële Intelligentie (AI) Vlaanderen).

Publisher Copyright:
© The Author(s), 2023. Published by Cambridge University Press.

Access to Document

10.1017/S1471068423000236Licence: CC BY

98770509Final published version, 296 KBLicence: CC BY

Cite this

@article{aba3757ba2f74b67a144c06fddd35f1f,

title = "Non-deterministic Approximation Operators: Ultimate Operators, Semi-equilibrium Semantics, and Aggregates",

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.",

author = "Jesse Heyninck and Bart Bogaerts",

note = "Funding Information: This work was partially supported by Fonds Wetenschappelijk Onderzoek – Vlaanderen (project G0B2221N) and the Flemish Government (Onderzoeksprogramma Artifici{\"e}le Intelligentie (AI) Vlaanderen). Publisher Copyright: {\textcopyright} The Author(s), 2023. Published by Cambridge University Press.",

year = "2023",

doi = "10.1017/S1471068423000236",

language = "English",

volume = "23",

pages = "632--647",

journal = "Theory and Practice of Logic Programming",

issn = "1471-0684",

publisher = "Cambridge Univ. Press",

number = "4",

}

TY - JOUR

T1 - Non-deterministic Approximation Operators: Ultimate Operators, Semi-equilibrium Semantics, and Aggregates

AU - Heyninck, Jesse

AU - Bogaerts, Bart

N1 - Funding Information: This work was partially supported by Fonds Wetenschappelijk Onderzoek – Vlaanderen (project G0B2221N) and the Flemish Government (Onderzoeksprogramma Artificiële Intelligentie (AI) Vlaanderen). Publisher Copyright: © The Author(s), 2023. Published by Cambridge University Press.

PY - 2023

Y1 - 2023

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85165110980&partnerID=8YFLogxK

U2 - 10.1017/S1471068423000236

DO - 10.1017/S1471068423000236

M3 - Article

VL - 23

SP - 632

EP - 647

JO - Theory and Practice of Logic Programming

JF - Theory and Practice of Logic Programming

SN - 1471-0684

IS - 4

ER -

Non-deterministic Approximation Operators: Ultimate Operators, Semi-equilibrium Semantics, and Aggregates

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

FWOAL990: Approximation Fixpoint Theory as a General Algebraic Theory of Constructive Knowledge

Cite this

Non-deterministic Approximation Operators: Ultimate Operators, Semi-equilibrium Semantics, and Aggregates

Abstract

Bibliographical note

Access to Document

Other files and links

Fingerprint

Projects

FWOAL990: Approximation Fixpoint Theory as a General Algebraic Theory of Constructive Knowledge

Cite this