Safe inductions and their applications in knowledge representation
type: Item
instance of: scholarly article
title: Safe inductions and their applications in knowledge representation
zbMATH Open document ID: 1445.68207
author: Bart Bogaerts
author: Joost Vennekens
author: Marc Denecker
published in: Artificial Intelligence
publication date: 2018-06-26T00:00:00Z
full work available at URL: https://lirias.kuleuven.be/handle/123456789/620830
Mathematics Subject Classification ID: 68T30
Mathematics Subject Classification ID: 03B42
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68Q55
Mathematics Subject Classification ID: 68T27
zbMATH DE Number: 6894617
zbMATH Keywords: approximation fixpoint theory
zbMATH Keywords: lattice operator
zbMATH Keywords: inductive definitions
zbMATH Keywords: induction process
zbMATH Keywords: construction
zbMATH Keywords: well-founded semantics
zbMATH Keywords: groundedness
zbMATH Keywords: logic programming
zbMATH Keywords: autoepistemic logic
zbMATH Keywords: abstract argumentation
MaRDI profile type: Publication
OpenAlex ID: W2794629898
cites work: Hex Semantics via Approximation Fixpoint Theory
cites work: Fixpoint semantics for active integrity constraints
cites work: Grounded fixpoints and their applications in knowledge representation
cites work: On Well-Founded Set-Inductions and Locally Monotone Operators
cites work: Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
cites work: Uniform semantic treatment of default and autoepistemic logics
cites work: Ultimate approximation and its application in nonmonotonic knowledge representation systems
cites work: Q4906886
cites work: Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: Fixpoint semantics for logic programming a survey
cites work: All I know: A study in autoepistemic logic
cites work: Flexible Approximators for Approximating Fixpoint Theory
cites work: Autoepistemic logic
cites work: Q3477931
cites work: Semantical considerations on nonmonotonic logic
cites work: Q3348437
cites work: A logic for default reasoning
cites work: Approximating operators and semantics for abstract dialectical frameworks
cites work: A lattice-theoretical fixpoint theorem and its applications
cites work: The Semantics of Predicate Logic as a Programming Language
cites work: The well-founded semantics for general logic programs
cites work: Splitting an operator
Wikidata QID: Q130110353
DOI: 10.1016/J.ARTINT.2018.03.008
description: scientific article; zbMATH DE number 6894617