REVIEW 2 cited by
The ILASP system for Inductive Learning of Answer Set Programs
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
The goal of Inductive Logic Programming (ILP) is to learn a program that explains a set of examples in the context of some pre-existing background knowledge. Until recently, most research on ILP targeted learning Prolog programs. Our own ILASP system instead learns Answer Set Programs, including normal rules, choice rules and hard and weak constraints. Learning such expressive programs widens the applicability of ILP considerably; for example, enabling preference learning, learning common-sense knowledge, including defaults and exceptions, and learning non-deterministic theories. In this paper, we first give a general overview of ILASP's learning framework and its capabilities. This is followed by a comprehensive summary of the evolution of the ILASP system, presenting the strengths and weaknesses of each version, with a particular emphasis on scalability.
Forward citations
Cited by 2 Pith papers
-
Knowledge- and Gradient-Guided Reinforcement Learning for Parametrized Action Markov Decision Processes
KGRL prunes invalid parametrized actions via a Datalog knowledge base and refines continuous parameters by gradient descent, reporting better sample efficiency and return than PAMDP RL baselines.
-
Bridging Logic Programming and Deep Learning for Explainability through ILASP
A research plan proposes pairing neural networks with ILP systems so that AI predictions come with human-readable logical rules, with early tests in weather, law, and biology.
Discussion (0). Continue with ORCID to comment.