Skip to main content

Rule Based Programming with Constraints and Strategies

  • Conference paper
  • First Online:
Book cover New Trends in Constraints (WC 1999)

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

Included in the following conference series:

  • 217 Accesses

Abstract

We present a framework for Rule Based Programming with Constraints and Strategies. It is implemented in the ELAN language, that provides an environment for specifying and prototyping deduction systems. The existence of strategies provides the user with the possibility to make choices, to act upon them, and to retract if needed using backtracking. To illustrate the framework, we formalise a planning problem, namely a controller for printing tasks, that shows how to combine rules, strategies and constraint solving on 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 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. J.M. Andreoli, U.M. Borghoff, S. Castellani, R. Pareschi, and G. Teege. Agent Based Decision Support for managing Print Tasks. In Proceedings of the PAAM’98, London, UK, 1998.

    Google Scholar 

  2. Peter Borovanský, Claude Kirchner, Héléne Kirchner, Pierre-Etienne Moreau, and Marian Vittek. ELAN: A logical framework based on computational systems. In José Meseguer, editor, Proceedings of the first international workshop on rewriting logic, volume 4 of Electronic Notes in TCS, Asilomar (California), September 1996.

    Google Scholar 

  3. P. Borovanský, C. Kirchner, H. Kirchner, P.-E. Moreau, and C. Ringeissen. An overview of ELAN. In Claude Kirchner and Héléne Kirchner, editors, Proceedings of the 2nd International Workshop on Rewriting Logic and its Applications, WRLA’98, volume 15, Pont-á-Mousson (France), September 1998. Electronic Notes in Theoretical Computer Science.

    Google Scholar 

  4. P. Borovanský, C. Kirchner, H. Kirchner, and Ch. Ringeissen. Rewriting with strategies in ELAN: a functional semantics. International Journal of Foundations of Computer Science, 1999.

    Google Scholar 

  5. Peter Borovanský. Le contrôle de la réécriture: étude et implantation d’un formalisme de stratégies. Thése de Doctorat d’Université, Université Henri Poincaré-Nancy 1, France, October 1998. also TR LORIA 98-T-326.

    Google Scholar 

  6. C. Castro. Une approche déductive de la résolution de problémes de satisfaction de contraintes. Thése de Doctorat d’Université, Université Henri Poincaré-Nancy 1, France, 1998.

    Google Scholar 

  7. Carlos Castro. Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies. Fundamenta Informaticae, 34:263–293, September 1998.

    Google Scholar 

  8. Yves Caseau and François Laburthe. CLAIRE: Combining objects and rules for problem solving. In Proceedings of the JICSLP’96 workshop on multi-paradigm logic programming, TU Berlin, Germany, 1996.

    Google Scholar 

  9. Francisco Durán and José Meseguer. An Extensible Module Algebra For Maude. In Proceedings of the Second International Workshop on Rewriting Logic and its Applications, Pont-á-Mousson, France, volume 15 of Electronic Notes in Theoretical Computer Science, September 1998.

    Google Scholar 

  10. F. Durán. A reflective module algebra with applications to the Maude language. PhD thesis, University of Malaga, Spain, June 1999.

    Google Scholar 

  11. Steven Eker. Associative-commutative matching via bipartite graph matching. Computer Journal, 38(5):381–399, 1995.

    Article  Google Scholar 

  12. Thom Frühwirth. Constraint Simplification Rules. Technical Report ECRC-92-18, ECRC Munich, Germany, July 1992. Revised version of Internal Report ECRC-LP-63, October 1991.

    Google Scholar 

  13. Thom Frühwirth. Constraint Solving with Constraint Handling Rules. In Proceedings of 12th International Symposium on Languages for Intensional Programming (ISLIP99), Athens, Greece, June 1999.

    Google Scholar 

  14. Thom Frühwirth. Termination of CHR Constraint Solvers. In this volume, 2000.

    Google Scholar 

  15. J. Giarratano and G. Riley. Expert Systems: Principles & Programming. PWS-KENT, 1989.

    Google Scholar 

  16. Frederick Hayes-Roth. Rule-based systems. Communications of the ACM, 28(9):921–932, September 1985.

    Google Scholar 

  17. Donald E. Knuth and P. B. Bendix. Simple word problems in universal algebras. In J. Leech, editor, Computational Problems in Abstract Algebra, pages 263–297. Pergamon Press, Oxford, 1970.

    Google Scholar 

  18. Claude Kirchner and Christophe Ringeissen. Rule-Based Constraint Programming. Fundamenta Informaticae, 34(3):225–262, September 1998.

    Google Scholar 

  19. B. Liu, J. Jaffar, and H.C. Yap. Constraint rule-based programming, 1999. http://www.iscs.nus.edu.sg/joxan/papers/crp.ps.

  20. Eric Monfroy. The Constraint Solver Collaboration Language of BALI In Dov Gabbay and Maarten de Rijke, editors, Frontiers of Combining Systems 2, Research Studies, pages 211–230. Wiley, 1999.

    Google Scholar 

  21. Greg Nelson and Derek C. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245–257, October 1979.

    Google Scholar 

  22. F. Pachet. NéOpus User’s Guide. Technical Report 91-14, LAFORIA-IBP, Paris, 1991.

    Google Scholar 

  23. Ch. Ringeissen. Cooperation of decision procedures for the satisfiability problem. In F. Baader and K.U. Schulz, editors, Frontiers of Combining Systems, First International Workshop, Munich (Germany), Applied Logic, pages 121–140. Kluwer Academic Publishers, March 1996.

    Google Scholar 

  24. M.-C. Rousset. On the Consistency of Knowledge Bases: The COVADIS System. In Proceedings of the 8th European Conference on Artificial Intelligence, pages 79–84, 1988.

    Google Scholar 

  25. ILOG SA. ILOG Rules-White Paper, March 1997.

    Google Scholar 

  26. G. Smolka. The Oz Programming Model. volume 1000 of Lecture Notes in Computer Science, pages 324–343, 1995.

    Google Scholar 

  27. James G. Schmolze and Wayne Snyder. A Tool for Testing Confluence of Production Rule Systems. In M. Ayel and M.-C. Rousset, editors, Proceedings of the European Symposium on the Validation and Verification of Knowledge-Based Systems. Université de Savoie, Chambéry, France, 1995.

    Google Scholar 

  28. Pascal Van Hentenryck. The OPL Optimization Programming Language. The MIT Press, Cambridge, MA, 1999.

    Google Scholar 

  29. D. Zhang and D. Nguyen. PREPARE: A Tool for Knowledge Base Verification. IEEE Transactions on Knowledge and Data Engineering, 6(6):983–989, December 1994.

    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

Dubois, H., Kirchner, H. (2000). Rule Based Programming with Constraints and Strategies. In: Apt, K.R., Monfroy, E., Kakas, A.C., Rossi, F. (eds) New Trends in Constraints. WC 1999. Lecture Notes in Computer Science(), vol 1865. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44654-0_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-44654-0_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67885-4

  • Online ISBN: 978-3-540-44654-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics