Probabilistic Rule Learning Systems
- 3 May 2021
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 54 (4), 1-16
- https://doi.org/10.1145/3447581
Abstract
This survey provides an overview of rule learning systems that can learn the structure of probabilistic rules for uncertain domains. These systems are very useful in such domains because they can be trained with a small amount of positive and negative examples, use declarative representations of background knowledge, and combine efficient high-level reasoning with the probability theory. The output of these systems are probabilistic rules that are easy to understand by humans, since the conditions for consequences lead to predictions that become transparent and interpretable. This survey focuses on representational approaches and system architectures, and suggests future research directions.Keywords
This publication has 23 references indexed in Scilit:
- Probabilistic (logic) programming conceptsMachine Learning, 2015
- Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisitedMachine Learning, 2015
- A History of Probabilistic Inductive Logic ProgrammingFrontiers in Robotics and AI, 2014
- Structure learning of probabilistic logic programs by searching the clause spaceTheory and Practice of Logic Programming, 2014
- On indefinite databases and the closed world assumptionPublished by Springer Science and Business Media LLC ,2005
- Logic Programs with Annotated DisjunctionsLecture Notes in Computer Science, 2004
- Approximate reasoning by similarity-based SLD resolutionTheoretical Computer Science, 2002
- Inverse entailment and progolNew Generation Computing, 1995
- Inductive Logic Programming: Theory and methodsThe Journal of Logic Programming, 1994
- Inductive logic programmingNew Generation Computing, 1991