Programming Pearl : Computing convex hulls with a linear solver

Theory and Practice of Logic Programming

Volumn 5, Issue 1-2, 2005, Pages 259-271

  Benoy, Florence ^a   King, Andy ^a   Mesnard, Fred ^b  

^a UNIVERSITY OF KENT   (United Kingdom)

^b UNIVERSITÉ DE LA RÉUNION   (France)

Author keywords

Abstract interpretation; Convex hull; Linear constraints; Polyhedra

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; CONSTRAINT THEORY; LOGIC PROGRAMMING; MATRIX ALGEBRA; PROBLEM SOLVING;

ABSTRACT INTERPRETATION; CONVEX HULL; GROUNDNESS; LINEAR CONSTRAINTS; POLYHEDRA;

LINEAR PROGRAMMING;

EID: 14544296577     PISSN: 14710684     EISSN: None     Source Type: Journal    
DOI: 10.1017/S1471068404002261     Document Type: Article

References (20)

1. ANCOURT, C. 1991. Gén'eration Automatique de Code de Transfert pour Multiprocesseurs à Mémoires Locales. PhD thesis, Université Paris 6.
2. BAGNARA, R., RICCI, E., ZAFFANELLA, E. AND HILL, P. M. 2002. Possibly Not Closed Convex Polyhedra and the Parma Polyhedra Library. In Static Analysis Symposium, M. V. Hermenegildo and G. Puebla, Eds. Lecture Notes in Computer Science, vol. 2477. Springer-Verlag, 213-229. See also http://www.cs.unipr.it/ ppl/.
3. BENOY, F. AND KING, A. 1996. Inferring Argument Size Relationships with CLP(ℛ). In Logic-based Program Synthesis and Transformation (Selected Papers), J. P. Gallagher, Ed. Lecture Notes in Computer Science, vol. 1207. Springer-Verlag, 204-223.
4. CHANDRU, V., LASSEZ, C. AND LASSEZ, J.-L. 2000. Qualitative Theorem Proving in Linear Constraints. In International Symposium on Artificial Intelligence and Mathematics. Long version to appear in the Annals of Mathematics and Artificial Intelligence.
5. CODISH, M., GENAIM, S., SONDEROAARD, H. AND STUCKEY, P. 2001. Higher-Precision Groundness Analysis. In International Conference on Logic Programming, P. Codognet, Ed. Lecture Notes in Computer Science, vol. 2237. Springer-Verlag, 135-149.
6. CODISH, M. AND TABOCH, C. 1999. A Semantic Basis for the Termination Analysis of Logic Programs. The Journal of Logic Programming 41, 1, 103-123.
7. COUSOT, P. AND HALBWACHS, N. 1978. Automatic Discovery of Linear Restraints among Variables of a Program. In Principles of Programming Languages. ACM Press, 84-97.
8. DE BACKER, B. AND BERINGER, H. 1993. A CLP language handling disjunctions of linear constraints. In International Conference on Logic Programming, D. S. Warren, Ed. MIT Press, 550-563.
9. DERANSART, P., ED-DBALI, A. AND CERVONI, L. 1996. Prolog: The Standard. Springer-Verlag.
10. GENAIM, S. AND CODISH, M. 2001. Inferring Termination Conditions for Logic Programs using Backwards Analysis. In International Conference on Logic for Programming, Artificial Intelligence and Reasoning, R. Nieuwenhuis and A. Voronkov, Eds. Lecture Notes in Artificial Intelligence, vol. 2250. Springer-Verlag, 681-690.
11. HOLZBAUR, C. 1995. OFAI clp(Q,R) Manual. Tech. Rep. TR-95-09, Austrian Research Institute for Artificial Intelligence (ÖFAI), Schottengasse 3, A-1010 Vienna, Austria.
12. HORSPOOL, N. 1990. Mode Analysis Techniques for Discovery of Lists in Prolog. In Object Management, D. Tsichritzis, Ed. Centre Universitaire d'Informatique, University of Geneva, 305-312.
13. KING, A., SHEN, K. AND BENOY, F. 1997. Lower-bound Time-Complexity Analysis of Logic Programs. In International Symposium on Logic Programming, J. Maluszynski, Ed. MIT Press, 261-276.
14. LE VERGE, H. 1992. A note on Chernikova's algorithm. Tech. Rep, 635, IRISA, Campus Universitaire de Beaulieu, Rennes, France.
15. LOECHNER, V. AND WILDE, D. K. 1997. Parameterized Polyhedra and their Vertices, International Journal of Parallel Programming 25, 6, 525-549. See also http://icps.ustrasbg.fr/polylib/.
16. MESNARD, F. AND NEUMERKEL, U. 2001. Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs. In Static Analysis Symposium, P. Cousot, Ed. Lecture Notes in Computer Science, vol. 2126. Springer-Verlag, 93-110.
17. QUINTON, P., RAJOPADHYE, S. V., AND RISSET, T. 1997. On Manipulating Z-Polyhedra using a Canonical Representation. Parallel Processing Letters 7, 2, 181-194.
18. ROCKAFELLAR, R. T. 1970. Convex Analysis. Princeton University Press.
19. SAG̈LAM, H. AND GALLAGHER, J. P. 1997. Constrained Regular Approximation of Logic Programs. In Logic Programming Synthesis and Transformation (Selected Papers), N. E. Fuchs, Ed. Springer-Verlag, 282-299.
20. VANHOOF, W. AND BRUYNOOGHE, M. 2001. Binding-Time Annotations Without Binding-Time Analysis. In International Conference on Logic for Programming, Artificial Intelligence and Reasoning, R. Nieuwenhuis and A. Voronkov, Eds. Lecture Notes in Artificial Intelligence, vol. 2250. Springer-Verlag, 707-722.