Safe inductions and their applications in knowledge representation

DOI10.1016/j.artint.2018.03.008zbMath1445.68207OpenAlexW2794629898WikidataQ130110353 ScholiaQ130110353MaRDI QIDQ1647517

Joost Vennekens, Marc Denecker, Bart Bogaerts

Publication date: 26 June 2018

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

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/620830

zbMATH Keywords

autoepistemic logicwell-founded semanticslogic programminggroundednessabstract argumentationconstructioninductive definitionslattice operatorapproximation fixpoint theoryinduction process

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Knowledge representation (68T30) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (2)

Alternating Fixpoint Operator for Hybrid MKNF Knowledge Bases as an Approximator of AFT ⋮ Fixpoint semantics for active integrity constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating operators and semantics for abstract dialectical frameworks
• Ultimate approximation and its application in nonmonotonic knowledge representation systems
• Grounded fixpoints and their applications in knowledge representation
• Semantical considerations on nonmonotonic logic
• A logic for default reasoning
• Fixpoint semantics for logic programming a survey
• Fixpoint semantics for active integrity constraints
• 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
• A lattice-theoretical fixpoint theorem and its applications
• Flexible Approximators for Approximating Fixpoint Theory
• Hex Semantics via Approximation Fixpoint Theory
• The Semantics of Predicate Logic as a Programming Language
• Autoepistemic logic
• The well-founded semantics for general logic programs
• Splitting an operator
• On Well-Founded Set-Inductions and Locally Monotone Operators
• Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions

This page was built for publication: Safe inductions and their applications in knowledge representation