Skip to main content
SpringerLink
Log in

Basic Operators for Solving Constraints via Collaboration of Solvers

  • Conference paper
  • First Online:
Artificial Intelligence and Symbolic Computation (AISC 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1930))

Abstract

In this paper, we propose a strategy language for designing schemes of constraint solver collaborations: a set of strategy operators enables one to design several kinds of collaborations. We exemplify the use of this language by describing some well known techniques for solving constraints over finite domains and non-linear constraints over real numbers via collaboration of solvers.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Arbab and E. Monfroy. Heterogeneous distributed cooperative constraint solving using coordination. ACM Applied Computing Review, 6:4–17, 1999.

    Article  Google Scholar 

  2. F. Benhamou, F. Goualard, L. Granvilliers, and J. Puget. Revising Hull and Box Consistency. In Proc. of International Conference on Logic Programming, pages 230–244, Las Cruces, USA, 1999. The MIT Press.

    Google Scholar 

  3. F. Benhamou and L. Granvilliers. Combining Local Consistency, Symbolic Rewriting, and Interval Methods. In Proc. of AISMC3, volume 1138 of LNCS, pages 144–159, Steyr, Austria, 1996. Springer-Verlag.

    Google Scholar 

  4. H. Beringer and B. DeBacker. Combinatorial Problem Solving in Constraint Logic Programming with Cooperative Solvers. In C. Beierle and L. Plümer, editors, Logic Programming: Formal Methods and Practical Applications, Studies in Computer Science and Artificial Intelligence. North Holland, 1995.

    Google Scholar 

  5. A. Bockmayr and T. Kasper. A unifying framework for integer and finite domain constraint programming. Research Report MPI-I-97-2-008, Max Planck Institut für Informatik, Saarbrücken, Germany, Aug. 1997.

    Google Scholar 

  6. B. Buchberger. Gröbner Bases: an Algorithmic Method in Polynomial Ideal Theory. In N. K. Bose, editor, Multidimensional Systems Theory, pages 184–232. D. Reidel Publishing Company, Dordrecht-Boston-Lancaster, 1985.

    Google Scholar 

  7. C. Castro. Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies. Fundamenta Informaticae, 34(3):263–293, June 1998.

    MATH  MathSciNet  Google Scholar 

  8. C. Castro. COLETTE, Prototyping CSP Solvers Using a Rule-Based Language. In J. Calmet and J. Plaza, editors, Proc. of The Fourth International Conference on Artificial Intelligence and Symbolic Computation, AISC'98, volume 1476 of LNCS, pages 107–119, Plattsburgh, NY, USA, Sept. 1998. Springer-Verlag.

    Google Scholar 

  9. C. Castro and E. Monfroy. A Control Language for Designing Constraint Solvers. In Proc. of Third International Conference Perspective of System Informatics, PSI'99, volume 1755 of LNCS, pages 402–415, Novosibirsk, Russia, 2000. Springer-Verlag.

    Google Scholar 

  10. J.-C. Faugere. Résolution des syst`emes déquations alg´ebriques. PhD thesis, Université Paris 6, France, 1994.

    Google Scholar 

  11. T. Frühwirth. Constraint handling rules. In A. Podelski, editor, Constraint Programming: Basics and Trends, volume 910 of LNCS. Springer-Verlag, 1995.

    Google Scholar 

  12. K. Geddes, G. Gonnet, and B. Leong. Maple V: Language reference manual. Springer Verlag, New York, Berlin, Paris, 1991.

    Google Scholar 

  13. P. Marti and M. Rueher. A Distribuited Cooperating Constraints Solving System. International Journal of Artificial Intelligence Tools, 4(1-2):93–113, 1995.

    Google Scholar 

  14. M. Meier and J. Schimpf. ECLiPSe User Manual. Technical Report ECRC-93-6, ECRC (European Computer-industry Research Centre), Munich, Germany, 1993.

    Google Scholar 

  15. E. Monfroy. Collaboration de solveurs pour la programmation logique á contraintes. Phd thesis, Université Henri Poincaré-Nancy 1, France, Nov. 1996. Also available in english. On-line at: http://www.cwi.nl/~eric/Private/Publications/index.html.

  16. E. Monfroy. An environment for designing/executing constraint solver collaborations. ENTCS (Electronic Notes in Theoretical Computer Science), 16(1), 1998.

    Google Scholar 

  17. E. Monfroy. The Constraint Solver Collaboration Language of BALI. In D. Gabbay and M. de Rijke, editors, Frontiers of Combining Systems 2, volume 7 of Studies in Logic and Computation, pages 211–230. Research Studies Press/Wiley, 2000.

    Google Scholar 

  18. E. Monfroy, M. Rusinowitch, and R. Schott. Implementing Non-Linear Constraints with Cooperative Solvers. In K. M. George, J. H. Carroll, D. Oppenheim, and J. Hightower, editors, Proc. of ACM Symposium on Applied Computing (SAC'96), Philadelphia, PA, USA, pages 63–72. ACM Press, February 1996.

    Google Scholar 

  19. G. Nelson and D. C. Oppen. Simplifications by Cooperating Decision Procedures. ACM Trans. on Programming Languages and Systems, 1(2):245–257, Oct. 1979.

    Article  MATH  Google Scholar 

  20. C. Ringeissen. Cooperation of decision procedures for the satisfiability problem. In F. Baader and K. Schulz, editors, Proc. of First Int. Workshop Frontiers of Combining Systems, FroCoS'96, pages 121–139. Kluwer Academic Publishers, 1996.

    Google Scholar 

  21. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Informática, Universidad Técnica Federico Santa María, Avenida España 1680, Casilla 110-V, Valparaíso, Chile

    Carlos Castro

  2. Centrum voor Wiskunde en Informatica, CWI, P.O. Box 94079, NL-1090 GB, Amsterdam, The Netherlands

    Eric Monfroy

Authors
  1. Carlos Castro
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Eric Monfroy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University College London, Gower Street, WC1E 6BT, London, UK

    John A. Campbell

  2. Dept. Algebra, Fac. Educación, Universidad Complutense de Madrid, c/Rector Royo Villanova s/n, 28040, Madrid, Spain

    Eugenio Roanes-Lozano

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Castro, C., Monfroy, E. (2001). Basic Operators for Solving Constraints via Collaboration of Solvers. In: Campbell, J.A., Roanes-Lozano, E. (eds) Artificial Intelligence and Symbolic Computation. AISC 2000. Lecture Notes in Computer Science(), vol 1930. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44990-6_11

Download citation

  • DOI: https://doi.org/10.1007/3-540-44990-6_11

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42071-2

  • Online ISBN: 978-3-540-44990-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation