Learning weak constraints in answer set programming

DOI10.1017/S1471068415000198zbMath1379.68073arXiv1507.06566MaRDI QIDQ4592994

Alessandra Russo, Mark M. Law, Krysia Broda

Publication date: 9 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.06566

zbMATH Keywords

answer set programmingpreference learningnonmonotonic inductive logic programming

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Logic programming (68N17)

Related Items

Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition ⋮ The complexity and generality of learning answer set programs ⋮ Incremental and Iterative Learning of Answer Set Programs from Mutually Distinct Examples ⋮ Iterative Learning of Answer Set Programs from Context Dependent Examples ⋮ Inductive general game playing ⋮ Learning to rank the distinctiveness of behaviour in serial offending ⋮ Making sense of sensory input ⋮ A Logic-Based Framework Leveraging Neural Networks for Studying the Evolution of Neurological Disorders

Uses Software

• Potassco

Cites Work

• Unnamed Item
• Unnamed Item
• ILP turns 20. Biography and future challenges
• Nonmonotonic abductive inductive learning
• Top-down induction of first-order logical decision trees
• Brave induction: a logical framework for learning from incomplete information
• INDUCTIVE LOGIC PROGRAMMING AS ABDUCTIVE SEARCH
• Inductive Learning of Answer Set Programs
• Induction on Failure: Learning Connected Horn Theories
• A Hybrid Abductive Inductive Proof Procedure
• Answer set programming as a modeling language for course timetabling
• Inductive logic programming
• Machine Learning: ECML 2003
• Agent-mediated electronic commerce III. Current issues in agent-based electronic commerce systems