Grounded fixpoints and their applications in knowledge representation

DOI10.1016/j.artint.2015.03.006zbMath1343.68233OpenAlexW2047865008MaRDI QIDQ892232

Bart Bogaerts, Joost Vennekens, Marc Denecker

Publication date: 18 November 2015

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2015.03.006

zbMATH Keywords

autoepistemic logicwell-founded semanticslogic programmingstable semanticsgroundednessabstract argumentationabstract dialectical frameworkslattice operatorapproximation fixpoint theory

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Knowledge representation (68T30) Logical aspects of lattices and related structures (03G10) Logic programming (68N17)

Related Items

On Well-Founded Set-Inductions and Locally Monotone Operators ⋮ Safe inductions and their applications in knowledge representation ⋮ Unnamed Item ⋮ Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT ⋮ Fixpoint semantics for active integrity constraints ⋮ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory ⋮ Active integrity constraints for general-purpose knowledge bases ⋮ Fixed point semantics for stream reasoning ⋮ Flexible Approximators for Approximating Fixpoint Theory ⋮ Vicious circle principle, aggregates, and formation of sets in ASP based languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating operators and semantics for abstract dialectical frameworks
• Semantics and complexity of recursive aggregates in answer set programming
• Ultimate approximation and its application in nonmonotonic knowledge representation systems
• Semantical considerations on nonmonotonic logic
• On the relation between default and autoepistemic logic
• A logic for default reasoning
• Non-monotonic logic. I
• Datalog extensions for database queries and updates
• Dualities between alternative semantics for logic programming and nonmonotonic reasoning
• Fixpoint semantics for logic programming a survey
• Uniform semantic treatment of default and autoepistemic logics
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• All I know: A study in autoepistemic logic
• Hex Semantics via Approximation Fixpoint Theory
• Vicious Circle Principle and Logic Programs with Aggregates
• Well-founded and stable semantics of logic programs with aggregates
• Nonmonotonic Logic II
• The Semantics of Predicate Logic as a Programming Language
• The well-founded semantics for general logic programs
• Translating default logic into standard autoepistemic logic
• Splitting an operator
• A logic of nonmonotone inductive definitions
• Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
• Logic programs with monotone abstract constraint atoms
• Logic Programming and Nonmonotonic Reasoning
• Twelve Definitions of a Stable Model
• On notation for ordinal numbers