{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T22:02:18Z","timestamp":1750456938865},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540746089"},{"type":"electronic","value":"9783540746102"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74610-2_15","type":"book-chapter","created":{"date-parts":[[2007,8,23]],"date-time":"2007-08-23T22:33:31Z","timestamp":1187908411000},"page":"209-223","source":"Crossref","is-referenced-by-count":4,"title":["The Correspondence Between the Logical Algorithms Language and CHR"],"prefix":"10.1007","author":[{"given":"Leslie","family":"De Koninck","sequence":"first","affiliation":[]},{"given":"Tom","family":"Schrijvers","sequence":"additional","affiliation":[]},{"given":"Bart","family":"Demoen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Christiansen, H.: A constraint-based bottom-up counterpart to definite clause grammars. In: Recent Advances in Natural Language Processing III, Selected Papers. Current Issues in Linguistic Theory vol. 260 (2004)","DOI":"10.1075\/cilt.260.24chr"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","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, Springer, Heidelberg (2004)"},{"issue":"1","key":"15_CR3","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":"3","key":"15_CR4","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM\u00a034(3), 596\u2013615 (1987)","journal-title":"J. ACM"},{"issue":"1-3","key":"15_CR5","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":"15_CR6","doi-asserted-by":"crossref","unstructured":"Fr\u00fchwirth, T.: As time goes by II: More automatic complexity analysis of concurrent rule programs. Electr. Notes Theor. Comput. Sci., 59(3) (2001)","DOI":"10.1016\/S1571-0661(04)00288-9"},{"key":"15_CR7","unstructured":"Fr\u00fchwirth, T.: As time goes by: Automatic complexity analysis of concurrent rule programs. In: 8th Intl. Conf. Principles of Knowledge Representation and Reasoning, pp. 547\u2013557 (2002)"},{"key":"15_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1007\/3-540-45744-5_44","volume-title":"Automated Reasoning","author":"H. Ganzinger","year":"2001","unstructured":"Ganzinger, H., McAllester, D.A.: A new meta-complexity theorem for bottom-up logic programs. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS (LNAI), vol.\u00a02083, pp. 514\u2013528. Springer, Heidelberg (2001)"},{"key":"15_CR9","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)"},{"key":"15_CR10","unstructured":"De Koninck, L., Schrijvers, T., Demoen, B.: CHR $^\\textrm{rp}$ : Constraint handling rules with rule priorities. Technical Report CW 479, K.U.Leuven, Belgium (March 2007)"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"De Koninck, L., Schrijvers, T., Demoen, B.: The correspondence between the logical algorithms language and CHR. Technical Report CW 480, K.U.Leuven, Belgium (March 2007)","DOI":"10.1007\/978-3-540-74610-2_15"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/3-540-48294-6_21","volume-title":"Static Analysis","author":"D.A. McAllester","year":"1999","unstructured":"McAllester, D.A.: On the complexity analysis of static analyses. In: Cortesi, A., Fil\u00e9, G. (eds.) SAS 1999. LNCS, vol.\u00a01694, pp. 312\u2013329. Springer, Heidelberg (1999)"},{"key":"15_CR13","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":"15_CR14","unstructured":"Schrijvers, T., Demoen, B.: The K.U.Leuven CHR system: implementation and application. In: First Workshop on CHR: Selected Contributions. Ulmer Informatik-Berichte. Universit\u00e4t Ulm, vol. 2004-01, pp. 1\u20135 (2004)"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Schrijvers, T., Fr\u00fchwirth, T.: Optimal union-find in constraint handling rules. Theory and Practice of Logic Programming, 6(1&2) (2006)","DOI":"10.1017\/S1471068405002541"},{"key":"15_CR16","unstructured":"Sneyers, J., Schrijvers, T., Demoen, B.: The computational power and complexity of Constraint Handling Rules. In: 2nd Workshop on Constraint Handling Rules. Reports CW, Dept. of Computer Science, K.U.Leuven, Belgium, vol. 421, pp. 3\u201317 (2005)"},{"key":"15_CR17","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, TU Wien, vol. 1843-06-02, pp. 182\u2013191 (2006)"},{"key":"15_CR18","unstructured":"Van Weert, P., Sneyers, J., Schrijvers, T., Demoen, B.: Extending CHR with negation as absence. In: 3rd Workshop on CHR. Reports CW, Dept. of Computer Science, K.U. Leuven, Belgium, vol. 452, pp. 125\u2013140 (2006)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74610-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T11:19:13Z","timestamp":1556795953000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74610-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540746089","9783540746102"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74610-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}