Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
From MaRDI portal
Publication:5425400
DOI10.1007/978-3-540-72200-7_9zbMath1149.68420OpenAlexW1533371796MaRDI QIDQ5425400
Marc Denecker, Joost Vennekens
Publication date: 13 November 2007
Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)
Full work available at URL: https://lirias.kuleuven.be/handle/123456789/146753
Related Items
On Well-Founded Set-Inductions and Locally Monotone Operators ⋮ Safe inductions and their applications in knowledge representation ⋮ Debugging for Model Expansion ⋮ FO(ID) as an extension of DL with rules ⋮ Grounded fixpoints and their applications in knowledge representation ⋮ Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT ⋮ SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions ⋮ Knowledge compilation of logic programs using approximation fixpoint theory ⋮ Stable-unstable semantics: Beyond NP with normal logic programs ⋮ On relation between constraint answer set programming and satisfiability modulo theories ⋮ Beyond NP: Quantifying over Answer Sets ⋮ Fixpoint semantics for active integrity constraints ⋮ CP-logic: A language of causal probabilistic events and its relation to logic programming
Uses Software
