Result: Integration of quantifier elimination with constraint logic programming
Title:
Integration of quantifier elimination with constraint logic programming
Authors:
Source:
AISC 2002 : artificial intelligence, automated reasoning, and symbolic computation (Marseille, 1-5 July 2002)Lecture notes in computer science. :7-11
Publisher Information:
Berlin: Springer, 2002.
Publication Year:
2002
Physical Description:
print, 5 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Fonctions logiques, booléennes et de commutation, Logical, boolean and switching functions, Calcul formel, Computer algebra, Cálculo formal, Programmation logique avec contrainte, Constraint logic programming, Programación lógica con restricción, Satisfaction contrainte, Constraint satisfaction, Satisfaccion restricción, Elimination quantificateur, Quantifier elimination
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
University of Passau, Germany
ISSN:
0302-9743
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.15052414
Database:
PASCAL Archive
Further Information
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.