Compressing probabilistic Prolog programs
From MaRDI portal
Publication:1009237
DOI10.1007/s10994-007-5030-xzbMath1470.68097MaRDI QIDQ1009237
K. Revoredo, Hannu T. T. Toivonen, 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
compression; inductive logic programming; theory revision; statistical relational learning; biological applications; probabilistic logic; network mining
68T05: Learning and adaptive systems in artificial intelligence
68N17: Logic programming
92C42: Systems biology, networks
Related Items
Structure learning of probabilistic logic programs by searching the clause space, On the Efficient Execution of ProbLog Programs, Bandit-based Monte-Carlo structure learning of probabilistic logic programs, Exact stochastic constraint optimisation with applications in network analysis
Uses Software
Cites Work