×

zbMATH — the first resource for mathematics

As time goes by: constraint handling rules. (English) Zbl 1186.68096
Summary: Constraint Handling Rules is a high-level programming language based on multiheaded multiset rewrite rules. Originally designed for writing user-defined constraint solvers, it is now recognized as an elegant general purpose language. Constraint Handling Rules related research has surged during the decade following the previous survey by T. Frühwirth [J. Log. Program. 37, No. 1–3, 95–138 (1998; Zbl 0920.68029)]. Covering more than 180 publications, this new survey provides an overview of recent results in a wide range of research areas, from semantics and analysis to systems, extensions, and applications.

MSC:
68N15 Theory of programming languages
68N17 Logic programming
Software:
HYPROLOG
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] DOI: 10.1017/S1471068405002541 · Zbl 1109.68029 · doi:10.1017/S1471068405002541
[2] Schrijvers, CHR ’06: Proc. 3rd Workshop on Constraint Handling Rules (2006)
[3] Schrijvers, CHR ’05: Proc. 2nd Workshop on Constraint Handling Rules (2005)
[4] Schrijvers, RULE ’05: 6th Intl. Workshop on Rule-Based Programming pp 93– (2006)
[5] Dahl, NLUCS ’04: Proc. First Intl. Workshop on Natural Language Understanding and Cognitive Sciences (2004)
[6] Dahl, ICLP ’07: Proc. 23rd Intl. Conf. Logic Programming (2007)
[7] Dahl, CSLP ’04: Proc. First Intl. Workshop on Constraint Solving and Language Processing pp 17– (2004)
[8] Schrijvers, Antimonotony-based delay avoidance for CHR (2004)
[9] DOI: 10.1145/1140335.1140347 · doi:10.1145/1140335.1140347
[10] Schmauss, An implementation of CHR in Java (1999)
[11] Schiffel, AAAI ’07: Proc. 22nd AAAI Conf. Artificial Intelligence pp 1191– (2007)
[12] Sarna-Starosta, Indexing Techniques for CHR Based on Program Transformation (2007)
[13] Robin, Journal of Universal Computer System 13 pp 701– (2007)
[14] Coquery, WLPE ’03 pp 17– (2003)
[15] Christiansen, CONTEXT ’05: Proc. 4th Intl. and Interdisciplinary Conf. Modeling and Using Context pp 97– (2005)
[16] DOI: 10.1142/S0218213003001216 · Zbl 05421377 · doi:10.1142/S0218213003001216
[17] Christiansen, CLIMA ’06: 7th Intl. Workshop on Computational Logic in Multi-Agent Systems – Revised, Selected and Invited Papers pp 226– (2006)
[18] DOI: 10.1145/1167515.1167498 · doi:10.1145/1167515.1167498
[19] DOI: 10.1007/s10009-003-0128-3 · Zbl 02243212 · doi:10.1007/s10009-003-0128-3
[20] Wolf, W(C)LP ’05: Proc. 19th Workshop on (Constraint) Logic Programming (2005)
[21] Morawietz, COLING ’00: Proc. 18th Intl. Conf. on Computational Linguistics (2000)
[22] Wolf, Proc. 14th Intl. Conf. Applications of Prolog pp 211– (2001)
[23] Wolf, CP ’01 pp 256– (2001)
[24] Wolf, New Trends in Constraints, Joint ERCIM/Compulog Net Workshop, October 1999, Selected papers pp 318– (2000)
[25] Cabedo, Journal of Universal Computer Science 9 pp 1096– (2003)
[26] DOI: 10.1007/BFb0055992 · doi:10.1007/BFb0055992
[27] Brand, RULE ’03: 4th Intl. Workshop on Rule-Based Programming pp 45– (2003)
[28] Brand, Joint ERCIM/CologNet Intl. Workshop on Constraint Solving and Constraint Logic Programming, Selected papers pp 279– (2002)
[29] Boespflug, The Monad. Reader 9 pp 17– (2007)
[30] Frühwirth, WFLP ’02: Proc. 11th Intl. Workshop on Functional and (Constraint) Logic Programming, Selected Papers (2002)
[31] Bistarelli, Computational Intelligence: Special Issue on Preferences in AI and CP 20 pp 287– (2004) · doi:10.1111/j.0824-7935.2004.00239.x
[32] DOI: 10.1109/5254.820329 · Zbl 05094224 · doi:10.1109/5254.820329
[33] Frühwirth, CP ’98 pp 476– (1998)
[34] Betz, CP ’05 pp 137– (2005)
[35] Sarna-Starosta, PADL ’07: Proc. 9th Intl. Symp. Practical Aspects of Declarative Languages pp 170– (2007)
[36] Frühwirth, High-Level Implementations of Constraint Handling Rules (1995)
[37] Frühwirth, Essentials of Constraint Programming (2003) · doi:10.1007/978-3-662-05138-2
[38] Frühwirth, The Journal of Theory and Practice of Logic Programming 1 pp 303– (2001) · Zbl 1090.68572 · doi:10.1017/S1471068401001181
[39] Frühwirth, Constraint Handling Rules (2009) · Zbl 1182.68039 · doi:10.1017/CBO9780511609886
[40] DOI: 10.1007/978-3-540-72200-7_18 · Zbl 1149.68424 · doi:10.1007/978-3-540-72200-7_18
[41] Meister, CSCLP ’06: Proc. 11th Annual ERCIM Workshop on Constraint Solving and Constraint Programming pp 139– (2006)
[42] Lam, DAMP ’07: Proc. ACM SIGPLAN Workshop on Declarative Aspects of Multicore Programming (2007)
[43] Van Weert, Special Issue on Constraint Handling Rules (2008)
[44] Krämer, A generic search engine for a Java Constraint Kit (2001)
[45] Van Weert, Compiling Constraint Handling Rules to Java: A reconstruction (2008)
[46] Bès, Proc. Lorraine-Saarland Workshop on Prospects and Advances in the Syntax/Semantics Interface (2003)
[47] Bavarian, Journal of Universal Computer Science 12 pp 1500– (2006)
[48] Badea, PPSWR ’04: Workshop on Principles And Practice Of Semantic Web Reasoning pp 61– (2004) · doi:10.1007/978-3-540-30122-6_5
[49] Apt, TPLP 1 pp 713– (2001)
[50] Alves, WFLP ’01: Proc. 10th Intl. Workshop on Functional and (Constraint) Logic Programming, Selected Papers pp 56– (2002)
[51] Gouraud, PADL ’06: Proc. 8th Intl. Symp. Practical Aspects of Declarative Languages pp 1– (2006)
[52] DOI: 10.1109/SCCC.2002.1173200 · doi:10.1109/SCCC.2002.1173200
[53] Frühwirth, Recent Advances in Constraints, CSCLP ’05: Joint ERCIM/CoLogNET Intl. Workshop on Constraint Solving and CLP, Revised Selected and Invited Papers (2006)
[54] Alberti, LCMAS’03: Logic and Communication in Multi-Agent Systems pp 94– (2004)
[55] Frühwirth, LOPSTR ’04 pp 133– (2005)
[56] DOI: 10.1080/08839510500479546 · Zbl 05386648 · doi:10.1080/08839510500479546
[57] DOI: 10.1145/967900.967918 · doi:10.1145/967900.967918
[58] Frühwirth, QAPL ’01: Proc. First Intl. Workshop on Quantitative Aspects of Programming Languages (2002)
[59] Frühwirth, KR ’02: Proc. 8th Intl. Conf. Princ. Knowledge Representation and Reasoning pp 547– (2002)
[60] Frühwirth, Declarative Programming–Selected Papers from AGP 2000 pp 147– (2001)
[61] Frühwirth, New Trends in Constraints, Joint ERCIM/Compulog Net Workshop, October 1999, Selected papers pp 298– (2000)
[62] Frühwirth, Journal of Logic Programming, Special Issue on Constraint Logic Programming 37 pp 95– (1998)
[63] Frühwirth, Constraint Programming: Basic and Trends–Selected Papers of the 22nd Spring School in Theoretical Computer Sciences, May 16–20, 1994 pp 90– (1995)
[64] Kosmatov, INAP ’05: Proc. 16th Intl. Conf. Applications of Declarative Programming and Knowledge Management pp 25– (2006) · doi:10.1007/11963578_3
[65] DOI: 10.1145/1141277.1141369 · doi:10.1145/1141277.1141369
[66] Holzbaur, Journal of Applied Artificial Intelligence 14 (2000)
[67] DOI: 10.1080/088395100117043 · Zbl 05386824 · doi:10.1080/088395100117043
[68] Tacchella, PPDP ’07 pp 179– (2007) · doi:10.1145/1273920.1273945
[69] Holzbaur, PPDP ’99 pp 117– (1999)
[70] Holzbaur, Constraint Handling Rules Reference Manual, Release 2.2 (1998)
[71] Sulzmann, APLAS ’06: Proc. 4th Asian Symp. on Programming Languages and Systems pp 26– (2006) · Zbl 1168.68367 · doi:10.1007/11924661_2
[72] Sulzmann, IFL ’07: 19th Intl. Symp. Implementation and Application of Functional Languages pp 195– (2007)
[73] DOI: 10.1017/S0956796806006137 · Zbl 1107.68031 · doi:10.1017/S0956796806006137
[74] DOI: 10.1145/1108970.1108974 · Zbl 05459340 · doi:10.1145/1108970.1108974
[75] Stuckey, ICLP ’02: Proc. 18th Intl. Conf. Logic Programming (2002)
[76] Aguilar-Solis, IBERAMIA ’04: Proc. 9th Ibero-American Conf. on AI pp 315– (2004)
[77] Abdennadher, LOPSTR ’07, Revised Selected Papers (2008)
[78] DOI: 10.1007/BFb0055987 · doi:10.1007/BFb0055987
[79] Frühwirth, Constraint Simplification Rules (1992)
[80] DOI: 10.1145/976706.976707 · Zbl 1367.68259 · doi:10.1145/976706.976707
[81] Fink, WLP ’06: Proc. 20th Workshop on Logic Programming (2006)
[82] Abdennadher, LOPSTR ’06, Revised Selected Papers (2006)
[83] Etalle, ICLP ’06: Proc. 22nd Intl. Conf. Logic Programming (2006)
[84] Escrig, Qualitative Spatial Reasoning: Theory and Practice–Application to Robot Navigation (1998) · Zbl 0923.68115
[85] DOI: 10.1006/jvlc.1997.0067 · doi:10.1006/jvlc.1997.0067
[86] DOI: 10.1145/888251.888260 · doi:10.1145/888251.888260
[87] Haemmerlé, RTA ’07: Proc. 18th Intl. Conf. Term Rewriting and Applications (2007)
[88] DOI: 10.1145/1462166.1462169 · doi:10.1145/1462166.1462169
[89] DOI: 10.1145/1462179.1462183 · Zbl 1351.68050 · doi:10.1145/1462179.1462183
[90] Gabbrielli, ICLP ’05: Proc. 21st Intl. Conf. Logic Programming (2005)
[91] Simões, WFLP ’04: Proc. 13th Intl. Workshop on Functional and (Constraint) Logic Programming pp 48– (2004)
[92] Shigeta, Journal of Advanced Computational Intelligence and Intelligent Informatics 10 pp 339– (2006) · Zbl 05426389 · doi:10.20965/jaciii.2006.p0339
[93] Seitz, IC-AI ’02: Proc. Intl. Conf. Artificial Intelligence pp 295– (2002)
[94] Schumann, WFLP ’02: Proc. 11th Intl. Workshop on Functional and (Constraint) Logic Programming (2002)
[95] DOI: 10.1016/S0743-1066(98)10036-5 · Zbl 0938.68023 · doi:10.1016/S0743-1066(98)10036-5
[96] DOI: 10.1145/1244002.1244016 · doi:10.1145/1244002.1244016
[97] Demoen, ICLP ’04: Proc. 20th Intl. Conf. Logic Programming (2004)
[98] DOI: 10.1145/1069774.1069794 · doi:10.1145/1069774.1069794
[99] DOI: 10.1007/978-3-540-78969-7_5 · Zbl 05262479 · doi:10.1007/978-3-540-78969-7_5
[100] De Koninck, PPDP ’07 pp 25– (2007) · doi:10.1145/1273920.1273924
[101] Abdennadher, WFLP ’01: Proc. 10th Intl. Workshop on Functional and (Constraint) Logic Programming, Selected Papers pp 1– (2002)
[102] DOI: 10.1023/A:1009842826135 · Zbl 0951.68070 · doi:10.1023/A:1009842826135
[103] Abdennadher, LOPSTR ’03 pp 198– (2004)
[104] Abdennadher, CP ’99 pp 43– (1999)
[105] Abdennadher, CP ’98 pp 25– (1998)
[106] Schrijvers, CICLOPS ’03: Proc. 3rd Intl. Colloq. on Implementation of Constraint and Logic Programming Systems pp 7– (2003)
[107] Abdennadher, FQAS ’00: Proc. 4th Intl. Conf. Flexible Query Answering Systems pp 141– (2000)
[108] Abdennadher, Rule-based constraint programming: Theory and practice (2001)
[109] DOI: 10.1145/1069774.1069795 · doi:10.1145/1069774.1069795
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.