Skip to main content
SpringerLink
Log in

Abstracting numerical values in CLP(H,N)

  • Conference paper
  • First Online:
Programming Language Implementation and Logic Programming (PLILP 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 844))

Abstract

The paper defines approximations for the numerical leaves of variables in CLP(H,N) constraint systems. The abstractions are based on intervals which are computed by narrowing rules. The novelty of this approach lays in the. fact that intervals are used as abstraction and that narrowing rules do not only correspond to numerical constraints but also to unification constraints. In the first abstraction the impact of the narrowing rules is limited. A prototype implementation has been developed and the obtained results are sufficiently precise to recognise (future) redundant constraints. The abstraction can be extended (1) by incorporating the narrowing rules more globally (unification constraints are abstracted by a Prop-like abstraction, numeric constraints are kept in concrete form) and (2) by deriving ordinal relationships between variables.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. Bagnara, R. Giacobazzi, and G. Levi. An application of constraint propagation to data-flow analysis. In The ninth conference on Artificial Intelligence for Applications (CAIA'93), pages 270–276, 1993.

    Google Scholar 

  2. M. Bruynooghe. A practical framework for the abstract interpretation of logic programs. Journal of Logic Programming, 10(2):91–124, Feb. 1991.

    Google Scholar 

  3. M. Bruynooghe and D. Boulanger. Abstract interpretation for (constraint) logic programming. CW Report CW183, Department of Computer Science, Katholieke Universiteit Leuven, Nov. 1993. To appear in: Constraint programming, Eds. B. Mayoh, E. Tõugu, J.Penjam, NATO Advanced Science Series, Computers and System Sciences,Springer-Verlag,1994.

    Google Scholar 

  4. M. Bruynooghe and G. Janssens. An instance of abstract interpretation integrating type and mode inferencing. In R. A. Kowalski and K. A. Bowen, editors, Proceedings of the Fifth International Conference and Symposium on Logic Programming, pages 669–683, Seattle, 1988. MIT Press, Cambridge.

    Google Scholar 

  5. J. Cohen. Constraint logic programming languages. Communications of the ACM, 30(7):52–68, 1990.

    Google Scholar 

  6. A. Colmerauer. An introduction to PROLOGIII. Communications of the ACM, 30(7):69–96, 1990.

    Google Scholar 

  7. A. Cortesi, G. Filé, and W. Winsborough. Prop revisited: Propositional formula as abstract domain for groundness analysis. In Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, 1991.

    Google Scholar 

  8. P. Cousot and R. Cousot. Abstract interpretation and application to logic programs. The Journal of Logic Programming, 13(2 and 3):103–179, 1992.

    Google Scholar 

  9. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. In Proceedings of the 4th ACM Symposium on Principles of Programming Languages, pages 84–96, 1978.

    Google Scholar 

  10. V. Dumortier, G. Janssens, M. Bruynooghe, and M. Codish. Freeness Analysis in the Presence of Numerical Constraints. In D. S. Warren, editor, Proceedings of the Tenth International Conference on Logic Programming, pages 100–115. MIT Press, June 1993.

    Google Scholar 

  11. V. Englebert, B. Le Charlier, D. Roland, and P. Van Hentenryck. Generic Abstract Interpretation Algorithms for Prolog: Two Optimization Techniques and Their Experimental Evaluation. In M. Bruynooghe and M. Wirsing, editors, Proceedings of the 4th International Symposium on Programming Language Implementation and Logic Programming (PLILP 92), pages 311–325, Leuven, 1992. LNCS, Springer Verlag. Also in Software Practice and Experience, Volume 23 No. 4 pp-419–460, 1993.

    Google Scholar 

  12. J. Gallagher and D. de Waal. Fast and precise regular approximations of logic programs. In Proceedings of ICLP94. MITPress, 1994. to appear.

    Google Scholar 

  13. M. Garcia de la Banda and M. Hermenegildo. A Practical Approach to the Global Analysis of CLP Programs. In D. Miller, editor, Proceedings of the 1993 International Logic Programming Symposium, pages 437–455. MIT Press, October 1993.

    Google Scholar 

  14. J.-L. Imbert. Variable elimination for generalized linear constraints. In D. S. Warren, editor, Proceedings of the Tenth International Conference on Logic Programming, pages 499–516, June 1993.

    Google Scholar 

  15. J. Jaffar and J.-L. Lassez. Constraint logic programming. In Proceedings of the Fourteenth ACM symposium of the principles of programming languages, pages 111–119, Munich, 1987.

    Google Scholar 

  16. G. Janssens and M. Bruynooghe. Deriving descriptions of possible values of program variables by means of abstract interpretation. Journal of Logic Programming, 13(2&3):205–258, July 1992.

    Google Scholar 

  17. N. Jørgensen, K. Marriott, and S. Michaylov. Some global compile-time optimizations for CLP(R). In V. Saraswat and K. Ueda, editors, Proceedings of the 1991 International Symposium on Logic Programming, pages 420–434, San Diego, 1991.

    Google Scholar 

  18. J.-L. Lassez and K. McAloon. A canonical form for generalised linear constraints. Journal of Symbolic Computation, 13(1):1–24, Jan. 1992.

    Google Scholar 

  19. B. Le Charlier, K. Musumbu, and P. Van Hentenryck. A generic abstract interpretation algorithm and its complexity analysis (extended abstract). In K. Furukawa, editor, Proceedings of the Eighth International Conference on Logic Programming, pages 64–78, Paris, 1991. MIT Press, Cambridge.

    Google Scholar 

  20. J. Lee and M. V. Emden. Interval Computation as Deduction in CHIP. Journal of Logic Programming, 16(3&4):255–276, July, August 1993.

    Google Scholar 

  21. K. Marriott and H. Søndergaard. Notes for a tutorial on abstract interpretation of logic programs. In E. L. Lusk and R. A. Overbeek, editors, Proceedings of the North American Conference on Logic Programming, Cleveland, 1989.

    Google Scholar 

  22. K. Marriott and H. Søndergaard. Analysis of constraint logic programs. In S. Debray and M. Hermenegildo, editors, Proceedings of the 1990 North American Conference on Logic Programming, pages 531–547, Austin, 1990. MIT Press, Cambridge.

    Google Scholar 

  23. K. Marriott and P. Stuckey. The 3 R's of optimizing constraint logic programs: Refinement, Removal and Reordering. In Proceedings of the 20th ACM Symposium on Principles of Programming Languages, pages 334–344, Charleston, South Carolina, January 1993.

    Google Scholar 

  24. R. Simmons. Commonsense arithmetic reasoning. In Proceedings AAAI-86, pages 118–124, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, K.U. Leuven, Celestijnenlaan 200A, B-3001, Heverlee, Belgium

    Gerda Janssens & Maurice Bruynooghe

  2. Institut d'Informatique, Facultés Universitaires Notre Dame de la Paix, rue GrandGagnage 21, B-5000, Namur, Belgium

    Vincent Englebert

Authors
  1. Gerda Janssens
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maurice Bruynooghe
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vincent Englebert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Manuel Hermenegildo Jaan Penjam

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Janssens, G., Bruynooghe, M., Englebert, V. (1994). Abstracting numerical values in CLP(H,N). In: Hermenegildo, M., Penjam, J. (eds) Programming Language Implementation and Logic Programming. PLILP 1994. Lecture Notes in Computer Science, vol 844. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58402-1_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-58402-1_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58402-5

  • Online ISBN: 978-3-540-48695-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation