Non-deterministic approximation operators: ultimate operators, semi-equilibrium semantics, and aggregates

DOI10.1017/S1471068423000236MaRDI QIDQ7027206zbMATH OpenFDO

Authors Jesse Heyninck, Bart Bogaerts

Publication date 14 February 2025

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S1471068423000236

zbMATH Keywords

approximation fixpoint theorydisjunctive logic programmingsemi-equilibrium semantics

Mathematics Subject Classification ID

Logic programming (68N17) Logic in artificial intelligence (68T27)

Cites work

• Aggregate semantics for propositional answer set programs
• Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
• Bottom-up computation of perfect models for disjunctive theories
• Equilibrium logic
• Logic Programming
• Logic Programming and Nonmonotonic Reasoning
• Logic programs with monotone abstract constraint atoms
• Logics in Artificial Intelligence
• Non-deterministic approximation operators: ultimate operators, semi-equilibrium semantics, and aggregates
• Semi-equilibrium models for paracoherent answer set programs
• Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach
• The Semantics of Predicate Logic as a Programming Language
• Vicious circle principle, aggregates, and formation of sets in ASP based languages
• Well-founded and stable semantics of logic programs with aggregates

Cited in

(1)

• Non-deterministic approximation operators: ultimate operators, semi-equilibrium semantics, and aggregates

This page was built for publication: Non-deterministic approximation operators: ultimate operators, semi-equilibrium semantics, and aggregates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7027206)