A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions
When numerical CSPs are used to solve systems of n equations with n variables, the interval Newton operator plays a key role: It acts like a global constraint, hence achieving a powerful contraction, and proves rigorously the existence of solutions. However, both advantages cannot be used for under-constrained systems of equations, which have manifolds of solutions. A new framework is proposed in this paper to extend the advantages of the interval Newton to under-constrained systems of equations. This is done simply by permitting domains of CSPs to be parallelepipeds instead of the usual boxes.
Unable to display preview. Download preview PDF.
- 7.Neumaier, A.: Interval Methods for Systems of Equations. Cambridge U. P, Cambridge (1990)Google Scholar
- 11.Goldsztejn, A., Hayes, W.: Reliable Inner Approximation of the Solution Set to Initial Value Problems with Uncertain Initial Value. In: Proc. of SCAN 2006 (2006)Google Scholar
- 14.Benhamou, F., McAllister, D., Hentenryck, P.V.: CLP(Intervals) Revisited. In: International Symposium on Logic Programming, pp. 124–138 (1994)Google Scholar
- 15.Collavizza, H., Delobel, F., Rueher, M.: Comparing Partial Consistencies. Reliab. Comp. 1, 1–16 (1999)Google Scholar
- 16.Goldsztejn, A.: A Branch and Prune Algorithm for the Approximation of Non-Linear AE-Solution Sets. In: Proc. of ACM SAC 2006, pp. 1650–1654 (2006)Google Scholar