Skip to main content

A Control Language for Designing Constraint Solvers

  • Conference paper
  • First Online:
Perspectives of System Informatics (PSI 1999)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1755))

Abstract

We propose a strategy language for designing single constraint solvers as well as their collaborations. Based on the notions of constraint filter, separator, and sorter, we define basic strategy operators that allow us to specify single solvers and their collaboration in a uniform way. We exemplify the use of this language by specifying some techniques for solving non-linear constraints over real numbers and CSPs over finite domains.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. K. R. Apt. The Essence of Constraint Propagation. Theoretical Computer Science, 221(1–2):179–210, 1999.

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  3. 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 

  4. C. Bessière and J.-C. Régin. An arc-consistency algorithm optimal in the number of constraint checks. In Proceedings of the Workshop on Constraint Processing, ECAI’94, pages 9–16, Amsterdam, The Netherlands, 1994.

    Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

  6. C. Castro. COLETTE, Prototyping CSP Solvers Using a Rule-Based Language. In J. Calmet and J. Plaza, editors, Proc. of AISC’98, volume 1476 of LNCS, pages 107–119, Plattsburgh, NY, USA, September 1998.

    Google Scholar 

  7. L. Granvilliers. Consistances locales et transformations symboliques de contraintes d’intervalles. Phd thesis, University of Orlans, France, 1998. In French.

    Google Scholar 

  8. A. K. Mackworth. Constraint Satisfaction. In S. C. Shapiro, editor, Encyclopedia of Artificial Intelligence, volume 1. Addison-Wesley Publishing Company, 1992.

    Google Scholar 

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

    Google Scholar 

  10. R. Mohr and T. C. Henderson. Arc and Path Consistency Revisited. Artificial Intelligence, 28:225–233, 1986.

    Article  Google Scholar 

  11. E. Monfroy. Collaboration de solveurs pour la programmation logique à contraintes. Thèse de Doctorat d’Université, Université Henri Poincaré-Nancy 1, France, November 1996. Also available in english. Available on-line at: http://www.cwi.nl/~eric/Private/Publications/index.html.

  12. E. Monfroy. An environment for designing/executing constraint solver collaborations. ENTCS, 16(1), 1998.

    Google Scholar 

  13. E. Monfroy. The Constraint Solver Collaboration Language of BALI. In Proc. of FroCoS’98, Amsterdam, The Netherlands, 1998. To appear in Logic and Computation Series, Research Studies Press Ltd.

    Google Scholar 

  14. E. Monfroy, M. Rusinowitch, and R. Schott. Implementing Non-Linear Constraints with Cooperative Solvers. In Proc. of ACM SAC’96, pages 63–72, Philadelphia, PA, USA, 1996. ACM Press.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  16. C. Ringeissen. Cooperation of decision procedures for the satisfiability problem. In F. Baader and K. Schulz, editors, Proc. of FroCoS’96, pages 121–139. Kluwer Academic Publishers, 1996.

    Google Scholar 

  17. G. Smolka. Problem Solving with Constraints and Programming. ACM Computing Surveys, 28(4es), December 1996. Electronic Section.

    Google Scholar 

  18. P. Van Hentenryck, D. McAllester, and D. Kapur. Solving polynomial systems using a branch and prune approach. SIAM Journ. on Num. Analysis, 34(2), 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Castro, C., Monfroy, E. (2000). A Control Language for Designing Constraint Solvers. In: Bjøner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 1999. Lecture Notes in Computer Science, vol 1755. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46562-6_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-46562-6_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46562-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics