Integration of Quantifier Elimination with Constraint Logic Programming

Authors:
Thomas Sturm
Affiliations:
-
Venue:
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
Year:
2002

Citing 2
Cited 0

REDLOG: computer algebra meets computer logic

ACM SIGSAM Bulletin
Algorithm = logic + control

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

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 R, C, and Qp. For our discussion here we restrict to R.