Abstract
Termination analysis has received considerable attention in Logic Programming for several decades. In recent years, probabilistic extensions of Logic Programming languages have become increasingly important. Languages like PRISM, CP-Logic, ProbLog, and CHRiSM have been introduced and proved very useful for addressing problems in which a combination of logical and probabilistic reasoning is required. As far as we know, the termination of probabilistic logical programs has not received any attention in the community so far.
Termination of a probabilistic program is not a crisp notion. Given a query, such a program does not simply either terminate or not terminate, but it terminates with a certain probability.
In this paper, we explore this problem in the context of CHRiSM, a probabilistic extension of CHR. We formally introduce the notion of probabilistic termination. We study this concept on the basis of a number of case studies. We provide some initial sufficient conditions to characterize probabilistically terminating programs and queries. We also discuss some challenging examples that reveal the complexity and interest of more general settings. The paper is intended as a first step in a challenging and important new area in the analysis of Logic Programs.
Keywords
- Termination Analysis
- Probabilistic LP
- Constraint Handling Rules
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abdennadher, S.: A language for experimenting with declarative paradigms. In: Frühwirth, T., et al. (eds.) RCoRP 2000, bis (2000)
Abdennadher, S., Rigotti, C.: Automatic generation of CHR constraint solvers. TPLP 5(4-5), 403–418 (2005)
Apt, K.R., Pedreschi, D.: Reasoning about termination of pure Prolog programs. Inf. Comput. 106(1), 109–157 (1993)
Bournez, O., Garnier, F.: Proving Positive Almost Sure Termination Under Strategies. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol. 4098, pp. 357–371. Springer, Heidelberg (2006)
Bournez, O., Kirchner, C.: Probabilistic Rewrite Strategies. Applications to ELAN. In: Tison, S. (ed.) RTA 2002. LNCS, vol. 2378, pp. 252–266. Springer, Heidelberg (2002)
De Raedt, L., Kimmig, A., Toivonen, H.: ProbLog: A probabilistic Prolog and its application in link discovery. In: IJCAI, pp. 2462–2467 (2007)
Decorte, S., De Schreye, D., Vandecasteele, H.: Constraint-based automatic termination analysis of logic programs. ACM TOPLAS 21(6), 1137–1195 (1999)
Frühwirth, T.: Proving Termination of Constraint Solver Programs. In: Apt, K.R., Kakas, A.C., Monfroy, E., Rossi, F. (eds.) Compulog Net WS 1999. LNCS (LNAI), vol. 1865, pp. 298–317. Springer, Heidelberg (2000)
Frühwirth, T.: Constraint Handling Rules. Cambridge University Press (2009)
Frühwirth, T., Di Pierro, A., Wiklicky, H.: Probabilistic Constraint Handling Rules. In: Comini, M., Falaschi, M. (eds.) WFLP 2002. ENTCS, vol. 76. Elsevier (2002)
Frühwirth, T., Raiser, F. (eds.): Constraint Handling Rules: Compilation, Execution, and Analysis. Books on Demand GmbH, Norderstedt (2011)
Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing and improving dependency pairs. J. Autom. Reasoning 37(3), 155–203 (2006)
Hurd, J.: A Formal Approach to Probabilistic Termination. In: Carreño, V.A., Muñoz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol. 2410, pp. 230–245. Springer, Heidelberg (2002)
Leuschel, M., Martens, B., De Schreye, D.: Controlling generalization amd polyvariance in partial deduction of normal logic programs. ACM TOPLAS 20(1), 208–258 (1998)
Lindenstrauss, N., Sagiv, Y., Serebrenik, A.: Proving Termination for Logic Programs by the Query-Mapping Pairs Approach. In: Bruynooghe, M., Lau, K.-K. (eds.) Program Development in CL. LNCS, vol. 3049, pp. 453–498. Springer, Heidelberg (2004)
Martens, B., De Schreye, D., Bruynooghe, M.: Sound and complete partial deduction with unfolding based on well-founded measures. In: FGCS, pp. 473–480 (1992)
Mesnard, F., Bagnara, R.: cTI: A constraint-based termination inference tool for ISO-Prolog. TPLP 5(1-2), 243–257 (2005)
Mesnard, F., Ruggieri, S.: On proving left termination of constraint logic programs. ACM Trans. Comput. Log. 4(2), 207–259 (2003)
Monniaux, D.: An Abstract Analysis of the Probabilistic Termination of Programs. In: Cousot, P. (ed.) SAS 2001. LNCS, vol. 2126, pp. 111–126. Springer, Heidelberg (2001)
Nguyen, M.T., Giesl, J., Schneider-Kamp, P., De Schreye, D.: Termination Analysis of Logic Programs Based on Dependency Graphs. In: King, A. (ed.) LOPSTR 2007. LNCS, vol. 4915, pp. 8–22. Springer, Heidelberg (2008)
Nguyen, M.T., De Schreye, D., Giesl, J., Schneider-Kamp, P.: Polytool: polynomial interpretations as a basis for termination analysis of logic programs. TPLP 11, 33–63 (2011)
Pilozzi, P., De Schreye, D.: Termination Analysis of CHR Revisited. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 501–515. Springer, Heidelberg (2008)
Pilozzi, P., De Schreye, D.: Automating Termination Proofs for CHR. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 504–508. Springer, Heidelberg (2009)
Sato, T.: A glimpse of symbolic-statistical modeling by PRISM. Journal of Intelligent Information Systems 31, 161–176 (2008)
Schneider-Kamp, P., Giesl, J., Ströder, T., et al.: Automated termination analysis for logic programs with cut. TPLP 10(4-6), 365–381 (2010)
Sneyers, J., Meert, W., Vennekens, J., Kameya, Y., Sato, T.: CHR(PRISM)-based probabilistic logic learning. TPLP 10(4-6) (2010)
Sneyers, J., Van Weert, P., Schrijvers, T., De Koninck, L.: As time goes by: Constraint Handling Rules — a survey of CHR research between 1998 and 2007. TPLP 10(1), 1–47 (2010)
Ströder, T., Emmes, F., Schneider-Kamp, P., Giesl, J., Fuhs, C.: A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog. In: Vidal, G. (ed.) LOPSTR 2011. LNCS, vol. 7225, pp. 235–250. Springer, Heidelberg (2012)
Vidal, G.: A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs. In: Alpuente, M. (ed.) LOPSTR 2010. LNCS, vol. 6564, pp. 200–214. Springer, Heidelberg (2011)
Voets, D., De Schreye, D., Pilozzi, P.: A new approach to termination analysis of constraint handling rules. In: LOPSTR, pp. 28–42 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sneyers, J., De Schreye, D. (2012). Probabilistic Termination of CHRiSM Programs. In: Vidal, G. (eds) Logic-Based Program Synthesis and Transformation. LOPSTR 2011. Lecture Notes in Computer Science, vol 7225. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32211-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-642-32211-2_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32210-5
Online ISBN: 978-3-642-32211-2
eBook Packages: Computer ScienceComputer Science (R0)
