Abstract
Dealing with non-linear constraints over real numbers is one of the most important and non-trivial problems in constraint logic programming. We report our initial effort in tackling the problem with two methods developed in computer algebra during last three decades: Partial Cylindrical Algebraic Decomposition and Gröbner basis. We have implemented a prototype called RISC-CLP(Real). Experience with the prototype suggests that it is desirable and in fact feasible to provide a full support of non-linear constraints.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Aiba, K. Sakai, Y. Sato, D. J. Hawley, and R. Hasegawa. Constraint logic programming language CAL. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS-88), ICOT, Tokyo, pages 263–276, December 1988.
D. S. Arnon. A bibliography of quantifier elimination for real closed fields. Journal of Symbolic Computation, 5(1,2):267–274,1988.
B. Buchberger. An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal. PhD thesis, Universitat Innsbruck, Institut fur Mathematik, 1965. German.
B. Buchberger. Groebner bases: An algorithmic method in polynomial ideal theory. In N. K. Bose, editor, Recent Trends in Multidimensional Systems Theory, chapter 6. D. Riedel Publ. Comp., 1983.
B. Buchberger and H. Hong. Speeding-up quantifier elimination by Groebner bases. Technical Report 91-06.0, Research Institute for Symbolic Computation, Johannes Kepler University A-4040 Linz, Austria, 1991.
G. E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In Lecture Notes In Computer Science, pages 134–183. Springer-Verlag, Berlin, 1975. Vol. 33.
G. E. Collins and H. Hong. Partial cylindrical algebraic decomposition for quantifier elimination. Journal of Symbolic Computation, 12(3):299–328, September 1991.
G. E. Collins and R. Loos. The SAC-2 Computer Algebra System. Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria A-4040.
A. Colmerauer. An Introduction to Prolog III. Communications of the ACM, 33(7):69–90, July 1990.
M. Dincbas, P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. The Constraint Logic Programming Language CHIP. In Proceedings on the International Conference on Fifth Generation Computer Systems FGCS-88, Tokyo, Japan, December 1988
Nevin Heintze, Spiro Michaylov, and Peter Stuckey. CLP(-210-01) and some electrical engineering problems. In Jean-Louis Lassez, editor, Logic Programming: Proceedings of the 4th International Conference, pages 675–703. MIT Press, May 1987.
H. Hong. An improvement of the projection operator in cylindrical algebraic decomposition. In International Symposium of Symbolic and Algebraic Computation, pages 261–264, 1990.
H. Hong. Improvements in CAD-based Quantifier Elimination. PhD thesis, The Ohio State University, 1990.
H. Hong. Collision problems by partial CAD construction. Technical report, Research Institute for Symbolic Computation, Johannes Kepler University A-4040 Linz, Austria, January 1991.
H. Hong. Comparison of several decision algorithms for the existential theory of the reals. Technical Report 91-41.0, Research Institute for Symbolic Computation, Johannes Kepler University A-4040 Linz, Austria, 1991.
H. Hong. Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination. Technical Report 92-02.0, Research Institute for Symbolic Computation, Johannes Kepler University A-4040 Linz, Austria, 1992. To appear in the proceedings of International Conference on Symbolic and Algebraic Computation ISSAC-92.
G. Huet and D. Oppen. Equations and rewrite rules. In Formal Language Theory. Perspectives and Open Problems, pages 349–405. Academic Press, New York, 1980.
J. Jaffar and S. Michaylov. Methodology and implementation of a CLP system. In J.-L. Lassez, editor, Proceedings 4th ICLP, pages 196–218, Cambridge, MA, May 1987. The MIT Press.
Joxan Jaffar and Jean-Louis Lassez. Constraint logic programming. In Proceedings of the 14th ACM Symposium on Principles of Programming Languages, Munich, Germany, pages 111–119. ACM, January 1987.
M. Kalkbrenner and S. Stifter. Some examples for using quantifier elimination for the collision problem. Technical Report 87–22, Research Institute for Symbolic Computation, 1987.
Dallas Lankford. On proving term rewriting systems are noetherian. Technical Report MTP-3, Mathematics, Louisiana Tech. Univ., Ruston, LA 71272, May 1979.
R. G. K. Loos. The algorithm description language ALDES (Report). ACM SIGSAM Bull, 10(l):15–39, 1976.
S. McCallum. Solving polynomial strict inequalities using cylindrical algebraic decomposition. Technical Report 87-25.0, RISC-LINZ, Johannes Kepler University, A-4040 Linz, Austria (Europe), 1987.
A. Tarski. A Decision Method for Elementary Algebra and Geometry. Univ. of California Press, Berkeley, second edition, 1951.
J. H. Wilkinson. The evaluation of the zeros of ill-conditioned polynomials. parts i and ii. Numerische Mathematik, 1:150–166,167–180, 1959.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hong, H. (1992). Non-linear real constraints in constraint logic programming. In: Kirchner, H., Levi, G. (eds) Algebraic and Logic Programming. ALP 1992. Lecture Notes in Computer Science, vol 632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013827
Download citation
DOI: https://doi.org/10.1007/BFb0013827
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55873-6
Online ISBN: 978-3-540-47302-2
eBook Packages: Springer Book Archive