Abstract
A class of Probabilistic Abductive Logic Programs (PALPs) is introduced and an implementation is developed in CHR for solving abductive problems, providing minimal explanations with their probabilities. Both all-explanations and most-probable-explanations versions are given.
Compared with other probabilistic versions of abductive logic programming, the approach is characterized by higher generality and a flexible and adaptable architecture which incorporates integrity constraints and interaction with external constraint solvers.
A PALP is transformed in a systematic way into a CHR program which serves as a query interpreter, and the resulting CHR code describes in a highly concise way, the strategies applied in the search for explanations.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abdennadher, S., Christiansen, H.: An experimental CLP platform for integrity constraints and abduction. In: Proceedings of FQAS 2000, Flexible Query Answering Systems: Advances in Soft Computing series, pp. 141–152. Physica-Verlag, Springer (2000)
Abdennadher, S., Schütz, H.: CHR\(^{\lor}\): A flexible query language. In: Andreasen, T., Christiansen, H., Larsen, H.L. (eds.) FQAS 1998. LNCS, vol. 1495, pp. 1–14. Springer, Heidelberg (1998)
Alberti, M., Chesani, F., Gavanelli, M., Lamma, E.: The CHR-based implementation of a system for generation and confirmation of hypotheses. In: Wolf, A., Frühwirth, T.W., Meister, M. (eds.) W(C)LP. Ulmer Informatik-Berichte, vol. 2005-01, pp. 111–122. Universität Ulm, Germany (2005)
Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Verifiable agent interaction in abductive logic programming: the SCIFF framework. ACM Transactions on Computational Logic 9(4) (to appear, 2008)
Alferes, J.J., Pereira, L.M., Swift, T.: Abduction in well-founded semantics and generalized stable models via tabled dual programs. Theory and Practice of Logic Programming 4(4), 383–428 (2004)
Baral, C., Gelfond, M., Rushton, J.N.: Probabilistic reasoning with answer sets. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS, vol. 2923, pp. 21–33. Springer, Heidelberg (2003)
Blache, P.: Property grammars: A fully constraint-based theory. In: Christiansen, H., Skadhauge, P.R., Villadsen, J. (eds.) CSLP 2005. LNCS, vol. 3438, pp. 1–16. Springer, Heidelberg (2005)
Blache, P., Balfourier, J.-M.: Property grammars: a flexible constraint-based approach to parsing. In: IWPT. Tsinghua University Press (2001)
Holzbaur, C.: OFAI clp(q,r) Manual, Edition 1.3.3. Technical Report TR-95-09, Austrian Research Institute for Artificial Intelligence, Vienna (1995)
Christiansen, H.: Automated reasoning with a constraint-based metainterpreter. Journal of Logic Programming 37(1-3), 213–254 (1998)
Christiansen, H.: CHR Grammars. Int’l. Journal on Theory and Practice of Logic Programming 5(4-5), 467–501 (2005)
Christiansen, H.: On the implementation of global abduction. In: Inoue, K., Satoh, K., Toni, F. (eds.) CLIMA 2006. LNCS, vol. 4371, pp. 226–245. Springer, Heidelberg (2007)
Christiansen, H.: Executable specifications for hypotheses-based reasoning with Prolog and Constraint Handling Rules. Journal of Applied Logic (to appear, 2008)
Christiansen, H.: Prioritized abduction with CHR. In: Schrijvers, T., Raiser, F., Frühwirth, T. (eds.) CHR 2008, The 5th Workshop on Constraint Handling Rules (proceedings). RISC-Linz Report Series No. 08-10, pp. 159–173 (2008)
Christiansen, H., Dahl, V.: Logic grammars for diagnosis and repair. International Journal on Artificial Intelligence Tools 12(3), 227–248 (2003)
Christiansen, H., Dahl, V.: HYPROLOG: A new logic programming language with assumptions and abduction. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 159–173. Springer, Heidelberg (2005)
Christiansen, H., Dahl, V.: Meaning in Context. In: Dey, A.K., Kokinov, B., Leake, D.B., Turner, R. (eds.) CONTEXT 2005. LNCS, vol. 3554, pp. 97–111. Springer, Heidelberg (2005)
Christiansen, H., Martinenghi, D.: On simplification of database integrity constraints. Fundamenta Informatica 71(4), 371–417 (2006)
Console, L., Dupré, D.T., Torasso, P.: On the relationship between abduction and deduction. Journal of Logic and Computation 1(5), 661–690 (1991)
Denecker, M., Kakas, A.C.: Abduction in logic programming. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS, vol. 2407, pp. 402–436. Springer, Heidelberg (2002)
Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1(4), 269–271 (1959)
Duck, G.J., Stuckey, P.J., García de la Banda, M.J., Holzbaur, C.: The refined operational semantics of Constraint Handling Rules. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 90–104. Springer, Heidelberg (2004)
Endriss, U., Mancarella, P., Sadri, F., Terreni, G., Toni, F.: The ciff proof procedure for abductive logic programming with constraints. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS, vol. 3229, pp. 31–43. Springer, Heidelberg (2004)
Frühwirth, T.: Theory and practice of constraint handling rules, special issue on constraint logic programming. Journal of Logic Programming 37(1–3), 95–138 (1998)
Frühwirth, T.W., Holzbaur, C.: Source-to-source transformation for a class of expressive rules. In: Buccafurri, F. (ed.) APPIA-GULP-PRODE, pp. 386–397 (2003)
Frühwirth, T.W., Di Pierro, A., Wiklicky, H.: Probabilistic constraint handling rules. Electronic Notes in Theoretical Computer Science 76 (2002)
Fung, T.H., Kowalski, R.A.: The iff proof procedure for abductive logic programming. Journal of Logic Programmming 33(2), 151–165 (1997)
Kakas, A.C., Kowalski, R.A., Toni, F.: The role of abduction in logic programming. In: Gabbay, D.M., Hogger, C.J., Robinson, J.A. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 5, pp. 235–324. Oxford University Press, Oxford (1998)
Kakas, A.C., Michael, A., Mourlas, C.: ACLP: Abductive Constraint Logic Programming. Journal of Logic Programming 44, 129–177 (2000)
De Koninck, L., Schrijvers, T., Demoen, B.: User-definable rule priorities for chr. In: Leuschel, M., Podelski, A. (eds.) PPDP, pp. 25–36. ACM, New York (2007)
Lloyd, J.W.: Foundations of logic programming; Second, extended edition. Springer, Heidelberg (1987)
Muggleton, S.: Stochastic logic programs. In: de Raedt, L. (ed.) Advances in Inductive Logic Programming, pp. 254–264. IOS Press, Amsterdam (1996)
Nicolas, J.-M.: Logic for improving integrity checking in relational data bases. Acta Informatica 18, 227–253 (1982)
Poole, D.: Logic programming, abduction and probability - a top-down anytime algorithm for estimating prior and posterior probabilities. New Generation Computing 11(3), 377–400 (1993)
Poole, D.: Abducing through negation as failure: stable models within the independent choice logic. Journal of Logic Programming 44(1-3), 5–35 (2000)
Reitzler, S.: Probabilistic Constraint Logic Programming. PhD thesis, 1998. Appearing as AIMS, Arbeitspapiere des Instituts für Maschinelle Sprachverarbeitung, Lehrstuhl für Theoretische Computerlinguistic, Universität Stuttgart, Vol. 5(1) (1999)
Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM 12(1), 23–41 (1965)
Sato, T., Kameya, Y.: Prism: A language for symbolic-statistical modeling. In: IJCAI, pp. 1330–1339 (1997)
Sato, T., Tamaki, H.: First order compiler: A deterministic logic program synthesis algorithm. Journal of Symbolic Computation 8(6), 605–627 (1989)
Satoh, K.: “All’s well that ends well” - a proposal of global abduction. In: Delgrande, J.P., Schaub, T. (eds.) NMR, pp. 360–367 (2004)
Satoh, K.: An application of global abduction to an information agent which modifies a plan upon failure - preliminary report. In: Leite, J., Torroni, P. (eds.) CLIMA 2004. LNCS, vol. 3487, pp. 213–229. Springer, Heidelberg (2005)
Sneyers, J., Schrijvers, T., Demoen, B.: Dijkstra’s algorithm with Fibonacci heaps: An executable description in CHR. In: Fink, M., Tompits, H., Woltran, S. (eds.) WLP. INFSYS Research Report, vol. 1843-06-02, pp. 182–191. Technische Universität Wien, Austria (2006)
Swedish Institute of Computer Science. SICStus Prolog user’s manual, Version 4.0.2. Most recent version (2007), http://www.sics.se/isl
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Christiansen, H. (2008). Implementing Probabilistic Abductive Logic Programming with Constraint Handling Rules. In: Schrijvers, T., Frühwirth, T. (eds) Constraint Handling Rules. Lecture Notes in Computer Science(), vol 5388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92243-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-92243-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92242-1
Online ISBN: 978-3-540-92243-8
eBook Packages: Computer ScienceComputer Science (R0)