Symbolic-interval cooperation in constraint programming

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2001, Pages 150-166

  Granvilliers, L ^a   Monfroy, E ^a   Benhamou, F ^a  

^a UNIVERSITÉ DE NANTES   (France)

Author keywords

Constraint solving; Interval arithmetic; Symbolic computation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SIMULATION; CONSTRAINT THEORY; DIGITAL ARITHMETIC; FUNCTION EVALUATION; MATHEMATICAL TRANSFORMATIONS; NONLINEAR EQUATIONS; SET THEORY;

CONSTRAINT PROGRAMMING; CONSTRAINT SOLVING; INTERVAL MATHEMATICS; SYMBOLIC COMPUTATION;

COMPUTER PROGRAMMING;

EID: 0034782196     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/384101.384123     Document Type: Conference Paper

References (83)

1. Objectives of OpenMath
2. Constraint logic programming language CAL
3. Heterogeneous distributed cooperative problem solving system helios and its cooperation mechanisms
4. The essence of constraint propagation
5. The IWIM model for coordination of concurrent activities
6. Finite domain and cutting plane techniques in CLP (PB)
7. Solving interval linear systems with linear programming techniques
8. Heterogeneous constraint solving
9. Universally quantified interval constraints
10. Revising hull and box consistency
11. Automatic generation of numerical redundancies for non-linear constraint solving
12. Prolog IV: Langage et algorithmes
13. Combinatorial problem solving in constraint logic programming with cooperative solvers
14. Cooperation of constraint solvers using the new process control facilities of elan
15. Gröbner bases: An algorithmic method in polynomial ideal theory
16. Speeding-up quantifier elimination by Gröbner bases
17. Basic operators for solving constraints via collaboration of solvers
18. Solving nonlinear systems by constraint inversion and interval arithmetic
19. Interval linear constraint solving using the preconditionned interval Gauss-Seidel method
20. Logical arithmetic
21. Comparing partial consistencies
22. Quantifier elimination for real closed fields by cylindrical algebraic decomposition
23. Partial cylindrical algebraic decomposition for quantifier elimination
24. An introduction to Prolog III
25. Naive solving of non-linear constraints
26. Expressiveness of full first order constraints in the algebra of finite and infinite trees
27. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints
28. On the numerical condition of polynomials in Bernstein form
29. Constraint handling rules
30. Theory and practice of constraint handling rules
31. Solving strict polynomial inequalities by Bernstein expansion
32. A symbolic-numerical branch and prune algorithm for solving non-linear polynomial systems
33. A conservative scheme for parallel interval narrowing
34. Declarative modelling of constraint propagation strategies
35. CLIP: A CLP(Intervals) dialect for metalevel constraint solving
36. Better communication for tighter cooperation
37. Non-linear real constraints in constraint logic programming
38. Safe start region by fixed points and Tightening
39. Bernstein form is inclusion monotone
40. The CLP (ℜ) language and system
41. Optimal preconditionners for interval Gauss-Seidel methods
42. Consistency techniques for numeric CSPs
43. Dynamic optimization of interval narrowing algorithms
44. A distributed cooperating constraints solving system
45. Mechanically proving geometry theorems using a combination of wu's method and collin's method
46. Gröbner bases: Strategies and applications
47. The constraint solver collaboration language of BALI
48. Chaotic iteration for distributed constraint propagation
49. An open automated framework for constraint solver extension: The SoleX approach
50. Implementing non-linear constraints with cooperative solvers
51. The Mozart programming system
52. Sub-definiteness and basic means of knowledge representation
53. A constraint satisfaction approach to a circuit design problem
54. Interval methods
55. A note on the bernstein algorithm for bounds for interval polynomial
56. Concurrent cooperating solvers over reals
57. On the solution of interval linear systems
58. GMACS: The general-purpose module architecture for building cooperative solvers
59. The OZ programming model
60. Subdefinite models as a variety of constraint programing
61. Algorithmic power from declarative use of redundant constraints
62. Solving polynomial systems using a branch and prune approach
63. Strategic directions in constraint programming
64. LogicCalc: Integrating constraint programming and subdefinite models
65. Finding all solutions of nonlinear equations using linear combinations of functions
66. Interval analysis using linear programming