The complexity and generality of learning answer set programs
type: Item
instance of: scholarly article
title: The complexity and generality of learning answer set programs
zbMATH Open document ID: 1445.68206
author: Alessandra Russo
author: Krysia Broda
author: Mark M. Law
published in: Artificial Intelligence
publication date: 2018-06-26T00:00:00Z
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68N17
zbMATH DE Number: 6894615
zbMATH Keywords: non-monotonic logic-based learning
zbMATH Keywords: answer set programming
zbMATH Keywords: complexity of non-monotonic learning
describes a project that uses: DLV
describes a project that uses: ProbLog
describes a project that uses: Aleph
MaRDI profile type: Publication
full work available at URL: j.artint.2018.03.005
OpenAlex ID: W2793662597
cites work: Inductive logic programming
cites work: A Hybrid Abductive Inductive Proof Procedure
cites work: ILP turns 20. Biography and future challenges
cites work: Top-down induction of first-order logical decision trees
cites work: Inductive logic programming as abductive search
cites work: Q4800160
cites work: Answer Set Programming: A Primer
cites work: A logic-based calculus of events
cites work: Incremental learning of event definitions with inductive logic programming
cites work: Learning weak constraints in answer set programming
cites work: Iterative Learning of Answer Set Programs from Context Dependent Examples
cites work: Brave induction: a logical framework for learning from incomplete information
cites work: Q4796703
cites work: Inductive Learning of Answer Set Programs
cites work: Q3221403
cites work: The polynomial-time hierarchy
cites work: Nonmonotonic abductive inductive learning
cites work: Learning Through Hypothesis Refinement Using Answer Set Programming
cites work: Semantics and complexity of recursive aggregates in answer set programming
cites work: Logical settings for concept-learning
cites work: Induction from answer sets in nonmonotonic logic programs
cites work: Learning from interpretation transition
cites work: Algorithmic Learning Theory
cites work: Probabilistic Rule Learning
cites work: Structure learning of probabilistic logic programs by searching the clause space
cites work: On the computational cost of disjunctive logic programming: Propositional case
DOI: 10.1016/J.ARTINT.2018.03.005
description: scientific article; zbMATH DE number 6894615