Skip to main content
SpringerLink
Log in

Constraint Handling Rules - What Else?

  • Conference paper
  • First Online:
Rule Technologies: Foundations, Tools, and Applications (RuleML 2015)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9202))

Abstract

Constraint Handling Rules (CHR) is both an effective concurrent declarative constraint-based programming language and a versatile computational formalism. While conceptually simple, CHR is distinguished by a remarkable combination of desirable features:

  • a semantic foundation in classical and linear logic,

  • an effective and efficient sequential and parallel execution model

  • guaranteed properties like the anytime online algorithm properties

  • powerful analysis methods for deciding essential program properties.

This overview of some CHR-related research and applications is by no means meant to be complete. Essential introductory reading for CHR provide the survey article [122] and the books [55, 62]. Up-to-date information on CHR can be found online at the CHR web-page www.constraint-handling-rules.org, including the slides of the keynote talk associated with this article. In addition, the CHR website dtai.cs.kuleuven.be/CHR/ offers everything you want to know about CHR, including online demo versions and free downloads of the language.

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. Fakhry, G., Sharaf, N., Abdennadher, S.: Towards the implementation of a source-to-source transformation tool for CHR operational semantics. In: Gupta, G., Peña, R. (eds.) LOPSTR 2013, LNCS 8901. LNCS, vol. 8901, pp. 145–163. Springer, Heidelberg (2014)

    Google Scholar 

  2. Abdennadher, S., Frühwirth, T.: On completion of constraint handling rules. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol. 1520, pp. 25–39. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  3. Abdennadher, S., Frühwirth, T.: Operational equivalence of CHR programs and constraints. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 43–57. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. Abdennadher, S., Frühwirth, T.: Integration and optimization of rule-based constraint solvers. In: Bruynooghe, M. (ed.) LOPSTR 2004. LNCS, vol. 3018, pp. 198–213. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  5. Abdennadher, S., Frühwirth, T., Meuss, H.: Confluence and Semantics of Constraint Simplification Rules. Constraints 4(2), 133–165 (1999)

    Article  MathSciNet  Google Scholar 

  6. Abdennadher, S., Marte, M.: University course timetabling using constraint handling rules. In: Holzbaur, C., Frühwirth, T. (eds.) Special Issue on Constraint Handling Rules, vol. 14(4), pp. 311–325. Taylor & Francis, London (2000). Journal of Applied Artificial Intelligence

    Google Scholar 

  7. Abdennadher, S., Rigotti, C.: Automatic generation of rule-based constraint solvers over finite domains. ACM TOCL 5(2), 177–205 (2004)

    Article  MathSciNet  Google Scholar 

  8. Abdennadher, S., Rigotti, C.: Automatic generation of chr constraint solvers. Theory Pract. Log. Program. 5(4–5), 403–418 (2005)

    Article  Google Scholar 

  9. Abdennadher, S., Saft, M., Will, S.: Classroom assignment using constraint logic programming. In: Proc. 2nd Intl. Conf. and Exhibition on Practical Application of Constraint Technologies and Logic Programming, PACLP 2000, April 2000

    Google Scholar 

  10. Abdennadher, S., Schütz, H.: CHR \(^\vee \): 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 

  11. Aichernig, B.K.: A systematic introduction to mutation testing in unifying theories of programming. In: Borba, P., Cavalcanti, A., Sampaio, A., Woodcook, J. (eds.) PSSE 2007. LNCS, vol. 6153, pp. 243–287. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  12. Albert, E., García de la Banda, M.J., Gómez-Zamalloa, M., Rojas, J.M., Stuckey, P.J.: A CLP heap solver for test case generation. TPLP 13(4–5), 721–735 (2013). Cambridge University Press

    Google Scholar 

  13. Alberti, M., Chesani, F., Gavanelli, M., Lamma, E., Mello, P., Torroni, P.: Verifiable agent interaction in abductive logic programming: the sciff framework. ACM Transactions on Computational Logic (TOCL) 9(4), 29 (2008)

    Article  MathSciNet  Google Scholar 

  14. Alberti, M., Daolio, D., Torroni, P., Gavanelli, M., Lamma, E., Mello, P.: Specification and verification of agent interaction protocols in a logic-based system. In: 2004 ACM Symposium on Applied Computing, pp. 72–78. ACM (2004)

    Google Scholar 

  15. Alberti, M., Gavanelli, M., Lamma, E.: The CHR-based implementation of the sciff abductive system. Fundamenta Informaticae 124(4), 365–381 (2013)

    MathSciNet  Google Scholar 

  16. Badea, L., Tilivea, D., Hotaran, A.: Semantic web reasoning for ontology-based integration of resources. In: Ohlbach, H.J., Schaffert, S. (eds.) PPSWR 2004. LNCS, vol. 3208, pp. 61–75. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  17. Baryannis, G., Plexousakis, D.: Fluent calculus-based semantic web service composition and verification using WSSL. In: Lomuscio, A.R., Nepal, S., Patrizi, F., Benatallah, B., Brandić, I. (eds.) ICSOC 2013. LNCS, vol. 8377, pp. 256–270. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  18. Betz, H.: Relating coloured petri nets to constraint handling rules. In: Fourth Workshop on Constraint Handling Rules, pp. 32–46 (2007)

    Google Scholar 

  19. Betz, H.: A Unified Analytical Foundation for Constraint Handling Rules. BoD-Books on Demand (2014)

    Google Scholar 

  20. Betz, H., Frühwirth, T.: Linear-logic based analysis of Constraint Handling Rules with disjunction. ACM Transactions on Computational Logic (TOCL) 14(1), 1 (2013)

    Article  Google Scholar 

  21. Betz, H., Raiser, F., Frühwirth, T.: A complete and terminating execution model for constraint handling rules. In: Hermenegildo and Schaub [81], pp. 597–610

    Google Scholar 

  22. Bistarelli, S., Frühwirth, T., Marte, M., Rossi, F.: Soft constraint propagation and solving in Constraint Handling Rules. Computational Intelligence: Special Issue on Preferences in AI and CP 20(2), 287–307 (2004)

    Article  Google Scholar 

  23. Bistarelli, S., Martinelli, F., Santini, F.: A formal framework for trust policy negotiation in autonomic systems: abduction with soft constraints. In: Xie, B., Branke, J., Sadjadi, S.M., Zhang, D., Zhou, X. (eds.) ATC 2010. LNCS, vol. 6407, pp. 268–282. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  24. Bistarelli, S., Martinelli, F., Santini, F.: A semiring-based framework for the deduction/abduction reasoning in access control with weighted credentials. Computers & Mathematics with Applications 64(4), 447–462 (2012)

    Article  MathSciNet  Google Scholar 

  25. Büttner, F., Cabot, J.: Lightweight string reasoning for OCL. In: Vallecillo, A., Tolvanen, J.-P., Kindler, E., Störrle, H., Kolovos, D. (eds.) ECMFA 2012. LNCS, vol. 7349, pp. 244–258. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  26. Chen, R., Liao, L., Fang, Z.: Contracting of web services with constraint handling rules. In: 2012 IEEE Eighth World Congress on Services (SERVICES), pp. 211–218 (2012)

    Google Scholar 

  27. Chin, W.-N., Craciun, F., Khoo, S.-C., Popeea, C.: A flow-based approach for variant parametric types. In: 21st annual ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages, and Applications, pp. 273–290. ACM (2006)

    Google Scholar 

  28. Christiansen, H.: Chr grammars. Theory and Practice of Logic Programming 5(4–5), 467–501 (2005)

    Article  MathSciNet  Google Scholar 

  29. Christiansen, H.: Implementing probabilistic abductive logic programming with constraint handling rules. In: Schrijvers, T., Frühwirth, T. (eds.) Constraint Handling Rules. LNCS, vol. 5388, pp. 85–118. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  30. Christiansen, H., Dahl, V.: HYPROLOG: a new logic programming language with assumptions andabduction. In: Gabbrielli and Gupta [63], pp. 159–173

    Google Scholar 

  31. Christiansen, H., Kirkeby, M.H.: Confluence modulo equivalence in Constraint Handling Rules. [90]

    Google Scholar 

  32. Cruz, F., Rocha, R.: On compiling linear logic programs with comprehensions, aggregates and rule priorities. In: Pontelli, E., Son, T.C. (eds.) PADL 2015. LNCS, vol. 9131, pp. 34–49. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  33. De Koninck, L.: Logical Algorithms meets CHR: A meta-complexity result for Constraint Handling Rules with rule priorities. TPLP 9(2), 165–212 (2009)

    Google Scholar 

  34. De Koninck, L., Schrijvers, T., Demoen, B.: Search strategies in CHR(Prolog). In: Schrijvers and Frühwirth [110], pp. 109–124

    Google Scholar 

  35. De Koninck, L., Schrijvers, T., Demoen, B.: Chr\(^{\rm rp}\): Constraint Handling Rules with rule priorties. Technical Report CW 479, K.U.Leuven, Dept. Comp. Sc., Leuven, Belgium, March 2007

    Google Scholar 

  36. Degrave, F., Schrijvers, T., Vanhoof, W.: Automatic generation of test inputs for mercury. In: Hanus, M. (ed.) LOPSTR 2008. LNCS, vol. 5438, pp. 71–86. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  37. Di Giusto, C., Gabbrielli, M., Meo, M.C.: Expressiveness of multiple heads in CHR. In: Nielsen, M., Kučera, A., Miltersen, P.B., Palamidessi, C., Tůma, P., Valencia, F. (eds.) SOFSEM 2009. LNCS, vol. 5404, pp. 205–216. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  38. Djelloul, K., Duck, G.J., Sulzmann, M. (eds.) Proc. 4th Workshop on Constraint Handling Rules, CHR 2007, September 2007

    Google Scholar 

  39. Duck, G.J.: SMCHR: Satisfiability modulo Constraint Handling Rules. CoRR, abs/1210.5307 (2012)

    Google Scholar 

  40. Duck, G.J., Haemmerlé, R., Sulzmann, M.: On termination, confluence and consistent CHR-based type inference. TPLP 14(4–5), 619–632 (2014)

    Google Scholar 

  41. Duck, G.J., Jaffar, J., Koh, N.C.H.: Constraint-based program reasoning with heaps and separation. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 282–298. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  42. Duck, G.J., Koninck, L.D., Stuckey, P.J.: Cadmium: an implementation of ACD term rewriting. In: García de la Banda and Pontelli [70], pp. 531–545

    Google Scholar 

  43. Duck, G.J., Stuckey, P.J., García de la Banda, M., 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 

  44. Duck, G.J., Stuckey, P.J., Sulzmann, M.: Observable confluence for constraint handling rules. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 224–239. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  45. Escrig, M., Toledo, F.: Qualitative Spatial Reasoning: Theory and Practice. IOS Press (1998)

    Google Scholar 

  46. Fink, M., Tompits, H., Woltran, S. (eds.) Proc. 20th Workshop on Logic Programming, WLP 2006, T.U.Wien, Austria, INFSYS Research report 1843–06-02, February 2006

    Google Scholar 

  47. Frühwirth, T.: Theory and practice of Constraint Handling Rules. J. Logic Programming, Special Issue on Constraint Logic Programming 37(1–3), 95–138 (1998)

    Google Scholar 

  48. Frühwirth, T.: Proving termination of constraint solver programs. In: Apt, K.R., Kakas, A.C., Monfroy, E., Rossi, F. (eds.) Compulog Net WS 1999. LNCS (LNAI), vol. 1865, pp. 298–317. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  49. Frühwirth, T.: As time goes by: automatic complexity analysis of simplification rules. In: Eighth International Conference on Principles of Knowledge Representation and Reasoning, San Francisco, CA, USA. Morgan Kaufmann (2002)

    Google Scholar 

  50. Frühwirth, T.: As Time Goes By II: More Automatic Complexity Analysis of Concurrent Rule Programs. ENTCS 59(3), 185–206 (2002)

    Google Scholar 

  51. Frühwirth, T.: Parallelizing union-find in constraint handling rules using confluence. In: Gabbrielli and Gupta [63], pp. 113–127

    Google Scholar 

  52. Frühwirth, T.: Specialization of concurrent guarded multi-set transformation rules. In: Etalle, S. (ed.) LOPSTR 2004. LNCS, vol. 3573, pp. 133–148. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  53. Frühwirth, T.: Quasi-linear-time algorithms by generalisation of union-find in CHR. In: Fages, F., Rossi, F., Soliman, S. (eds.) CSCLP 2007. LNCS (LNAI), vol. 5129, pp. 91–108. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  54. Frühwirth, T.: Welcome to constraint handling rules. In: Schrijvers and Frühwirth [112], pp. 1–15

    Google Scholar 

  55. Frühwirth, T.: Constraint Handling Rules. Cambridge University Press (2009)

    Google Scholar 

  56. Frühwirth, T.: A devil’s advocate against termination of direct recursion. In: 17th International Symposium on Principles and Practice of Declarative Programming, PPDP 2015, Siena, Italy, 2015. ACM (2015)

    Google Scholar 

  57. Frühwirth, T., Abdennadher, S.: The Munich rent advisor: A success for logic programming on the internet. TPLP 1(3), 303–319 (2001)

    Google Scholar 

  58. Frühwirth, T., Abdennadher, S.: Essentials of Constraint Programming. Springer (2003)

    Google Scholar 

  59. Frühwirth, T., Brisset, P.: Placing base stations in wireless indoor communication networks. IEEE Intelligent Systems and Their Applications 15(1), 49–53 (2000)

    Article  Google Scholar 

  60. Frühwirth, T., di Pierro, A., Wiklicky, H.: Probabilistic constraint handlingrules. In: 11th International Workshop on Functional and (Constraint) Logic Programming. ENTCS, vol. 76, pp. 115–130 (2002)

    Google Scholar 

  61. Frühwirth, T., Holzbaur, C.: Source-to-source transformation for a class of expressive rules. In: Buccafurri, F. (ed.) Joint Conf. Declarative Programming APPIA-GULP-PRODE, AGP 2003, pp. 386–397, September 2003

    Google Scholar 

  62. Frühwirth, T., Raiser, F. (eds.) Constraint Handling Rules: Compilation, Execution, and Analysis. BOD (2011)

    Google Scholar 

  63. Gabbrielli, M., Gupta, G. (eds.): ICLP 2005. LNCS, vol. 3668. Springer, Heidelberg (2005)

    Google Scholar 

  64. Gabbrielli, M., Mauro, J., Meo, M.C.: The expressive power of CHR with priorities. Inf. Comput. 228, 62–82 (2013)

    Article  MathSciNet  Google Scholar 

  65. Gabbrielli, M., Mauro, J., Meo, M.C., Sneyers, J.: Decidability properties for fragments of CHR. In: Hermenegildo and Schaub [81], pp. 611–626

    Google Scholar 

  66. Gabbrielli, M., Meo, M.C.: A compositional semantics for CHR. ACM TOCL 10(2), 1–36 (2009)

    Article  MathSciNet  Google Scholar 

  67. Gabbrielli, M., Meo, M.C., Tacchella, P., Wiklicky, H.: Unfolding for CHR programs. Theory and Practice of Logic Programming, 1–48 (2013)

    Google Scholar 

  68. Gall, D., Frühwirth, T.: A formal semantics for the cognitive architecture ACT-R. [90]

    Google Scholar 

  69. Gall, D., Frühwirth, T.: A refined operational semantics for ACT-R. In: 17th International Symposium on Principles and Practice of Declarative Programming, PPDP 2015, Siena, Italy, 2015. ACM (2015)

    Google Scholar 

  70. Garcia de la Banda, M., Pontelli, E. (eds.): ICLP 2008. LNCS, vol. 5366. Springer, Heidelberg (2008)

    Google Scholar 

  71. Gavanelli, M., Alberti, M., Lamma, E.: Integrating abduction and constraint optimization in constraint handling rules. In: 18th European Conf. on Artif. Intell., ECAI 2008, pp. 903–904. IOS press, July 2008

    Google Scholar 

  72. Geiselhart, F., Raiser, F., Sneyers, J., Frühwirth, T.: MTSeq - multi-touch-enabled music generation and manipulation based on CHR. In: Van Weert and De Koninck [131]

    Google Scholar 

  73. Gerlich, R.: Generic and extensible automatic test data generation for safety critical software with CHR. In: Van Weert and De Koninck [131]

    Google Scholar 

  74. Gerlich, R.: Automatic test data generation and model checking with CHR. arXiv preprint arXiv:1406.2122 (2014)

  75. Geurts, J., Ossenbruggen, J.V., Hardman, L.: Application-specific constraints for multimedia presentation generation. In: 8th International Conference on Multimedia Modeling, pp. 247–266 (2001)

    Google Scholar 

  76. Gouraud, S.-D., Gotlieb, A.: Using CHRs to generate functional test cases for the Java card virtual machine. In: Van Hentenryck, P. (ed.) PADL 2006. LNCS, vol. 3819, pp. 1–15. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  77. Green, T.J., Aref, M., Karvounarakis, G.: LogicBlox, platform and language: a tutorial. In: Barceló, P., Pichler, R. (eds.) Datalog 2.0 2012. LNCS, vol. 7494, pp. 1–8. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  78. Haemmerlé, R.: (Co-)Inductive semantics for Constraint Handling Rules. TPLP 11(4–5), 593–609 (2011). Cambridge University Press

    Google Scholar 

  79. Haemmerlé, R.: Diagrammatic confluence for Constraint Handling Rules. Theory Pract. Log. Program. 12(4–5), 737–753 (2012)

    Article  MathSciNet  Google Scholar 

  80. Haemmerlé, R., Lopez-Garcia, P., Hermenegildo, M.: CLP projection for constraint handling rules. In: Hanus, M. (ed.), PPDP 2011, pp. 137–148. ACM Press, July 2011

    Google Scholar 

  81. Hermenegildo, M., Schaub, T. (eds.) Proc. 26th Intl. Conf. Logic Programming, ICLP 2010. TPLP, vol. 10(4–6). Cambridge University Press, July 2010

    Google Scholar 

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

    Article  Google Scholar 

  83. Holzbaur, C., García de la Banda, M., Stuckey, P.J., Duck, G.J.: Optimizing compilation of Constraint Handling Rules in HAL. Theory and Practice of Logic Programming 5(4–5), 503–531 (2005). Cambridge University Press

    Article  Google Scholar 

  84. De Koninck, L., Schrijvers, T., Demoen, B.: The correspondence between the logical algorithms language and CHR. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 209–223. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  85. Lam, E., Sulzmann, M.: Parallel execution of multi-set constraint rewrite rules. In: Tenth International ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming. ACM (2008)

    Google Scholar 

  86. Lam, E.S., Sulzmann, M.: Concurrent goal-based execution of Constraint Handling Rules. TPLP 11, 841–879 (2009)

    MathSciNet  Google Scholar 

  87. Lam, E.S.L., Cervesato, I., Fatima, N.: Comingle: distributed logic programming for decentralized mobile ensembles. In: Holvoet, T., Viroli, M. (eds.) COORDINATION 2015. LNCS, vol. 9037, pp. 51–66. Springer, Heidelberg (2015)

    Google Scholar 

  88. Langbein, J., Stelzer, R., Frühwirth, T.: A rule-based approach to long-term routing for autonomous sailboats. In: Schlaefer, A., Blaurock, O. (eds.) Robotic Sailing. Non-series, vol. 79, pp. 195–204. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  89. Martınez-Martın, E., Escrig, M.T., del Pobil, A.P.: A general qualitative spatio-temporal model based on intervals. Journal of Universal Computer Science 18(10), 1343–1378 (2012)

    MathSciNet  Google Scholar 

  90. Proietti, M., Seki, H. (eds.): LOPSTR 2014. LNCS, vol. 8981. Springer, Heidelberg (2015)

    Google Scholar 

  91. Mauro, J.: Constraints Meet Concurrency. Springer (2014)

    Google Scholar 

  92. Meister, M.: Fine-grained parallel implementation of the preflow-push algorithm in CHR. In: Fink et al. [46], pp. 172–181

    Google Scholar 

  93. Meister, M., Frühwirth, T.: Reconstructing almost-linear tree equation solving algorithms in CHR. In: Proceedings of CSCLP 2007: Annual ERCIM Workshop on Constraint Solving and Constraint Logic Programming, p. 123 (2007)

    Google Scholar 

  94. Montali, M., Torroni, P., Chesani, F., Mello, P., Alberti, M., Lamma, E.: Abductive logic programming as an effective technology for the static verification of declarative business processes. Fundamenta Informaticae 102(3), 325–361 (2010)

    MathSciNet  Google Scholar 

  95. Pettorossi, A., Fioravanti, F., Proietti, M., De Angelis, E.: Program verification using constraint handling rules and array constraint generalizations. In: Second International Workshop on Verification and Program Transformation, VPT 2014, July 17–18, 2014, Vienna, Austria, vol. 28, pp. 3–18. EasyChair (2014)

    Google Scholar 

  96. Pilozzi, P., De Schreye, D.: Automating termination proofs for CHR. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 504–508. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  97. Pilozzi, P., De Schreye, D.: Improved termination analysis of CHR using self-sustainability analysis. In: Vidal, G. (ed.) LOPSTR 2011. LNCS, vol. 7225, pp. 189–204. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  98. Pretschner, A., Lötzbeyer, H., Philipps, J.: Model based testing in incremental system development. Journal of Systems and Software 70(3), 315–329 (2004)

    Article  Google Scholar 

  99. Raiser, F.: Graph transformation systems in CHR. In: Dahl, V., Niemelä, I. (eds.) ICLP 2007. LNCS, vol. 4670, pp. 240–254. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  100. Raiser, F.: Semi-automatic generation of CHR solvers for global constraints. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 588–592. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  101. Raiser, F., Betz, H., Frühwirth, T.: Equivalence of CHR states revisited. In: Raiser, F., Sneyers, J. (eds.), CHR 2009, pp. 33–48. K.U.Leuven, Dept. Comp. Sc., Technical report CW 555, July 2009

    Google Scholar 

  102. Raiser, F., Frühwirth, T.: Towards term rewriting systems in constraint handling rules. In: Schrijvers, T., Raiser, F., Frühwirth, T. (eds.) CHR 2008, pp. 19–34. RISC Report Series 08–10, University of Linz, Austria (2008)

    Google Scholar 

  103. Raiser, F., Frühwirth, T.: Exhaustive parallel rewriting with multiple removals. In: Abdennadher, S. (ed.) WLP 2010, September 2010

    Google Scholar 

  104. Raiser, F., Tacchella, P.: On confluence of non-terminating CHR programs. In: Djelloul et al. [38], pp. 63–76

    Google Scholar 

  105. Salomie, I., Chifu, V., Harsa, I., Gherga, M.: Web service composition using fluent calculus. International Journal of Metadata, Semantics and Ontologies 5(3), 238–250 (2010)

    Article  Google Scholar 

  106. Sarna-Starosta, B., Ramakrishnan, C.R.: Compiling constraint handling rules for efficient tabled evaluation. In: Hanus, M. (ed.) PADL 2007. LNCS, vol. 4354, pp. 170–184. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  107. Sarna-Starosta, B., Stirewalt, R.E.K., Dillon, L.K.: A model-based design-for-verification approach to checking for deadlock in multi-threaded applications. Intl. Journal of Softw. Engin. and Knowl. Engin. 17(2), 207–230 (2007)

    Article  Google Scholar 

  108. Schiffel, S., Thielscher, M.: Fluxplayer: a successful general game player. In: 22nd Conference on Artificial Intelligence, pp. 1191–1196. AAAI Press (2007)

    Google Scholar 

  109. Schrijvers, T., Bruynooghe, M.: Polymorphic algebraic data type reconstruction. In: Eighth ACM SIGPLAN International Conference on Principles and Practice of Declarative Programming, pp. 85–96. ACM (2006)

    Google Scholar 

  110. Schrijvers, T., Frühwirth, T. (eds.) Proc. 3rd Workshop on Constraint Handling Rules, CHR 2006. K.U.Leuven, Dept. Comp. Sc., Technical report CW 452, July 2006

    Google Scholar 

  111. Schrijvers, T., Frühwirth, T.: Optimal union-find in Constraint Handling Rules. TPLP 6(1–2), 213–224 (2006)

    Google Scholar 

  112. Schrijvers, T., Frühwirth, T. (eds.): Constraint Handling Rules. LNCS, vol. 5388. Springer, Heidelberg (2008)

    Google Scholar 

  113. Schrijvers, T., Sulzmann, M.: Transactions in constraint handling rules. In: García de la Banda and Pontelli [70], pp. 516–530

    Google Scholar 

  114. Seitz, C., Bauer, B., Berger, M.: Multi agent systems using constraint handling rules for problem solving. In: International Conference on Artificial Intelligence, pp. 295–301. CSREA Press (2002)

    Google Scholar 

  115. Sneyers, J.: Turing-complete subclasses of CHR. In: García de la Banda and Pontelli [70], pp. 759–763

    Google Scholar 

  116. Sneyers, J., De Schreye, D.: APOPCALEAPS: automatic music generation with CHRiSM. In: Danoy, G. et al., (eds.) 22nd Benelux Conference on Artificial Intelligence (BNAIC 2010), Luxembourg, October 2010

    Google Scholar 

  117. Sneyers, J., De Schreye, D., Frühwirth, T.: Probabilistic legal reasoning in CHRiSM. Theory and Practice of Logic Programming 13(4–5), 769–781 (2013)

    Article  MathSciNet  Google Scholar 

  118. Sneyers, J., Meert, W., Vennekens, J., Kameya, Y., Sato, T.: Chr (PRISM)-based probabilistic logic learning. Theory and Practice of Logic Programming 10(4–6), 433–447 (2010)

    Article  MathSciNet  Google Scholar 

  119. Sneyers, J., Schrijvers, T., Demoen, B.: Dijkstra’s algorithm with Fibonacci heaps: an executable description in CHR. In: Fink et al. [46], pp. 182–191

    Google Scholar 

  120. Sneyers, J., Schrijvers, T., Demoen, B.: The computational power and complexity of Constraint Handling Rules. ACM TOPLAS 31(2), February 2009

    Google Scholar 

  121. Sneyers, J., Van Weert, P., Schrijvers, T.: Aggregates for constraint handling rules. In: Djelloul et al. [38], pp. 91–105

    Google Scholar 

  122. Sneyers, J., Van Weert, P., Schrijvers, T., De Koninck, L.: As time goes by: Constraint Handling Rules - A survey of CHR research between 1998 and 2007. TPLP 10(1), 1–47 (2010)

    Google Scholar 

  123. Sobhi, I., Abdennadher, S., Betz, H.: Constructing rule-based solvers for intentionally-defined constraints. In: Schrijvers and Frühwirth [112], pp. 70–84

    Google Scholar 

  124. Stuckey, P.J., Sulzmann, M.: A Theory of Overloading. ACM Transactions on Programming Languages and Systems 27(6), 1216–1269 (2005)

    Article  Google Scholar 

  125. Sulzmann, M., Duck, G.J., Peyton-Jones, S., Stuckey, P.J.: Understanding functional dependencies via Constraint Handling Rules. J. Functional Prog. 17(1), 83–129 (2007)

    Article  Google Scholar 

  126. Thielscher, M.: FLUX: A Logic Programming Method for Reasoning Agents. Theory and Practice of Logic Programming 5, 533–565 (2005)

    Article  Google Scholar 

  127. Thielscher, M.: Reasoning robots: the art and science of programming robotic agents, vol. 33. Springer Science & Business Media (2006)

    Google Scholar 

  128. Triossi, A., Orlando, S., Raffaetà, A., Frühwirth, T.: Compiling chr to parallel hardware. In: Proceedings of the 14th symposium on Principles and practice of declarative programming, pp. 173–184. ACM (2012)

    Google Scholar 

  129. Van Weert, P.: Compiling Constraint Handling Rules to Java: A reconstruction. Technical Report CW 521, K.U.Leuven, Dept. Comp. Sc., Leuven, Belgium, August 2008

    Google Scholar 

  130. Van Weert, P.: Efficient lazy evaluation of rule-based programs. IEEE Transactions on Knowledge and Data Engineering 22(11), 1521–1534 (2010)

    Article  Google Scholar 

  131. Van Weert, P., De Koninck, L. (eds.) Proc. 7th Workshop on Constraint Handling Rules, CHR 2010. K.U.Leuven, Dept. Comp. Sc., Technical report CW 588, July 2010

    Google Scholar 

  132. Van Weert, P., Sneyers, J., Schrijvers, T., Demoen, B.: Extending CHR with negation as absence. In: Schrijvers and Frühwirth [110], pp. 125–140

    Google Scholar 

  133. Van Weert, P., Wuille, P., Schrijvers, T., Demoen, B.: CHR for imperative host languages. In: Schrijvers and Frühwirth [112], pp. 161–212

    Google Scholar 

  134. Wolf, A.: Intelligent search strategies based on adaptive Constraint Handling Rules. Theory and Practice of Logic Programming 5(4–5), 567–594 (2005)

    Article  Google Scholar 

  135. Wolf, A., Robin, J., Vitorino, J.: Adaptive CHR meets CHR\(^\vee \): an extended refined operational semantics for CHR\(^\vee \) based on justifications. In: Schrijvers and Frühwirth [112], pp. 48–69

    Google Scholar 

  136. Wuille, P., Schrijvers, T., Demoen, B.: CCHR: the fastest CHR implementation. In: Djelloul, C. et al. [38], pp. 123–137

    Google Scholar 

  137. Zaki, A., Frühwirth, T., Geller, I.: Parallel execution of constraint handling rules on a graphical processing unit. In: Sneyers, J., Frühwirth, T. (eds.) CHR 2012, pp. 82–90. K.U.Leuven, Dept. Comp. Sc., Technical report CW 624, September 2012

    Google Scholar 

  138. Zhu, H., Madnick, S.E., Siegel, M.D.: Enabling global price comparison through semantic integration of web data. IJEB 6(4), 319–341 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Ulm, Ulm, Germany

    Thom Frühwirth

Authors
  1. Thom Frühwirth
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Thom Frühwirth .

Editor information

Editors and Affiliations

  1. Aristotle University of Thessaloniki, Thessaloniki, Greece

    Nick Bassiliades

  2. University of Oxford, Oxford, United Kingdom

    Georg Gottlob

  3. Imperial College London, London, United Kingdom

    Fariba Sadri

  4. Freie Universität Berlin, Berlin, Germany

    Adrian Paschke

  5. SINTEF/University of Oslo, Oslo, Norway

    Dumitru Roman

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Frühwirth, T. (2015). Constraint Handling Rules - What Else?. In: Bassiliades, N., Gottlob, G., Sadri, F., Paschke, A., Roman, D. (eds) Rule Technologies: Foundations, Tools, and Applications. RuleML 2015. Lecture Notes in Computer Science(), vol 9202. Springer, Cham. https://doi.org/10.1007/978-3-319-21542-6_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-21542-6_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-21541-9

  • Online ISBN: 978-3-319-21542-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation