Symbolic-interval cooperation in constraint programming
- 1 July 2001
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 150-166
- https://doi.org/10.1145/384101.384123
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- Non-linear real constraints in constraint logic programmingPublished by Springer Nature ,2005
- On the numerical condition of polynomials in Bernstein formPublished by Elsevier ,2003
- Solving strict polynomial inequalities by Bernstein expansionPublished by Institution of Engineering and Technology (IET) ,1999
- Cooperation of Constraint Solvers: Using the New Process Control Facilities of ELANElectronic Notes in Theoretical Computer Science, 1998
- Dynamic optimization of interval narrowing algorithmsThe Journal of Logic Programming, 1998
- Strategic directions in constraint programmingACM Computing Surveys, 1996
- The CLP( ℛ ) language and systemACM Transactions on Programming Languages and Systems, 1992
- Partial Cylindrical Algebraic Decomposition for quantifier eliminationJournal of Symbolic Computation, 1991
- An introduction to Prolog IIICommunications of the ACM, 1990
- Gröbner Bases: An Algorithmic Method in Polynomial Ideal TheoryPublished by Springer Nature ,1985