{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:29:01Z","timestamp":1750307341946,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,7,20]],"date-time":"2011-07-20T00:00:00Z","timestamp":1311120000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,7,20]]},"DOI":"10.1145\/2003476.2003496","type":"proceedings-article","created":{"date-parts":[[2011,7,20]],"date-time":"2011-07-20T12:34:54Z","timestamp":1311165294000},"page":"137-148","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["CLP projection for constraint handling rules"],"prefix":"10.1145","author":[{"given":"Remy","family":"Haemmerle","sequence":"first","affiliation":[{"name":"Technical University of Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pedro","family":"Lopez-Garcia","sequence":"additional","affiliation":[{"name":"IMDEA Software Institute & Spanish National Research Council, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manuel V.","family":"Hermenegildo","sequence":"additional","affiliation":[{"name":"IMDEA Software Institute & Technical University of Madrid, Madrid, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,7,20]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Annual international termination competition. http:\/\/termcomp.uibk.ac.at.  Annual international termination competition. http:\/\/termcomp.uibk.ac.at."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017444"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/647485.726326"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009842826135"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24754-8_9"},{"key":"e_1_3_2_1_6_1","volume-title":"School of Computer Science","author":"Bueno F.","year":"2011","unstructured":"F. Bueno , D. Cabeza , M. Carro , M. Hermenegildo , P. L\u00f3pez-Garc\u00ed , and G. Puebla-( Eds .). The Ciao system. ref. manual (v1.13). Technical report , School of Computer Science , T.U. of Madrid (UPM) , 2011 . Available at \\texttthttp:\/\/www.ciaohome.org. F. Bueno, D. Cabeza, M. Carro, M. Hermenegildo, P. L\u00f3pez-Garc\u00ed, and G. Puebla-(Eds.). The Ciao system. ref. manual (v1.13). Technical report, School of Computer Science, T.U. of Madrid (UPM), 2011. Available at \\texttthttp:\/\/www.ciaohome.org."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/647482.725982"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00006-0"},{"key":"e_1_3_2_1_10_1","first-page":"157","volume-title":"Types in Logic Programming","author":"Dart P.","year":"1992","unstructured":"P. Dart and J. Zobel . A regular type language for logic programs . In Types in Logic Programming , pages 157 -- 187 . MIT Press , 1992 . P. Dart and J. Zobel. A regular type language for logic programs. In Types in Logic Programming, pages 157--187. MIT Press, 1992."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/161468.161472"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/93542.93564"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. of International Logic Programming Symposium (ILPS). MIT Press","author":"Debray S. K.","year":"1997","unstructured":"S. K. Debray , P. L\u00f3pez-Garc\u00eda , M. Hermenegildo , and N.-W. Lin . Lower bound cost estimation for logic programs . In Proc. of International Logic Programming Symposium (ILPS). MIT Press , 1997 . S. K. Debray, P. L\u00f3pez-Garc\u00eda, M. Hermenegildo, and N.-W. Lin. Lower bound cost estimation for logic programs. In Proc. of International Logic Programming Symposium (ILPS). MIT Press, 1997."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/1618539"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000311"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/11814771_24"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071368.2071374"},{"key":"e_1_3_2_1_19_1","volume-title":"To appear in TPLP (ICLP'11 Special Issue)","author":"Haemmerl\u00e9 R.","year":"2011","unstructured":"R. Haemmerl\u00e9 . (Co)-inductive semantics of Constraint Handling Rules . To appear in TPLP (ICLP'11 Special Issue) , 2011 . R. Haemmerl\u00e9. (Co)-inductive semantics of Constraint Handling Rules. To appear in TPLP (ICLP'11 Special Issue), 2011."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1779782.1779799"},{"key":"e_1_3_2_1_21_1","volume-title":"Technical Report CLIP7\/2006.0, School of Computer Science","author":"Hermenegildo M.","year":"2006","unstructured":"M. Hermenegildo and The Ciao Development Team . Why Ciao? --an overview of the Ciao system's design philosophy. Technical Report CLIP7\/2006.0, School of Computer Science , T.U. of Madrid (UPM) , 2006 . M. Hermenegildo and The Ciao Development Team. Why Ciao? --an overview of the Ciao system's design philosophy. Technical Report CLIP7\/2006.0, School of Computer Science, T.U. of Madrid (UPM), 2006."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.02.006"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/645814.668871"},{"key":"e_1_3_2_1_24_1","first-page":"65","volume-title":"Parallelism and Implementation of Logic and Constraint Logic Programming","author":"M. Hermenegildo","year":"1999","unstructured":"M. Hermenegildo et al. The CIAO multi-dialect compiler and system: An experimentation workbench for future (C)LP systems . In Parallelism and Implementation of Logic and Constraint Logic Programming , pages 65 -- 85 . Nova Science , 1999 . M. Hermenegildo et al. The CIAO multi-dialect compiler and system: An experimentation workbench for future (C)LP systems. In Parallelism and Implementation of Logic and Constraint Logic Programming, pages 65--85. Nova Science, 1999."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/646448.692447"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/645815.758228"},{"key":"e_1_3_2_1_27_1","volume-title":"General core","author":"Information","year":"1995","unstructured":"Information technology -- Programming languages -- Prolog -- Part 1 : General core . International Organization for Standardiztion , 1995 . ISO\/IEC 13211--1. Information technology -- Programming languages -- Prolog -- Part 1: General core. International Organization for Standardiztion, 1995. ISO\/IEC 13211--1."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/41625.41635"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00354-008-0085-1"},{"key":"e_1_3_2_1_30_1","first-page":"49","volume-title":"Proc. of International Conference on Logic Programming (ICLP)","author":"Muthukumar K.","year":"1991","unstructured":"K. Muthukumar and M. Hermenegildo . Combined determination of sharing and freeness of program variables through abstract interpretation . In Proc. of International Conference on Logic Programming (ICLP) , pages 49 -- 63 . MIT Press , June 1991 . K. Muthukumar and M. Hermenegildo. Combined determination of sharing and freeness of program variables through abstract interpretation. In Proc. of International Conference on Logic Programming (ICLP), pages 49--63. MIT Press, June 1991."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(92)90035-2"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/1778180.1778211"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02846-5_42"},{"key":"e_1_3_2_1_34_1","volume-title":"Proc. of International Workshop on Termination (WST)","author":"Pilozzi P.","year":"2007","unstructured":"P. Pilozzi , T. Schrijvers , and D. De Schreye . Proving termination of CHR in Prolog: A transformational approach . In Proc. of International Workshop on Termination (WST) , 2007 . P. Pilozzi, T. Schrijvers, and D. De Schreye. Proving termination of CHR in Prolog: A transformational approach. In Proc. of International Workshop on Termination (WST), 2007."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12592-8_3"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/646018.678418"},{"key":"e_1_3_2_1_37_1","first-page":"34","volume":"555","author":"Raiser F.","year":"2009","unstructured":"F. Raiser , H. Betz , and T. Fr\u00fchwirth . Equivalence of CHR states revisited. In Proc. of Workshop on Constraint Handling Rules (CHR), Report CW 555 , pages 34 -- 48 . Kath. Univ. Leuven, 2009 . F. Raiser, H. Betz, and T. Fr\u00fchwirth. Equivalence of CHR states revisited. In Proc. of Workshop on Constraint Handling Rules (CHR), Report CW 555, pages 34--48. Kath. Univ. Leuven, 2009.","journal-title":"Equivalence of CHR states revisited. In Proc. of Workshop on Constraint Handling Rules (CHR), Report CW"},{"key":"e_1_3_2_1_39_1","first-page":"1","volume-title":"Proc. of Workshop on Constraint Handling Rules (CHR)","author":"Schrijvers T.","year":"2004","unstructured":"T. Schrijvers and B. Demoen . The K. U. Leuven CHR system: Implementation and application . In Proc. of Workshop on Constraint Handling Rules (CHR) , pages 1 -- 5 , 2004 . T. Schrijvers and B. Demoen. The K. U. Leuven CHR system: Implementation and application. In Proc. of Workshop on Constraint Handling Rules (CHR), pages 1--5, 2004."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/647171.718317"}],"event":{"name":"PPDP '11: Symposium on Principles and Practices of Declarative Programming","sponsor":["University of Southern Denmark","Danish Agency for Science Technology and Innovation DASTI","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Odense Denmark","acronym":"PPDP '11"},"container-title":["Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2003476.2003496","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2003476.2003496","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:06:22Z","timestamp":1750244782000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2003476.2003496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,20]]},"references-count":38,"alternative-id":["10.1145\/2003476.2003496","10.1145\/2003476"],"URL":"https:\/\/doi.org\/10.1145\/2003476.2003496","relation":{},"subject":[],"published":{"date-parts":[[2011,7,20]]},"assertion":[{"value":"2011-07-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}