Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Probabilistic Horn abduction and Bayesian networks
Artificial Intelligence
Simply logical: intelligent reasoning by example
Simply logical: intelligent reasoning by example
Selected papers of international conference on Fifth generation computer systems 92
Inducing deterministic Prolog parsers from treebanks: a machine learning approach
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Probabilistic Datalog: implementing logical information retrieval for advanced applications
Journal of the American Society for Information Science
ACM SIGKDD Explorations Newsletter
Parameter learning of logic programs for symbolic-statistical modeling
Journal of Artificial Intelligence Research
Compiling Bayesian networks using variable elimination
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
ProbLog: a probabilistic prolog and its application in link discovery
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Compiling Bayesian networks by symbolic probability calculation based on zero-suppressed BDDs
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Link discovery in graphs derived from biological databases
DILS'06 Proceedings of the Third international conference on Data Integration in the Life Sciences
Finding reliable subgraphs from large probabilistic graphs
Data Mining and Knowledge Discovery
Probabilistic Explanation Based Learning
ECML '07 Proceedings of the 18th European conference on Machine Learning
Parameter Learning in Probabilistic Databases: A Least Squares Approach
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
On the Efficient Execution of ProbLog Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
On the implementation of the probabilistic logic programming language problog
Theory and Practice of Logic Programming
Fast discovery of reliable k-terminal subgraphs
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
Learning the structure of probabilistic logic programs
ILP'11 Proceedings of the 21st international conference on Inductive Logic Programming
Patterns and logic for reasoning with networks
Bisociative Knowledge Discovery
Review of bisonet abstraction techniques
Bisociative Knowledge Discovery
MCINTYRE: A Monte Carlo System for Probabilistic Logic Programming
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
| Hi-index | 0.00 |
ProbLog is a recently introduced probabilistic extension of Prolog (De Raedt, et al. in Proceedings of the 20th international joint conference on artificial intelligence, pp. 2468---2473, 2007). A ProbLog program defines a distribution over logic programs by specifying for each clause the probability that it belongs to a randomly sampled program, and these probabilities are mutually independent. The semantics of ProbLog is then defined by the success probability of a query in a randomly sampled program. This paper introduces the theory compression task for ProbLog, which consists of selecting that subset of clauses of a given ProbLog program that maximizes the likelihood w.r.t. a set of positive and negative examples. Experiments in the context of discovering links in real biological networks demonstrate the practical applicability of the approach.