Abstract
Abduction is a type of logical inference that can be successfully combined with probabilistic reasoning. However, the role of integrity constraints has not received much attention when performing logical-probabilistic inference. The contribution of our paper is a probabilistic abductive framework based on the distribution semantics for normal logic programs that handles negation as failure and integrity constraints in the form of denials. Integrity constraints are treated as evidence from the perspective of probabilistic inference. An implementation is provided that computes alternative (non-minimal) abductive solutions, using an appropriately modified abductive system, and generates the probability of a query, for given solutions. An example application of the framework is given, where gene network topologies are abduced according to biological expert knowledge, to probabilistically explain observed gene expressions. The example shows the practical utility of the proposed framework.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Christiansen, H.: Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules. In: Schrijvers, T., Frühwirth, T. (eds.) Constraint Handling Rules. LNCS (LNAI), vol. 5388, pp. 85–118. Springer, Heidelberg (2008), http://dx.doi.org/10.1007/978-3-540-92243-8_5
Clark, K.L.: Negation as failure. In: Logic and Data Bases, pp. 293–322 (1977)
Corapi, D., Russo, A., Lupu, E.: Inductive logic programming as abductive search. In: ICLP (Technical Communications), pp. 54–63 (2010)
De Raedt, L., Kimmig, A., Gutmann, B., Kersting, K., Santos Costa, V., Toivonen, H.: Probabilistic inductive querying using ProbLog. Springer (2010), https://lirias.kuleuven.be/handle/123456789/284080
De Raedt, L., Kimmig, A., Toivonen, H.: ProbLog: A probabilistic Prolog and its application in link discovery. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence, IJCAI 2007, pp. 2462–2467 (2007)
Denecker, M.: Knowledge representation and reasoning in incomplete logic programming. Ph.D. thesis, Department of Computer Science, K.U.Leuven, Leuven, Belgium, de Schreye, Danny and Denef, Jan (supervisors) (September 1993), https://lirias.kuleuven.be/handle/123456789/131431
Domingos, P., Kok, S., Poon, H., Richardson, M., Singla, P.: Unifying logical and statistical ai. In: Proceedings of the 21st National Conference on Artificial Intelligence, AAAI 2006, vol. 1, pp. 2–7. AAAI Press (2006), http://dl.acm.org/citation.cfm?id=1597538.1597540
Fierens, D., den Broeck, G.V., Thon, I., Gutmann, B., Raedt, L.D.: Inference in probabilistic logic programs using weighted cnf’s. In: Proceedings of the Twenty-Seventh Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI 2011), pp. 211–220. AUAI Press, Corvallis (2011)
Fitting, M.: A kripke-kleene semantics for logic programs. J. Log. Program. 2(4), 295–312 (1985)
Fung, T.H., Kowalski, R.: The iff proof procedure for abductive logic programming. The Journal of Logic Programming 33(2), 151–165 (1997), http://www.sciencedirect.com/science/article/pii/S0743106697000265
Inoue, K., Sato, T., Ishihata, M., Kameya, Y., Nabeshima, H.: Evaluating abductive hypotheses using an em algorithm on bdds. In: Proceedings of the 21st International Jont Conference on Artifical Intelligence, IJCAI 2009, pp. 810–815. Morgan Kaufmann Publishers Inc., San Francisco (2009), http://dl.acm.org/citation.cfm?id=1661445.1661574
Kakas, A., Michael, A., Mourlas, C.: Aclp: Abductive constraint logic programming. The Journal of Logic Programming 44(1-3), 129–177 (2000), http://www.sciencedirect.com/science/article/pii/S0743106699000758
Kakas, A.C., Kowalski, R.A., Toni, F.: Abductive logic programming. J. Log. Comput. 2(6), 719–770 (1992)
Kakas, A.C., Van Nuffelen, B., Denecker, M.: A-system: Problem solving through abduction. In: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, vol. 1, pp. 591–596. IJCAI, inc. and AAAI, Morgan Kaufmann Publishers, Inc. (2001), http://www.cs.kuleuven.ac.be/cgi-bin-dtai/publ_info.pl?id=34862
Kimmig, A.: A Probabilistic Prolog and its Applications. Ph.D. thesis, K.U. Leuven (2010)
Ma, J.: Distributed Abductive Reasoning: Theory, Implementation and Application. Ph.D. thesis, Imperial College London (2011)
Ma, J.: Abductive reasoning module for sicstus prolog (2012), http://www-dse.doc.ic.ac.uk/cgi-bin/moin.cgi/abduction
Maimari, N., Broda, K., Kakas, A., Krams, R., Russo, A.: Arni: Abductive inference of complex regulatory network structures (poster). In: 21st Annual International Conference on Intelligent Systems for Molecular Biology, 12th European Conference on Computational Biology, ISMB/ECCB 2013 (2013)
Poole, D.: Abducing through negation as failure: stable models within the independent choice logic. J. Log. Program. 44(1-3), 5–35 (2000)
Sato, T.: A statistical learning method for logic programs with distribution semantics. In: Proceedings of the 12th International Conference on Logic Programming, pp. 715–729. MIT Press (1995)
Sato, T., Kameya, Y.: Parameter learning of logic programs for symbolic-statistical modeling. J. Artif. Intell. Res. (JAIR) 15, 391–454 (2001)
Sato, T., Kameya, Y., Zhou, N.F.: Generative modeling with failure in prism. In: IJCAI, pp. 847–852 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Turliuc, CR., Maimari, N., Russo, A., Broda, K. (2013). On Minimality and Integrity Constraints in Probabilistic Abduction. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2013. Lecture Notes in Computer Science, vol 8312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-45221-5_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-45221-5_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-45220-8
Online ISBN: 978-3-642-45221-5
eBook Packages: Computer ScienceComputer Science (R0)