Advertisement

Automating Termination Proofs for CHR

  • Paolo Pilozzi
  • Danny De Schreye
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5649)

Abstract

We propose a constraint-based approach towards automated termination analysis of Constraint Handling Rules (CHR). Similar to such approaches for Logic Programming (LP), we define a symbolic level mapping on atoms of the program and express termination conditions using these. Then, we search for an assignment to the symbolic coefficients, validating the termination conditions. However, different from the approaches developed for LP, termination of CHR programs is concerned with multi-headed rules, while the existing constraint-based approaches in LP are developed for definite programs. These cannot be adapted directly to a multi-headed context. In the following we discuss a constraint-based approach for CHR programs and show how such an approach can be obtained by an elegant reuse of existing techniques in LP. We evaluate the approach, using our implementation, CHRisTA.

Keywords

Logic Program Logic Programming Simple Genetic Algorithm Dependency Pair Recursive Program 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Frühwirth, T.: Proving Termination of Constraint Solver Programs. In: New Trends in Constraints, pp. 298–317 (2000)Google Scholar
  2. 2.
    Frühwirth, T.: Theory and practice of constraint handling rules. JLP 37(1-3), 95–138 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Janssens, G., Bruynooghe, M.: Deriving descriptions of possible values of program variables by means of abstract interpretation. JLP 13(2-3), 205–258 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Nguyen, M.T., Giesl, P., Schneider-Kamp, J., 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)CrossRefGoogle Scholar
  5. 5.
    Nguyen, M.T., De Schreye, D.: Polynomial interpretations as a basis for termination analysis of logic programs. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 311–325. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. 6.
    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)CrossRefGoogle Scholar
  7. 7.
    Voets, D., Pilozzi, P., De Schreye, D.: A new approach to termination analysis of Constraint Handling Rules. In: Pre-proceedings LOPSTR 2008, pp. 28–42 (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Paolo Pilozzi
    • 1
  • Danny De Schreye
    • 1
  1. 1.Dept. of Computer ScienceK.U.LeuvenBelgium

Personalised recommendations