Learning weak constraints in answer set programming
From MaRDI portal
Publication:4592994
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.
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
- scientific article; zbMATH DE number 5914356 (Why is no real title available?)
- scientific article; zbMATH DE number 1877044 (Why is no real title available?)
- A Hybrid Abductive Inductive Proof Procedure
- Agent-mediated electronic commerce III. Current issues in agent-based electronic commerce systems
- Answer set programming as a modeling language for course timetabling
- Brave induction: a logical framework for learning from incomplete information
- ILP turns 20. Biography and future challenges
- Induction on Failure: Learning Connected Horn Theories
- Inductive learning of answer set programs
- Inductive logic programming
- Inductive logic programming as abductive search
- Nonmonotonic abductive inductive learning
- Pairwise preference learning and ranking.
- Top-down induction of first-order logical decision trees
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
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)
