Probabilistic Inductive Logic Programming Based on Answer Set Programming

We propose a new formal language for the expressive representation of probabilistic knowledge based on Answer Set Programming (ASP). It allows for the annotation of first-order formulas as well as ASP rules and facts with probabilities and for learning of such weights from data (parameter estimation). Weighted formulas are given a semantics in terms of soft and hard constraints which determine a probability distribution over answer sets. In contrast to related approaches, we approach inference by optionally utilizing so-called streamlining XOR constraints, in order to reduce the number of computed answer sets. Our approach is prototypically implemented. Examples illustrate the introduced concepts and point at issues and topics for future research.

[1]  Luc De Raedt,et al.  Bayesian Logic Programs , 2001, ILP Work-in-progress reports.

[2]  Stephen Muggleton,et al.  Learning Stochastic Logic Programs , 2000, Electron. Trans. Artif. Intell..

[3]  Marius Thomas Lindauer,et al.  Potassco: The Potsdam Answer Set Solving Collection , 2011, AI Commun..

[4]  Luc De Raedt,et al.  Probabilistic inductive logic programming , 2004 .

[5]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[6]  J. Nelson Rushton,et al.  Probabilistic reasoning with answer sets , 2004, Theory and Practice of Logic Programming.

[7]  Joohyung Lee,et al.  System f2lp - Computing Answer Sets of First-Order Formulas , 2009, LPNMR.

[8]  David Poole,et al.  The Independent Choice Logic for Modelling Multiple Agents Under Uncertainty , 1997, Artif. Intell..

[9]  James Cussens,et al.  Parameter Estimation in Stochastic Logic Programs , 2001, Machine Learning.

[10]  Taisuke Sato,et al.  PRISM: A Language for Symbolic-Statistical Modeling , 1997, IJCAI.

[11]  Katsumi Inoue,et al.  Probabilistic Rule Learning in Nonmonotonic Domains , 2011, CLIMA.

[12]  Matthew Richardson,et al.  Markov logic networks , 2006, Machine Learning.

[13]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[14]  Luc De Raedt,et al.  ProbLog: A Probabilistic Prolog and its Application in Link Discovery , 2007, IJCAI.

[15]  J. Borwein,et al.  Two-Point Step Size Gradient Methods , 1988 .

[16]  Pedro M. Domingos,et al.  Efficient Weight Learning for Markov Logic Networks , 2007, PKDD.

[17]  Nils J. Nilsson,et al.  Probabilistic Logic * , 2022 .

[18]  Enrico Pontelli,et al.  Hybrid Probabilistic Logic Programs with Non-monotonic Negation , 2005, ICLP.

[19]  Fahiem Bacchus,et al.  Lp, a logic for representing and reasoning with statistical knowledge , 1990, Comput. Intell..

[20]  Gabriele Kern-Isberner,et al.  On probabilistic inference in relational conditional logics , 2012, Log. J. IGPL.

[21]  V. S. Subrahmanian,et al.  Stable Semantics for Probabilistic Deductive Databases , 1994, Inf. Comput..

[22]  Vladimir Lifschitz,et al.  Answer set programming and plan generation , 2002, Artif. Intell..

[23]  Martin Gebser,et al.  Conflict-driven answer set solving: From theory to practice , 2012, Artif. Intell..

[24]  Raymond J. Mooney,et al.  Discriminative structure and parameter learning for Markov logic networks , 2008, ICML '08.

[25]  Lise Getoor,et al.  Learning Probabilistic Relational Models , 1999, IJCAI.

[26]  Thomas Hofmann,et al.  Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints , 2007 .

[27]  Joseph Y. Halpern.  An Analysis of First-Order Logics of Probability , 1989, IJCAI.

[28]  Henry A. Kautz,et al.  Performing Bayesian Inference by Weighted Model Counting , 2005, AAAI.