Solving linear, min and max constraint systems using CLP based on relational interval arithmetic

Theoretical Computer Science

Volumn 173, Issue 1, 1997, Pages 253-281

  Girodias, Pierre ^a   Cerny, Eduard ^a   Older, William J ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b NORTEL NETWORKS   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; DIGITAL ARITHMETIC; LOGIC PROGRAMMING; PROBLEM SOLVING;

CONSTRAINT LOGIC PROGRAMMING; CONSTRAINT SATISFACTION PROBLEMS; LINEAR CONSTRAINTS; RELATIONAL INTERVAL ARITHMETIC;

CONSTRAINT THEORY;

EID: 0031076573     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00198-3     Document Type: Article

References (32)

1. G. Alefeld and J. Herzberger, Introduction to Interval Computations (Academic Press, New York, 1983).
2. T. Amon and G. Borriello, An approach to symbolic timing verification, in: Proc. 29th ACM/IEEE Design Automation Conf., DAC'92 (Anaheim, CA, 1992) 410-413.
3. T. Amon, H. Hulgaard, G. Borriello and S. Burns, Timing analysis of current systems, in: Proc. 1993 IEEE Internat. Conf. on Computer Design: VLSI in Computers & Processors, 'ICCD'93' (Cambridge, MA, October 1993.
4. F. Benhamou and W.J. Older. Applying interval arithmetic to real, integer and Boolean constraints, J. Logic Programming, forthcoming.
5. J.A. Brozowski, T. Gahlinger and F. Mavaddat, Consistency and satisfiability of waveform timing specifications, Networks 21 (1991) 91-107.
6. J.G. Cleary, Logical arithmetic, Future Comput. Systems 2(2) (1987) 125-149.
7. A. Colmerauer, An introduction to Prolog III, in: Comm. ACM 33(7) (July 1990) 69-90.
8. R. Dechter, From local to global consistency, in: Proc. 8th Canadian Conf. on Artificial Intelligence, (1990) 231-237.
9. Y. Deville and P.V. Henteryck. An efficient arc consistency algorithm for a class of CSP problems, in: Proc. 12th Internat. Joint Conf. on Artificial Intelligence (Sydney, Australia, 1991) 325-330.
10. R.W. Floyd, Algorithm 97: shortest path, CACM 5(6) (June 1962) 345.
11. T. Gahlinger, Coherence and satisfiability of waveform timing specifications, Research Report CS-90-11, University of Waterloo, 1990, Ph.D. thesis.
12. J. Jaffar and J.L. Lassez, Constraint logic programming, in: POPL'87: Proc. 14th ACM Symp. on Principles of Programming Languages (Munich, January 1987 (ACM), New York) 111-119.
13. J. Jaffar and M. Maher, Constraint logic programming: a survey, J. Logic Programming 19/20 (1994) 503-581.
14. P. Jeavons, D. Cohen and M. Gyssens, A unifying framework for tractable constraints, in: Lecture Notes in Computer Science 976, Proc. Ist Internat. Conf. on Principles and Practice of Constraint Programming - CP'95, Lecture Notes in Computer Science, Vol. 976 (Springer, Berlin, 1995) 276-291.
15. H.F. Jyu, S. Devadas and K.W. Keutzer, Statistical timing analysis of combinational logic circuits, IEEE Trans. On Very Large Scale Integration (VLSI) Systems 1(2) (June 1993) 126-137.
16. K. Khordoc, M. Dufresne, E. Cerny, P.-A. Babkine and A. Silburt, Integrating behaviour and Timing in executable specifications, Proc. IFIP Conf. on HDL and their Applications (1993) 385-402.
17. W. Leler, Constraint Programming Languages: Their Specification and Generation (Addison-Wesley, Reading, MA 1988).
18. O. Lhomme, Consistency techniques for numeric CSPs, in: Proc. 13th Internat. Joint Conf. on Artificial Intelligence (1993).
19. A. Mackworth, Consistency in networks of relations, Artificial Intelligence 8(1)(1977) 99-118.
20. K. McMillan and D. Dill, Algorithms for interface timing verification, in: Proc. IEEE Internat. Conf. on Computer Design, ICCD'92 (1992) 48-51.
21. U. Montanari, Networks of constraints: fundamental properties and applications to picture processing. Information Science 7(2)(1914) 95-132.
22. R.E. Moore, Interval Analysis (Prentice-Hall, Englewood Cliffs, NJ, 1966).
23. R.E. Moore, Methods and Applications of Interval Analysis, Studies in Applied Matthematics, Philadelphia, 1979.
24. W. Older and A. Vellino, Constraint arithmetic on real intervals, in: F. Benhamou and A. Colmerauer, eds., Constraints Logic Programming: Selected Research (MIT Press, Cambridge, MA, 1993) 175-195.
25. P. Van Beek, On the minimality and decompsability of constraint networks, in: Proc. 10th National Conf. on Artificial Intelligence, AAAI-92 (MIT Press, Cambrdige, MA, 1992) 447-452.
26. P. Vanbekbergen, G. Goossens and H. De Man, Specification and Analysis of timing constraints in signa transitions graphs, in: Proc. European Conf. on Design Automation, EDAC'92 (Brussels, Belgium, 1992) 302-306.
27. H. Vandecasteele and D. De Schreye, Implementing a finite-domain CLP-language on top of Prolog: a transformation approach, in: Proc. 5th Internat. Conf. Logic Programming and Automated Reasoning, Lecture notes in Artificial Intelligence, Vol. 822 (1994) 84-98.
28. P. Van Hentenryck, Constraint Satisfaction in Logic Programming, Logic Programming Series (MIT Press, Cambridge, MA, 1989).
29. E.A. Walkup and G. Borriello, Interface timing verification with applications to synthesis, Proc. Design Automation Conf. (1994).
30. D.L. Waltz, Generating semantic descriptions from drawings of scenes with shadows, in: P.H. Winston, ed., The Psychology of Computer Vision (McGraw Hill, New York, 1975).
31. S. Warshall, A Theorem on Boolean Matrices, JACM 9 (1962) 11-12.
32. T.Y. Yen, A. Ishii, A. Casavant and W. Wolf, Efficient algorithms for interface timing verification, Proc. Design Automation Conf. (1994).