Abstract
We examine the potential of an extension of constraint logic programming, where the admissible constraints are arbitrary first-order formulas over some domain. Constraint solving is realized by effective quantifier elimination. The arithmetic is always exact. We describe the conceptual advantages of our approach and the capabilities of the current implementation clp(rl). Supported domains are currently ℝ, ℂ, and ℚp. For our discussion here we restrict to ℝ.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andreas Dolzmann and Thomas Sturm. Redlog: Computer algebra meets computer logic. ACM SIGSAM Bulletin, 31(2):2–9, June 1997.
Andreas Dolzmann, Thomas Sturm, and Volker Weispfenning. Real quantifier elimination in practice. In B. H. Matzat, G.-M. Greuel, and G. Hiss, editors, Algorithmic Algebra and Number Theory, pages 221–247. Springer, Berlin, 1998.
Hoon Hong. RISC-CLP(Real): Constraint logic programming over real numbers. In Frederic Benhamou and Alain Colmerauer, editors, Constraint Logic Programming: Selected Research. MIT Press, 1993.
Robert A. Kowalski. Algorithm = Logic + Control. Communications of the ACM, 22(7):424–435, July 1979.
Thomas Sturm. Quantifier elimination-based constraint logic programming. Technical Report MIP-0202, FMI, Universität Passau, D-94030 Passau, Germany, January 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sturm, T. (2002). Integration of Quantifier Elimination with Constraint Logic Programming. In: Calmet, J., Benhamou, B., Caprotti, O., Henocque, L., Sorge, V. (eds) Artificial Intelligence, Automated Reasoning, and Symbolic Computation. AISC Calculemus 2002 2002. Lecture Notes in Computer Science(), vol 2385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45470-5_4
Download citation
DOI: https://doi.org/10.1007/3-540-45470-5_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43865-6
Online ISBN: 978-3-540-45470-0
eBook Packages: Springer Book Archive