Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Probabilistic Horn abduction and Bayesian networks
Artificial Intelligence
OLD Resolution with Tabulation
Proceedings of the Third International Conference on Logic Programming
Learning Probabilistic Relational Models
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Adaptive Bayesian Logic Programs
ILP '01 Proceedings of the 11th International Conference on Inductive Logic Programming
Artificial Intelligence: A Modern Approach
Artificial Intelligence: A Modern Approach
Inference and Learning in Hybrid Bayesian Networks
Inference and Learning in Hybrid Bayesian Networks
Machine Learning
Pattern Recognition and Machine Learning (Information Science and Statistics)
Pattern Recognition and Machine Learning (Information Science and Statistics)
Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning)
Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning)
The design and implementation of a declarative sensor network system
Proceedings of the 5th international conference on Embedded networked sensor systems
A methodology for in-network evaluation of integrated logical-statistical models
Proceedings of the 6th ACM conference on Embedded network sensor systems
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
PRISM: a language for symbolic-statistical modeling
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Parameter learning of logic programs for symbolic-statistical modeling
Journal of Artificial Intelligence Research
ProbLog: a probabilistic prolog and its application in link discovery
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Cp-logic: A language of causal probabilistic events and its relation to logic programming
Theory and Practice of Logic Programming
The independent choice logic and beyond
Probabilistic inductive logic programming
Hybrid Probabilistic Relational Models for System Quality Analysis
EDOC '10 Proceedings of the 2010 14th IEEE International Enterprise Distributed Object Computing Conference
Extending probLog with continuous distributions
ILP'10 Proceedings of the 20th international conference on Inductive logic programming
WiGEM: a learning-based approach for indoor localization
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
| Hi-index | 0.00 |
Probabilistic Logic Programming (PLP), exemplified by Sato and Kameya's PRISM, Poole's ICL, Raedt et al.'s ProbLog and Vennekens et al.'s LPAD, is aimed at combining statistical and logical knowledge representation and inference. However, the inference techniques used in these works rely on enumerating sets of explanations for a query answer. Consequently, these languages permit very limited use of random variables with continuous distributions. In this paper, we present a symbolic inference procedure that uses constraints and represents sets of explanations without enumeration. This permits us to reason over PLPs with Gaussian or Gamma-distributed random variables (in addition to discrete-valued random variables) and linear equality constraints over reals. We develop the inference procedure in the context of PRISM; however the procedure's core ideas can be easily applied to other PLP languages as well. An interesting aspect of our inference procedure is that PRISM's query evaluation process becomes a special case in the absence of any continuous random variables in the program. The symbolic inference procedure enables us to reason over complex probabilistic models such as Kalman filters and a large subclass of Hybrid Bayesian networks that were hitherto not possible in PLP frameworks.