Learning weak constraints in answer set programming
From MaRDI portal
Publication:4592994
DOI10.1017/S1471068415000198zbMATH Open1379.68073arXiv1507.06566MaRDI QIDQ4592994FDOQ4592994
Authors: Mark M. Law, Alessandra Russo, Krysia Broda 
Publication date: 9 November 2017
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Abstract: This paper contributes to the area of inductive logic programming by presenting a new learning framework that allows the learning of weak constraints in Answer Set Programming (ASP). The framework, called Learning from Ordered Answer Sets, generalises our previous work on learning ASP programs without weak constraints, by considering a new notion of examples as ordered pairs of partial answer sets that exemplify which answer sets of a learned hypothesis (together with a given background knowledge) are preferred to others. In this new learning task inductive solutions are searched within a hypothesis space of normal rules, choice rules, and hard and weak constraints. We propose a new algorithm, ILASP2, which is sound and complete with respect to our new learning framework. We investigate its applicability to learning preferences in an interview scheduling problem and also demonstrate that when restricted to the task of learning ASP programs without weak constraints, ILASP2 can be much more efficient than our previously proposed system.
Full work available at URL: https://arxiv.org/abs/1507.06566
Recommendations
- The complexity and generality of learning answer set programs
- Inductive learning of answer set programs
- Iterative learning of answer set programs from context dependent examples
- Learning through hypothesis refinement using answer set programming
- Learning Constraint Satisfaction Problems: An ILP Perspective
Cites Work
- Title not available (Why is that?)
- Inductive logic programming
- Pairwise preference learning and ranking.
- Answer set programming as a modeling language for course timetabling
- Inductive logic programming as abductive search
- Induction on Failure: Learning Connected Horn Theories
- ILP turns 20. Biography and future challenges
- Top-down induction of first-order logical decision trees
- Brave induction: a logical framework for learning from incomplete information
- Title not available (Why is that?)
- Nonmonotonic abductive inductive learning
- A Hybrid Abductive Inductive Proof Procedure
- Inductive learning of answer set programs
- Agent-mediated electronic commerce III. Current issues in agent-based electronic commerce systems
Cited In (12)
- Making sense of sensory input
- Learning to rank the distinctiveness of behaviour in serial offending
- Best-effort inductive logic programming via fine-grained cost-based hypothesis generation. The Inspire system at the inductive logic programming competition
- Inductive learning of answer set programs
- The complexity and generality of learning answer set programs
- Learning General Constraints in CSP
- A logic-based framework leveraging neural networks for studying the evolution of neurological disorders
- Iterative learning of answer set programs from context dependent examples
- Inductive general game playing
- Learning through hypothesis refinement using answer set programming
- Logic-based learning of answer set programs
- Incremental and iterative learning of answer set programs from mutually distinct examples
Uses Software
This page was built for publication: Learning weak constraints in answer set programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592994)
