Skip to main content
SpringerLink
Log in

Concurrent Cooperating Solvers over Reals

  • Published:
Reliable Computing

Abstract

Systems combining an interval narrowing solver and a linear programming solver can tackle constraints over the reals that none of these solvers can handle on their own. In this paper we introduce a cooperating scheme where an interval narrowing solver and a linear programming solver work concurrently. Information exchanged by the solvers is therefore handled as soon as it becomes available. Moreover, to improve the pruning, the linear programming solver computes the actual range of values of each variable with respect to the subset of linear constraints. To validate the proposed architecture a prototype system-named CCC-has been developed. Several examples are given to illustrate the gain in speed and precision we can expect with CCC.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Benhamou, F., Mc Allester, D., and Van Hentenryck, P.: CLP (Intervals) Revisited, in: Proc. ILPS'94, MIT Press, 1994.

  2. Benhamou, F. and Older, W.: Applying Interval Arithmetic to Real, Integer and Boolean Constraints, Journal of Logic Programming (1994).

  3. Beringer, H. and de Backer, B.: Combinatorial Problem Solving in Constraint Logic Programming with Cooperative Solvers, in: Beierle, C. and Plumer, L. (eds), Logic Programming: Formal Methods and Practical Applications, Elsevier Science Publishers, 1995.

  4. Chiu, C. K. and Lee, J. H. M.: Towards Practical Interval Constraint Logic Programming, in: Proc. ILPS'94, MIT Press, 1994, pp. 109–123.

  5. Chiu, C. K. and Lee, J.H.M.: Efficient Linear Equality Solving in Constraint Logic Programming, Research Report, Dep. of Computer Sciences, The Chinese University of Hong Hong, 1996.

  6. Chvatal, V.: Linear Programming, W. H. Freeman and Co, 1983.

  7. Colmerauer, A.: An Introduction to PROLOG-III, Communications of the ACM 33 (7) (1990), pp. 69–90.

    Google Scholar 

  8. Davis, E.: Constraint Propagation with Interval Labels, Artificial Intelligence 32 (1987), pp. 281–331.

    Google Scholar 

  9. Hong, H.: Confluency of Cooperative Constraint Solvers, Technical Report, Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria, 1994.

    Google Scholar 

  10. Jaffar, J. and Maher, M.: Constraint Logic Programming: A Survey, Journal of Logic Programming 19 (20) (1994), pp. 503–581.

    Google Scholar 

  11. Lhomme, O.: Consistency Techniques for Numeric CSPs, in: Proc. IJCAI93, Chambery, France, 1993, pp. 232–238.

    Google Scholar 

  12. Lhomme, O., Gotlieb, A., Rueher, M., and Taillibert, P.: Boosting the Interval Narrowing Algorithm, in: Proc. JICSLP'96, MIT Press, 1996, pp. 378–392.

  13. Marti, P. and Rueher, M.: A Distributed Cooperating Constraints Solving System, Special Issue of IJAIT (International Journal on Artificial Intelligence Tools) 4 (1–2) (1995), pp. 93–113.

    Google Scholar 

  14. Older, W. and Vellino, A.: Constraint Arithmetic on Real Intervals, in: Benhamou, F. and Colmerauer, A. (eds), Constraint Logic Programming: Selected Research, MIT Press, 1993.

  15. Podelski, A. (ed.): Constraint Programming: Basics and Trends, LNCS 910, Springer Verlag, 1995, pp. 1–21 (Châtillon-sur-Seine Spring School, France, 1994).

    Google Scholar 

  16. PrologIA. PrologIV—Constraint Inside (Handbook of PrologIV), Parc Technologique de Luminy—Case 919, 13288 Marseille cedex 09, France, 1996.

  17. Refalo, P. and Van Hentenryck, P.: CLP(Rlin ) Revisited, in: Proc. JICSLP'96, MIT Press, 1996, pp. 22–36.

  18. Rueher, M.: An Architecture for Cooperating Constraint Solvers on Reals, in [15].

  19. Saraswat, V. A.: Concurrent Constraint Programming, MIT Press, 1993.

  20. Smolka, G.: An Oz Primer, DFKI Report, http://ps-www.dfki.uni-sb.de/oz/.

  21. Van Hentenryck, P., Mc Allester, D., and Kapur, D.: Solving Polynomial Systems Using Branch and Prune Approach, SIAM Journal, to appear.

  22. Van Hentenryck, P., Saraswat, V. A., and Deville, Y.: Design, Implementation, and Evaluation of the Constraint Language cc(FD), in [15].

  23. Waltz, D. L.: Generating Semantic Descriptions from Drawings of Scenes with Shadows, Tech. Report AI-TR-271, MIT Cambridge, 1972.

Download references

Author information

Authors and Affiliations

  1. Université de Nice-Sophia Antipolis, 13S, Route des colles BP 145, 06903, Sophia Antipolis, France

    Michel Rueher

  2. Université Lyon I, LISI, Bat. 710-43, bd du 11 novembre 1918, 69622, Villeurbanne Cedex, France

    Christine Solnon

Authors
  1. Michel Rueher
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christine Solnon
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rueher, M., Solnon, C. Concurrent Cooperating Solvers over Reals. Reliable Computing 3, 325–333 (1997). https://doi.org/10.1023/A:1009939327927

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1009939327927

Keywords

Search

Navigation