CLIP: A CLP(intervals) dialect for metalevel constraint solving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1753, Issue , 2000, Pages 200-214

  Hickey, Timothy J ^a  

^a BRANDEIS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; SEMANTICS;

COMPLEX CONSTRAINTS; CONSTRAINT SOLVING; IMPERATIVE LANGUAGES; INTERVAL ARITHMETIC; TERMINATION CONDITION;

LOGIC PROGRAMMING;

EID: 84958971740     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46584-7_14     Document Type: Conference Paper

References (23)

1. Forman S. Acton, Real computing made real: Preventing Errors in Scientific and Engineering calculations, Princeton University Press, Princeton, New Jersey 1996.
2. Applied Logic Systems. CLP(BNR) manual. www.als.com 1999.
3. Frédéric Benhamou and David McAllister and Pascal Van Hentenryck CLP(Intervals) Revisited Proceedings of ILPS'94, 1994.
4. Frédéric Benhamou and William J. Older. Applying interval arithmetic to real, integer, and Boolean constraints. Journal of Logic Programming, 32:1-24, 1997.
5. Bell Northern Research. CLP(BNR) Reference and User Manuals. 1988
6. Cucker, F. and Smale, S. Complexity Estimates Depending on Condition and Round-Off Error, Journal of the ACM, 46:1, pp. 113-184, 1999.
7. Daniel Dìaz. GNU Prolog. www.gnu.org/software/prolog 1999.
8. L. Granvilliers. A Symbolic-Numerical Branch and Prune Algorithm for Solving Non-linear Polynomial Systems. Journal of Universal Computer Science vol. 4(2):125-146, 1998. Springer Science Online.
9. F. Benhamou and L. Granvilliers. Automatic Generation of Numerical Redundancies for Non-Linear Constraint Solving. Reliable Computing, vol 3(3):335-344, 1997. Kluwer Academic Publishers.
10. T. Hickey, CLP(F) and Constrained ODEs, in the Workshop on Constraint Languages and their use in Problem Modeling, ECRC Tech. Report (defunct), 1994.
11. T. Hickey, CLIP: an implementation of CLP (Intervals), www.cs.brandeis.edu/~tim/clip, 1999.
12. T. Hickey, Analytic Constraint Solving and Interval Arithmetic, to appear in the Proceedings of POPL'00, Boston, MA, Jan. 2000.
13. T. Hickey and D. Wittenberg, Validated Constraint Compilation Brandeis University, Tech Rep. CS-99-201, April, 1999.
14. T. Hickey, H. Wu, and M.H. van Emden, A Unified Framework for Interval Con- straints and Interval Arithmetic, in Principles and Practice of Constraint Programming - CP98, M. Maher and J-F. Puget (eds.), Springer-Verlag, LNCS v. 1520, pp. 250-264, 1998.
15. T. Hickey, Q. Ju, and M.H. van Emden, Interval Arithmetic: from Principles to Implementation, Brandeis University Tech Report. CS-99-202, July, 1999.
16. R. Hammer, M. Hocks, U. Kulisch, and D. Ratz. Numerical Toolbox for Verified Computing I. Springer-Verlag, 1993.
17. Jaffar, J. and Lassez, J. L., Constraint Logic Programming. in Proceedings of the 14th ACM Symposium on the Principles of Programming Languages, 1987.
18. Moore, R. E., Interval Analysis. Prentice-Hall, 1966.
19. A. Neumaier. Interval Methods for Systems of Equations. Cambridge University Press. 1990.
20. William Older and Frédéric Benhamou. Programming in CLP(BNR). Proceedings of PPCP'93, 1993.
21. Older, W. and Vellino, A., Constraint Arithmetic on Real Intervals, in Constraint Logic Programming: Selected Research. Colmerauer, A. and Benhamou, F. (eds), MIT Press 1993.
22. Pascal Van Hentenryck, Laurent Michel, and Yves Deville. Numerica: A Modeling Language for Global Optimization. MIT Press, 1997.
23. Pascal Van Hentenryck, David McAllester, Dipak Kapur. Solving Polynomial Sys- tems Using a Branch and Prune Approach, SIAM Journal on Numerical Analysis, 34(2), 1997.