An Inductive Logic Programming Approach to Statistical Relational Learning
# of pages256
In his publication, the author Kristian Kersting has made an assault on one of the hardest integration problems at the heart of Artificial Intelligence research. This involves taking three disparate major areas of research and attempting a fusion among them. The three areas are: Logic Programming, Uncertainty Reasoning and Machine Learning. Every one of these is a major sub-area of research with its own associated international research conferences. Having taken on such a Herculean task, Kersting has produced a series of results which are now at the core of a newly emerging area: Probabilistic Inductive Logic Programming. The new area is closely tied to, though strictly subsumes, a new field known as ‘Statistical Relational Learning’ which has in the last few years gained major prominence in the American Artificial Intelligence research community. Within this book, the author makes several major contributions, including the introduction of a series of definitions which circumscribe the new area formed by extending Inductive Logic Programming to the case in which clauses are annotated with probability values. Also, Kersting investigates the approach of Learning from proofs and the issue of upgrading Fisher Kernels to Relational Fisher kernels.