Continuous first-order constraint satisfaction with equality and disequality constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2470, Issue , 2002, Pages 680-685

  Ratschan, Stefan ^a  

^a UNIVERSITY OF GIRONA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; NUMERICAL METHODS;

CONSTRAINT SATISFACTION TECHNIQUES; FIRST ORDER; NUMERICAL CONSTRAINTS; REAL NUMBER;

COMPUTER PROGRAMMING;

EID: 84957001221     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46135-3_45     Document Type: Conference Paper

References (5)

1. F. Benhamou and F. Goualard. Universally quantified interval constraints. In Proc. of the Sixth Intl. Conf. on Principles and Practice of Constraint Programming (CP’2000), number 1894 in LNCS, Singapore, 2000. Springer Verlag.
2. G.E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In B. F. Caviness and J.R. Johnson, editors, Second GI Conf. Automata Theory and Formal Languages, volume 33 of LNCS, pages 134–183. Springer Verlag, Wien, 1975.
3. A. Neumaier. Interval Methods for Systems of Equations. Cambridge Univ. Press, Cambridge, 1990.
4. S. Ratschan. Applications of real first-order constraint solving — bibliography. http://www.risc.uni-linz.ac.at/people/sratscha/appFOC.html, 2001.
5. S. Ratschan. Continuous first-order constraint satisfaction. In Artificial Intelligence, Automated Reasoning, and Symbolic Computation, number 2385 in LNCS. Springer, 2002.