×

zbMATH — the first resource for mathematics

Inference and learning in probabilistic logic programs using weighted Boolean formulas. (English) Zbl 1379.68062
Summary: Probabilistic logic programs are logic programs in which some of the facts are annotated with probabilities. This paper investigates how classical inference and learning tasks known from the graphical model community can be tackled for probabilistic logic programs. Several such tasks, such as computing the marginals, given evidence and learning from (partial) interpretations, have not really been addressed for probabilistic logic programs before. The first contribution of this paper is a suite of efficient algorithms for various inference tasks. It is based on the conversion of the program and the queries and evidence to a weighted Boolean formula. This allows us to reduce inference tasks to well-studied tasks, such as weighted model counting, which can be solved using state-of-the-art methods known from the graphical model and knowledge compilation literature. The second contribution is an algorithm for parameter estimation in the learning from interpretations setting. The algorithm employs expectation-maximization, and is built on top of the developed inference algorithms. The proposed approach is experimentally evaluated. The results show that the inference algorithms improve upon the state of the art in probabilistic logic programming, and that it is indeed possible to learn the parameters of a probabilistic logic program from interpretations.

MSC:
68N17 Logic programming
68T05 Learning and adaptive systems in artificial intelligence
68T37 Reasoning under uncertainty in the context of artificial intelligence
Software:
ASSAT; CP-logic; ProbLog
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] Bryant, R. E., Graph-based algorithms for Boolean function manipulation., IEEE Transactions on Computers, 35, 8, 677-691, (1986) · Zbl 0593.94022
[2] Chavira, M.; Darwiche, A.; Jaeger, M., Compiling relational Bayesian networks for exact inference., International Journal of Approximate Reasoning, 42, 1, 4-20, (2006) · Zbl 1096.68747
[3] Darwiche, A., On the tractability of counting theory models and its application to belief revision and truth maintenance., Journal of Applied Non-Classical Logics, 11, 1-2, 11-34, (2001) · Zbl 1033.03505
[4] Darwiche, A., (2004)
[5] Darwiche, A., Modeling and Reasoning with Bayesian Networks, (2009), Cambridge University Press: Cambridge University Press, Cambridge, UK · Zbl 1231.68003
[6] Darwiche, A.; Marquis, P., A knowledge compilation map., Journal of Artificial Intelligence Research, 17, 1, 229-264, (2002) · Zbl 1045.68131
[7] Denecker, M.; Bruynooghe, M.; Marek, V. W., Logic programming revisited: Logic programs as inductive definitions., ACM Transactions on Computational Logic, 2, 4, 623-654, (2001) · Zbl 1365.68148
[8] De Raedt, L., Logical and Relational Learning, (2008), Springer: Springer, New York, NY · Zbl 1203.68145
[9] De Raedt, L.; Frasconi, P.; Kersting, K.; Muggleton, S., Probabilistic Inductive Logic Programming - Theory and Applications, (2008), Springer: Springer, New York, NY · Zbl 1132.68007
[10] De Raedt, L.; Kimmig, A.; Toivonen, H., Proceedings of 20th International Joint Conference on Artificial Intelligence, Problog: A probabilistic prolog and its application in link discovery, 2468-2473, (2007), AAAI Press, Menlo Park, CA
[11] Domingos, P.; Kok, S.; Lowd, D.; Poon, H.; Richardson, M.; Singla, P., Chapter “Markov Logic,” Lecture Notes in Computer Science, Probabilistic Inductive Logic Programming - Theory and Applications, (2008), Springer: Springer, New York, NY
[12] Fierens, D.; Van Den Broeck, G.; Bruynooghe, M.; De Raedt, L., (2012)
[13] Fierens, D.; Van Den Broeck, G.; Thon, I.; Gutmann, B.; De Raedt, L., Proceedings of the 27th Conference on Uncertainty in Artificial Intelligence (UAI), Inference in probabilistic logic programs using weighted CNFs, 211-220, (2011), AUAI Press: AUAI Press, Corvallis, Oregon, USA
[14] Getoor, L.; Taskar, B., Introduction to Statistical Relational Learning (Adaptive Computation and Machine Learning), (2007), MIT Press: MIT Press, Cambridge, MA
[15] Gomes, C. P.; Hoffmann, J.; Sabharwal, A.; Selman, B., (2007)
[16] Grädel, E., Proceedings of the 5th Workshop on Computer Science Logic, On transitive closure logic, 149-163, (1992), Springer: Springer, New York, NY · Zbl 0783.03012
[17] Gutmann, B.; Kimmig, A.; Kersting, K.; Raedt, L., Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases, Parameter learning in probabilistic databases: A least squares approach, 473-488, (2008), Springer-Verlag: Springer-Verlag, Berlin, Germany
[18] Gutmann, B.; Kimmig, A.; Kersting, K.; Raedt, L. D.; Daelemans, W.; Goethals, B.; Morik, K., Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases, Parameter learning in probabilistic databases: A least squares approach., 473-488, (2008), Springer: Springer, Berlin, Germany
[19] Gutmann, B.; Thon, I.; De Raedt, L., (2010)
[20] Gutmann, B.; Thon, I.; De Raedt, L., Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases (ECML/PKDD), Learning the parameters of probabilistic logic programs from interpretations, 581-596, (2011), Springer-Verlag: Springer-Verlag, Berlin, Germany
[21] Ishihata, M.; Kameya, Y.; Sato, T.; Minato, S., (2008)
[22] Janhunen, T., Proceedings of the 16th European Conference on Artificial Intelligence, Representing normal programs with clauses, 358-362, (2004), IOS Press: IOS Press, Amsterdam, Netherlands
[23] Kersting, K.; De Raedt, L.; Kramer, S., Proceedings of the AAAI-2000 workshop on learning statistical models from relational data, Interpreting Bayesian logic programs, 29-35, (2000), AAAI Press
[24] Kimmig, A.; Demoen, B.; De Raedt, L.; Costa, V. S.; Rocha, R., (2010)
[25] Lin, F.; Zhao, Y.; Benferhat, S.; Giunchiglia, E., Artificial Intelligence, Assat: Computing answer sets of a logic program by sat solvers, 112-117, (2002), Elsevier
[26] Lloyd, J., Foundations of Logic Programming, (1987), Springer-Verlag: Springer-Verlag, Berlin, Germany · Zbl 0668.68004
[27] Mantadelis, T.; Janssens, G.; Hermenegildo, M.; Schaub, T., Technical Communications of 26th International Conference on Logic Programming, Dedicated tabling for a probabilistic setting, 124-133, (2010), Dagstuhl Publishing: Dagstuhl Publishing, Saarbrücken/Wadern, Germany · Zbl 1237.68190
[28] Meert, W.; Struyf, J.; Blockeel, H.; De Raedt, L., Proceedings of the 19th International Conference on Inductive Logic Programming, CP-logic theory inference with contextual variable elimination and comparison to BDD based inference methods, 96-109, (2009), Elsevier · Zbl 1286.68421
[29] Muise, C.; Mcilraith, S. A.; Beck, J. C.; Hsu, E.; Kosseim, L.; Inkpen, D., Canadian Conference on Artificial Intelligence, DSHARP: Fast d-DNNF compilation with sharpSAT, (2012), Springer
[30] Park, J. D., Proceedings of the 18th National Conference on Artificial Intelligence, Using weighted MAX-SAT engines to solve MPE, 682-687, (2002), AAAI Press
[31] Poole, D., (2008)
[32] Poon, H.; Domingos, P., Proceedings of the 21st National Conference on Artificial Intelligence, Sound and efficient inference with probabilistic and deterministic dependencies, (2006), AAAI Press
[33] Riguzzi, F.; Swift, T., Well-definedness and efficient inference for probabilistic logic programming under the distribution semantics., Theory and Practice of Logic Programming, 13, 2, 279-302, (2013) · Zbl 1267.68084
[34] Robertson, N.; Seymour, P., Graph minors. II. Algorithmic aspects of tree-width., Journal of Algorithms, 7, 3, 309-322, (1986) · Zbl 0611.05017
[35] Sang, T.; Beame, P.; Kautz, H., Proceedings of the 20th National Conference on Artificial Intelligence, Solving Bayesian networks by weighted model counting, 475-482, (2005), AAAI Press
[36] Sato, T., Proceedings of the 12th International Conference on Logic Programming (ICLP95), A statistical learning method for logic programs with distribution semantics, 715-729, (1995), MIT Press, Cambridge, MA
[37] Sato, T.; Kameya, Y., (2008)
[38] Van Den Broeck, G.; Thon, I.; Van Otterlo, M.; De Raedt, L., Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, DTProbLog: A decision-theoretic probabilistic Prolog, 1217-1222, (2010), AAAI Press
[39] Van Gelder, A.; Ross, K. A.; Schlipf, J. S., The well-founded semantics for general logic programs., Journal of ACM, 38, 3, 620-650, (1991) · Zbl 0799.68045
[40] Vennekens, J.; Denecker, M.; Bruynooghe, M., Cp-logic: A language of causal probabilistic events and its relation to logic programming., Theory and Practice of Logic Programming, 9, 3, 245-308, (2009) · Zbl 1179.68025
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.