Mechanical geometry theorem proving
Mechanical geometry theorem proving
On the numerical condition of polynomials in Berstein form
Computer Aided Geometric Design
Communications of the ACM
Partial Cylindrical Algebraic Decomposition for quantifier elimination
Journal of Symbolic Computation
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent constraint programming
Concurrent constraint programming
Naive solving of non-linear constraints
Constraint logic programming
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Strategic directions in constraint programming
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Solving Polynomial Systems Using a Branch and Prune Approach
SIAM Journal on Numerical Analysis
Chaotic iteration for distributed constraint propagation
Proceedings of the 1999 ACM symposium on Applied computing
The essence of constraint propagation
Theoretical Computer Science
An open automated framework for constraint solver extension: the SoleX approach
Fundamenta Informaticae - Special issue on symbolic computation and artificial intelligence
Implementing non-linear constraints with cooperative solvers
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Revising hull and box consistency
Proceedings of the 1999 international conference on Logic programming
A conservative scheme for parallel interval narrowing
Information Processing Letters
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Constraint Satisfaction Approach to a Circuit Design Problem
Journal of Global Optimization
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition
Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
The IWIM Model for Coordination of Concurrent Activities
COORDINATION '96 Proceedings of the First International Conference on Coordination Languages and Models
Non-linear Real Constraints in Constraint Logic Programming
Proceedings of the Third International Conference on Algebraic and Logic Programming
Heterogeneous Constraint Solving
ALP '96 Proceedings of the 5th International Conference on Algebraic and Logic Programming
Gröbner Bases: Strategies and Applications
AISMC-1 Proceedings of the International Conference on Artificial Intelligence and Symbolic Mathematical Computation
Mechanically Proving Geometry Theorems Using a Combination of Wu's Method and Collins' Method
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Subdefinite Models as a Variety of Constraint Programming
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
A Graphical Interface for Solver Cooperations
PSI '02 Revised Papers from the 4th International Andrei Ershov Memorial Conference on Perspectives of System Informatics: Akademgorodok, Novosibirsk, Russia
Solving Nonlinear Equations by Abstraction, Gaussian Elimination, and Interval Methods
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
Coordination-based distributed constraint solving in DICE
Proceedings of the 2003 ACM symposium on Applied computing
Basic components for constraint solver cooperations
Proceedings of the 2003 ACM symposium on Applied computing
Journal of Global Optimization
Exploiting Common Subexpressions in Numerical CSPs
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Towards automated reasoning on the properties of numerical constraints
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
On complementary principles of object-oriented constraint programming
Programming and Computing Software
Representing and solving finite-domain constraint problems using systems of polynomials
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
This paper surveys the field of cooperative constraint solving for a constraint programming perspective with an emphasis on combinations of symbolic and interval methods. On the one hand, symbolic methods provide adapted representations of the constraint expressions. On the other hand, interval methods compute verified enclosures of solution sets. Using cooperation of solvers, one can take advantage of both techniques in a unified framework: symbolic algorithms generally need to be combined with root extraction methods, and the efficiency of interval algorithms strongly depends on constraint expressions.