Symmetry breaking for inductive logic programming
The goal of inductive logic programming is to search for a hypothesis that generalises training data and background knowledge. The challenge is searching vast hypothesis spaces, which is exacerbated because many logically equivalent hypotheses exist. To address this challenge, we introduce a method to break symmetries in the hypothesis space. We implement our idea in answer set programming. Our experiments on multiple domains, including visual reasoning and game playing, show that our approach can reduce solving times from over an hour to just 17 seconds.
Code (0)
등록된 구현이 없습니다.
Tasks
Inductive logic programmingVisual ReasoningSimilar Papers 제목 키워드 기반
Lifting Symmetry Breaking Constraints with Inductive Logic Programming
Efficient omission of symmetric solution candidates is essential for combinatorial problem-solving. Most of the existing approaches are instance-specific and focus on the automatic computation of Symmetry Breaking Constr…
Inductive logic programmingEfficient lifting of symmetry breaking constraints for complex combinatorial problems
Many industrial applications require finding solutions to challenging combinatorial problems. Efficient elimination of symmetric solution candidates is one of the key enablers for high-performance solving. However, exist…
Inductive logic programmingA Model-Oriented Approach for Lifting Symmetries in Answer Set Programming
When solving combinatorial problems, pruning symmetric solution candidates from the search space is essential. Most of the existing approaches are instance-specific and focus on the automatic computation of Symmetry Brea…
Inductive logic programmingInduction and Exploitation of Subgoal Automata for Reinforcement Learning
In this paper we present ISA, an approach for learning and exploiting subgoals in episodic reinforcement learning (RL) tasks. ISA interleaves reinforcement learning with the induction of a subgoal automaton, an automaton…
Inductive logic programmingreinforcement-learningReinforcement LearningReinforcement Learning (RL)BreakID: Static Symmetry Breaking for ASP (System Description)
Symmetry breaking has been proven to be an efficient preprocessing technique for satisfiability solving (SAT). In this paper, we port the state-of-the-art SAT symmetry breaker BreakID to answer set programming (ASP). The…