Skip to main content

Adaptive CHR Meets CHR ∨ 

An Extended Refined Operational Semantics for CHR ∨  Based on Justifications

  • Chapter

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

Abstract

Adaptive constraint processing with Constraint Handling Rules (CHR) allows the application of intelligent search strategies to solve Constraint Satisfaction Problems (CSP), but these search algorithms have to be implemented in the host language of adaptive CHR which is currently Java. On the other hand, CHR ∨  enables to explicitly formulate search in CHR, using disjunctive bodies to model choices. However, a naive implementation for handling disjunctions, in particular chronological backtracking (as implemented in Prolog), might cause “thrashing” due to an inappropriate order of decisions. In order to avoid this, a first combination of adaptive CHR and CHR ∨  is presented to offer a more efficient embedded search mechanism to handle disjunctions. Therefore, the refined operational semantics of CHR is extended for disjunctions and adaptation.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abdennadher, S., Schütz, H.: CHR\(^{\lor}\): A flexible query language. In: Andreasen, T., Christiansen, H., Larsen, H.L. (eds.) FQAS 1998. LNCS (LNAI), vol. 1495, pp. 1–14. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  2. Duck, G.J., García de la Banda, M., Stuckey, P.J., Holzbaur, C.: The refined operational semantics of constraint handling rules. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 90–104. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  3. Frühwirth, T., Di Pierro, A., Wiklicky, H.: Probabilistic constraint handling rules. Electronic Notes in Theoretical Computer Science 76, 1–16 (2002)

    Article  Google Scholar 

  4. Frühwirth, T.: Constraint Handling Rules. In: Podelski, A. (ed.) Constraint Programming: Basics and Trends. LNCS, vol. 910, pp. 90–107. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  5. Frühwirth, T.: Theory and practice of Constraint Handling Rules. The Journal of Logic Programming 37, 95–138 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  6. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Series of Books in the Mathematical Sciences. W. H. Freeman & Co., New York (1979)

    MATH  Google Scholar 

  7. Ginsberg, M.L.: Dynamic backtracking. Journal of Artificial Intelligence Research 1, 25–46 (1993)

    MATH  Google Scholar 

  8. Holzbaur, C., Frühwirth, T.: A Prolog Constraint Handling Rules compiler and runtime system. Applied Artificial Intelligence 14(4), 369–388 (2000)

    Article  Google Scholar 

  9. De Koninck, L., Schrijvers, T., Demoen, B.: Flexible search strategies in Prolog CHR. Report CW 447, Department of Computer Science, K. U. Leuven (May 2006); Also presented at the Workshop on CHR (2006)

    Google Scholar 

  10. De Koninck, L., Schrijvers, T., Demoen, B.: A Flexible Search Framework for CHR. In: Schrijvers, T., Frühwirth, T. (eds.) Constraint Handling Rules. LNCS (LNAI), vol. 5388, pp. 16–47. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Prosser, P.: Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence 9(3), 268–299 (1991); also available as technical report AISL-46-91, Stratchclyde (1991)

    Article  Google Scholar 

  12. The ROARS project (last visited February 25, 2008), http://www.cin.ufpe.br/~jr/mysite/RoarsProject.html

  13. Schrijvers, T., Frühwirth, T.: Optimal union-find in constraint handling rules. Theory and Practice of Logic Programming 6(1–2), 213–224 (2006)

    Article  MATH  Google Scholar 

  14. Sneyers, J., Schrijvers, T., Demoen, B.: The computational power and complexity of constraint handling rules. In: Schrijvers, T., Frühwirth, T. (eds.) Proceedings of CHR 2005, Second Workshop on Constraint Handling Rules, number CW 421 in CW Reports, pp. 3–17. Katholieke Universiteit Leuven, Department of Computer Science (2005) (last visited August 26, 2008), http://www.cs.kuleuven.be/publicaties/rapporten/cw/CW421.abs.html

  15. Wolf, A.: Projection in adaptive constraint solving based on chrs. In: Apt, K.R., Kakas, A.C., Monfroy, E., Rossi, F. (eds.) Proceedings of the ERCIM/COMPULOG Workshop on Constraints, Department of Computer Science, University of Cyprus, Nicosia, Cyprus (October 1999)

    Google Scholar 

  16. Wolf, A.: Adaptive constraint handling with CHR in Java. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 256–270. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  17. Wolf, A.: Intelligent search strategies based on adaptive constraint handling rules. Theory and Practice of Logic Programming 5(4–5), 567–594 (2005)

    Article  MATH  Google Scholar 

  18. Wolf, A., Gruenhagen, T., Geske, U.: On incremental adaptation of CHR derivations. Applied Artificial Intelligence 14(4), 389–416 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Wolf, A., Robin, J., Vitorino, J. (2008). Adaptive CHR Meets CHR ∨  . In: Schrijvers, T., Frühwirth, T. (eds) Constraint Handling Rules. Lecture Notes in Computer Science(), vol 5388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92243-8_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92243-8_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92242-1

  • Online ISBN: 978-3-540-92243-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics