{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T22:02:19Z","timestamp":1750456939931},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540789680"},{"type":"electronic","value":"9783540789697"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-78969-7_5","type":"book-chapter","created":{"date-parts":[[2008,4,4]],"date-time":"2008-04-04T07:39:50Z","timestamp":1207294790000},"page":"32-47","source":"Crossref","is-referenced-by-count":6,"title":["Optimizing Compilation of CHR with Rule Priorities"],"prefix":"10.1007","author":[{"given":"Leslie","family":"De Koninck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter J.","family":"Stuckey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory J.","family":"Duck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-74610-2_15","volume-title":"Logic Programming","author":"L. Koninck De","year":"2007","unstructured":"De Koninck, L., Schrijvers, T., Demoen, B.: The correspondence between the Logical Algorithms language and CHR. In: Dahl, V., Niemel\u00e4, I. (eds.) ICLP 2007. LNCS, vol.\u00a04670, pp. 209\u2013223. Springer, Heidelberg (2007)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"De Koninck, L., Schrijvers, T., Demoen, B.: User-definable rule priorities for CHR. In: 9th ACM SIGPLAN Symp. on Principles and Practice of Declarative Programming, pp. 25\u201336 (2007)","DOI":"10.1145\/1273920.1273924"},{"key":"5_CR3","unstructured":"De Koninck, L., Sneyers, J.: Join ordering for Constraint Handling Rules. In: 4th Workshop on Constraint Handling Rules, pp. 107\u2013121 (2007)"},{"key":"5_CR4","unstructured":"De Koninck, L., Stuckey, P.J., Duck, G.J.: Optimized compilation of CHRrp. Technical Report CW 499, K.U.Leuven, Belgium (2007)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/978-3-540-27775-0_7","volume-title":"Logic Programming","author":"G.J. Duck","year":"2004","unstructured":"Duck, G.J., Stuckey, P.J., Garc\u00eda de la Banda, M., Holzbaur, C.: The refined operational semantics of Constraint Handling Rules. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol.\u00a03132, pp. 90\u2013104. Springer, Heidelberg (2004)"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0004-3702(82)90020-0","volume":"19","author":"C.L. Forgy","year":"1982","unstructured":"Forgy, C.L.: Rete: A fast algorithm for the many pattern\/many object pattern match problem. Artif. Intell.\u00a019(1), 17\u201337 (1982)","journal-title":"Artif. Intell."},{"issue":"1-3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T. Fr\u00fchwirth","year":"1998","unstructured":"Fr\u00fchwirth, T.: Theory and practice of Constraint Handling Rules. J. Log. Program.\u00a037(1-3), 95\u2013138 (1998)","journal-title":"J. Log. Program."},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-45619-8_15","volume-title":"Logic Programming","author":"H. Ganzinger","year":"2002","unstructured":"Ganzinger, H., McAllester, D.A.: Logical algorithms. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol.\u00a02401, pp. 209\u2013223. Springer, Heidelberg (2002)"},{"issue":"4 & 5","key":"5_CR9","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1017\/S1471068405002413","volume":"5","author":"C. Holzbaur","year":"2005","unstructured":"Holzbaur, C., Garc\u00eda de la Banda, M., Stuckey, P.J., Duck, G.J.: Optimizing compilation of Constraint Handling Rules in HAL. Theory and Practice of Logic Programming: Special Issue on Constraint Handling Rules\u00a05(4 & 5), 503\u2013531 (2005)","journal-title":"Theory and Practice of Logic Programming: Special Issue on Constraint Handling Rules"},{"key":"5_CR10","first-page":"42","volume-title":"6th National Conf. on Artificial Intelligence","author":"D.P. Miranker","year":"1987","unstructured":"Miranker, D.P.: TREAT: A better match algorithm for AI production system matching. In: 6th National Conf. on Artificial Intelligence, pp. 42\u201347. AAAI Press, Menlo Park (1987)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"551","DOI":"10.3115\/990820.990900","volume-title":"18th Intl. Conf. Computational Linguistics","author":"F. Morawietz","year":"2000","unstructured":"Morawietz, F.: Chart parsing and constraint programming. In: 18th Intl. Conf. Computational Linguistics, pp. 551\u2013557. Morgan Kaufmann, San Francisco (2000)"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Schrijvers, T.: Analyses, Optimizations and Extensions of Constraint Handling Rules. PhD thesis, K.U.Leuven, Leuven, Belgium (2005)","DOI":"10.1007\/11562931_44"},{"key":"5_CR13","unstructured":"Schrijvers, T., Demoen, B.: The K.U.Leuven CHR system: Implementation and application. In: 1st Workshop on CHR, Selected Contributions, Ulmer Informatik-Berichte 2004-01, pp. 1\u20135. Universit\u00e4t Ulm, Germany (2004)"},{"key":"5_CR14","unstructured":"Schrijvers, T., et\u00a0al.: The Constraint Handling Rules home page (2007), http:\/\/www.cs.kuleuven.be\/~dtai\/projects\/CHR\/"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Schrijvers, T., Fr\u00fchwirth, T.: Optimal union-find in Constraint Handling Rules. Theory and Practice of Logic Programming\u00a06(1&2) (2006)","DOI":"10.1017\/S1471068405002541"},{"key":"5_CR16","unstructured":"Sneyers, J., Schrijvers, T., Demoen, B.: Dijkstra\u2019s algorithm with Fibonacci heaps: An executable description in CHR. In: 20th Workshop on Logic Programming, INFSYS Research Report 1843-06-02, pp. 182\u2013191. TU Wien (2006)"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78969-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T17:55:12Z","timestamp":1557424512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78969-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540789680","9783540789697"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78969-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}