Embedding justification theory in approximation fixpoint theory

DOI10.1016/J.ARTINT.2024.104112MaRDI QIDQ6566637zbMATH OpenFDO

Authors Simon Marynissen, Bart Bogaerts, Marc Denecker

Publication date 3 July 2024

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2024.104112

zbMATH Keywords

approximation fixpoint theoryjustification theoryknowledge representation

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Recommendations

• Flexible approximators for approximating fixpoint theory
• Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
• A formal theory of justifications
• scientific article; zbMATH DE number 7299857
• Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming

Cites work

• \(FO(FD)\): extending classical logic with rule-based fixpoint definitions
• A formal theory of justifications
• A lattice-theoretical fixpoint theorem and its applications
• A logic for default reasoning
• Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
• Approximating operators and semantics for abstract dialectical frameworks
• Approximation fixpoint theory and the well-founded semantics of higher-order logic programs
• Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
• Causal graph justifications of logic programs
• Exploiting Game Theory for Analysing Justifications
• Fixed point semantics for stream reasoning
• Fixpoint semantics for active integrity constraints
• Fixpoint semantics for logic programming a survey
• Grounded fixpoints and their applications in knowledge representation
• scientific article; zbMATH DE number 25193 (Why is no real title available?)
• Improving parity game solvers with justifications
• Justifications for logic programming
• Knowledge compilation of logic programs using approximation fixpoint theory
• Modularity aspects of disjunctive stable models
• Negation as failure in the head
• On Nested Justification Systems
• On notation for ordinal numbers.
• On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
• Predicate introduction for logics with a fixpoint semantics. I: Logic programming
• Safe inductions and their applications in knowledge representation
• Semantical considerations on nonmonotonic logic
• Semantics and complexity of recursive aggregates in answer set programming
• Splitting an operator: algebraic modularity results for logics with fixpoint semantics
• The Semantics of Predicate Logic as a Programming Language
• Tree-like justification systems are consistent
• Ultimate approximation and its application in nonmonotonic knowledge representation systems
• Uniform semantic treatment of default and autoepistemic logics
• Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions

Cited in

(1)

• On Nested Justification Systems

This page was built for publication: Embedding justification theory in approximation fixpoint theory

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