Tractable Markov Logic

Tractable subsets of first-order logic are a central topic in AI research. Several of these formalisms have been used as the basis for firstorder probabilistic languages. However, these are intractable, losing the original motivation. Here we propose the first non-trivially tractable first-order probabilistic language. It is a subset of Markov logic, and uses probabilistic class and part hierarchies to control complexity. We call it TML (Tractable Markov Logic). We show that TML knowledge bases allow for efficient inference even when the corresponding graphical models have very high treewidth. We also show how probabilistic inheritance, default reasoning, and other inference patterns can be carried out in TML. TML opens up the prospect of efficient large-scale first-order probabilistic inference.

[1]  Alon Y. Halevy,et al.  P-CLASSIC: A Tractable Probablistic Description Logic , 1997, AAAI/IAAI.

[2]  Sorin Istrail,et al.  Statistical mechanics, three-dimensionality and NP-completeness: I. Universality of intracatability for the partition function of the Ising model across non-planar surfaces (extended abstract) , 2000, STOC '00.

[3]  Dan Roth,et al.  On the Hardness of Approximate Reasoning , 1993, IJCAI.

[4]  Jon Doyle,et al.  Two Theses of Knowledge Representation: Language Restrictions, Taxonomic Classification, and the Utility of Representation Services , 1991, Artif. Intell..

[5]  Adnan Darwiche,et al.  A differential approach to inference in Bayesian networks , 2000, JACM.

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

[7]  S. Muggleton.  Stochastic Logic Programs , 1996 .

[8]  Pedro M. Domingos,et al.  Markov Logic in Infinite Domains , 2007, UAI.

[9]  Thomas Lukasiewicz,et al.  Tractable Reasoning with Bayesian Description Logics , 2008, SUM.

[10]  Robert P. Goldman,et al.  From knowledge bases to decision models , 1992, The Knowledge Engineering Review.

[11]  Diego Calvanese,et al.  The Description Logic Handbook , 2007 .

[12]  Pedro M. Domingos,et al.  Markov Logic: An Interface Layer for Artificial Intelligence , 2009, Markov Logic: An Interface Layer for Artificial Intelligence.

[13]  Pedro M. Domingos,et al.  Probabilistic theorem proving , 2011, UAI.

[14]  David Poole,et al.  Probabilistic Horn Abduction and Bayesian Networks , 1993, Artif. Intell..

[15]  Raymond Reiter,et al.  On Inheritance Hierarchies With Exceptions , 1983, AAAI.

[16]  Pedro M. Domingos,et al.  Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models , 2011, AAAI.

[17]  Sorin Istrail,et al.  Statistical Mechanics, Three-Dimensionality and NP-Completeness: I. Universality of Intractability of the Partition Functions of the Ising Model Across Non-Planar Lattices , 2000, STOC 2000.

[18]  Pedro M. Domingos,et al.  Sum-product networks: A new deep architecture , 2011, 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops).

[19]  Manfred Jaeger,et al.  Probabilistic Reasoning in Terminological Logics , 1994, KR.

[20]  Heiner Stuckenschmidt,et al.  Log-Linear Description Logics , 2011, IJCAI.

[21]  Rina Dechter,et al.  AND/OR search spaces for graphical models , 2007, Artif. Intell..