A Tractable First-Order Probabilistic Logic
暂无分享,去创建一个
[1] Dan Roth,et al. On the Hardness of Approximate Reasoning , 1993, IJCAI.
[2] Manfred Jaeger,et al. Probabilistic Reasoning in Terminological Logics , 1994, KR.
[3] Robert P. Goldman,et al. From knowledge bases to decision models , 1992, The Knowledge Engineering Review.
[4] Diego Calvanese,et al. The Description Logic Handbook , 2007 .
[5] Jon Doyle,et al. Two Theses of Knowledge Representation: Language Restrictions, Taxonomic Classification, and the Utility of Representation Services , 1991, Artif. Intell..
[6] S. Muggleton. Stochastic Logic Programs , 1996 .
[7] Jeff Z. Pan,et al. An Argument-Based Approach to Using Multiple Ontologies , 2009, SUM.
[8] 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.
[9] Pedro M. Domingos,et al. Probabilistic theorem proving , 2011, UAI.
[10] Pedro M. Domingos,et al. Sum-product networks: A new deep architecture , 2011, 2011 IEEE International Conference on Computer Vision Workshops (ICCV Workshops).
[11] Gregory F. Cooper,et al. The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks , 1990, Artif. Intell..
[12] Nevin Lianwen Zhang,et al. Hierarchical latent class models for cluster analysis , 2002, J. Mach. Learn. Res..
[13] Pedro M. Domingos,et al. Markov Logic in Infinite Domains , 2007, UAI.
[14] Rina Dechter,et al. AND/OR search spaces for graphical models , 2007, Artif. Intell..
[15] De Raedt,et al. Advances in Inductive Logic Programming , 1996 .
[16] David Poole,et al. Probabilistic Horn Abduction and Bayesian Networks , 1993, Artif. Intell..
[17] Pedro M. Domingos,et al. Coarse-to-Fine Inference and Learning for First-Order Probabilistic Models , 2011, AAAI.
[18] Thomas Lukasiewicz,et al. Tractable Reasoning with Bayesian Description Logics , 2008, SUM.
[19] Judea Pearl,et al. Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.
[20] Raymond Reiter,et al. On Inheritance Hierarchies With Exceptions , 1983, AAAI.
[21] 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.
[22] Heiner Stuckenschmidt,et al. Log-Linear Description Logics , 2011, IJCAI.
[23] Adnan Darwiche,et al. A differential approach to inference in Bayesian networks , 2000, JACM.
[24] Zhiyi Chi,et al. Statistical Properties of Probabilistic Context-Free Grammars , 1999, CL.
[25] Michael Luby,et al. Approximating Probabilistic Inference in Bayesian Belief Networks is NP-Hard , 1993, Artif. Intell..
[26] Luc De Raedt,et al. ProbLog: A Probabilistic Prolog and its Application in Link Discovery , 2007, IJCAI.
[27] Alon Y. Halevy,et al. P-CLASSIC: A Tractable Probablistic Description Logic , 1997, AAAI/IAAI.
[28] Dan Suciu,et al. Lifted Inference Seen from the Other Side : The Tractable Features , 2010, NIPS.
[29] Pedro M. Domingos,et al. Markov Logic: An Interface Layer for Artificial Intelligence , 2009, Markov Logic: An Interface Layer for Artificial Intelligence.