Compressing probabilistic Prolog programs
DOI10.1007/S10994-007-5030-XzbMATH Open1470.68097OpenAlexW2148550253MaRDI QIDQ1009237FDOQ1009237
Hannu T. Toivonen, K. Revoredo, Luc De Raedt, Kristian Kersting, Angelika Kimmig
Publication date: 31 March 2009
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-007-5030-x
Recommendations
compressionstatistical relational learninginductive logic programmingbiological applicationsprobabilistic logictheory revisionnetwork mining
Learning and adaptive systems in artificial intelligence (68T05) Systems biology, networks (92C42) Logic programming (68N17)
Cites Work
- Graph-Based Algorithms for Boolean Function Manipulation
- The Complexity of Enumeration and Reliability Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Probabilistic Horn abduction and Bayesian networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (7)
- Exact stochastic constraint optimisation with applications in network analysis
- Variable Compression in ProbLog
- On the Efficient Execution of ProbLog Programs
- Revising Probabilistic Prolog Programs
- Bandit-based Monte-Carlo structure learning of probabilistic logic programs
- Syntactic partial order compression for probabilistic reachability
- Structure learning of probabilistic logic programs by searching the clause space
Uses Software
This page was built for publication: Compressing probabilistic Prolog programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009237)
