Integration of Quantifier Elimination with Constraint Logic Programming
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 ℝ.
Unable to display preview. Download preview PDF.
- [DS97]Andreas Dolzmann and Thomas Sturm. Redlog: Computer algebra meets computer logic. ACM SIGSAM Bulletin, 31(2):2–9, June 1997.Google Scholar
- [DSW98]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.Google Scholar
- [Hon93]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.Google Scholar
- [Kow79]Robert A. Kowalski. Algorithm = Logic + Control. Communications of the ACM, 22(7):424–435, July 1979.Google Scholar
- [Stu02]Thomas Sturm. Quantifier elimination-based constraint logic programming. Technical Report MIP-0202, FMI, Universität Passau, D-94030 Passau, Germany, January 2002.Google Scholar