{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T05:05:49Z","timestamp":1768453549181,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319516752","type":"print"},{"value":"9783319516769","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,12,17]],"date-time":"2016-12-17T00:00:00Z","timestamp":1481932800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51676-9_2","type":"book-chapter","created":{"date-parts":[[2016,12,17]],"date-time":"2016-12-17T02:14:29Z","timestamp":1481940869000},"page":"19-33","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Canonicalizing High-Level Constructs in Picat"],"prefix":"10.1007","author":[{"given":"Neng-Fa","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Fruhman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,17]]},"reference":[{"key":"2_CR1","unstructured":"Colmerauer, A.: Equations and inequations on finite and infinite trees. In: Proceedings of FGCS, pp. 85\u201399. ICOT (1984)"},{"issue":"4","key":"2_CR2","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/115372.115320","volume":"13","author":"R Cytron","year":"1991","unstructured":"Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadeck, F.K.: Efficiently computing static single assignment form, the control dependence graph. ACM Trans. Program. Lang. Syst. 13(4), 451\u2013490 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2_CR3","unstructured":"Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., Berthier, F.: The constraint logic programming language CHIP. In FGCS, pp. 693\u2013702 (1988)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-319-19686-2_4","volume-title":"Practical Aspects of Declarative Languages","author":"S Dymchenko","year":"2015","unstructured":"Dymchenko, S., Mykhailova, M.: Declaratively solving Google code jam problems with Picat. In: Pontelli, E., Son, T.C. (eds.) PADL 2015. LNCS, vol. 9131, pp. 50\u201357. Springer, Cham (2015). doi:\n                    10.1007\/978-3-319-19686-2_4"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Hanus, M.: Functional logic programming: from theory to curry. In: Programming Logics, pp. 123\u2013168 (2013)","DOI":"10.1007\/978-3-642-37651-1_6"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"2002","DOI":"10.1287\/ijoc.14.4.345.2826","volume":"14","author":"P Hentenryck Van","year":"2002","unstructured":"Van Hentenryck, P.: Constraint and integer programming in OPL. INFORMS J. Comput. 14, 2002 (2002)","journal-title":"INFORMS J. Comput."},{"issue":"1\u20132","key":"2_CR7","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1017\/S1471068411000457","volume":"12","author":"MV Hermenegildo","year":"2012","unstructured":"Hermenegildo, M.V., Bueno, F., Carro, M., L\u00f3pez-Garc\u00eda, P., Mera, E., Morales, J.F., Puebla, G.: An overview of Ciao and its design philosophy. Theor. Pract. Logic Program. 12(1\u20132), 219\u2013252 (2012)","journal-title":"Theor. Pract. Logic Program."},{"issue":"3\u20134","key":"2_CR8","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0004-3702(71)90012-9","volume":"2","author":"R Kowalski","year":"1971","unstructured":"Kowalski, R., Kuehner, D.: Linear resolution with selection function. Artif. Intell. 2(3\u20134), 227\u2013260 (1971)","journal-title":"Artif. Intell."},{"key":"2_CR9","unstructured":"Mercury. \n                    http:\/\/www.mercurylang.org\/"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Principles and Practice of Constraint Programming, pp. 529\u2013543 (2007)","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-45619-8_16","volume-title":"Logic Programming","author":"J Schimpf","year":"2002","unstructured":"Schimpf, J.: Logical loops. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 224\u2013238. Springer, Heidelberg (2002). doi:\n                    10.1007\/3-540-45619-8_16"},{"issue":"1\u20132","key":"2_CR12","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1017\/S1471068411000469","volume":"12","author":"J Schimpf","year":"2012","unstructured":"Schimpf, J., Shen, K.: Eclipse-from LP to CLP. Theor. Pract. Logic Program. 12(1\u20132), 127\u2013156 (2012)","journal-title":"Theor. Pract. Logic Program."},{"key":"2_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9575-1","volume-title":"Programming with Sets - An Introduction to SETL","author":"JT Schwartz","year":"1986","unstructured":"Schwartz, J.T., Dewar, R.B.K., Dubinsky, E., Schonberg, E.: Programming with Sets - An Introduction to SETL. Springer, New York (1986)"},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(90)90147-A","volume":"73","author":"P Wadler","year":"1990","unstructured":"Wadler, P.: Deforestation: transforming programs to eliminate trees. Theor. Comput. Sci. 73(2), 231\u2013248 (1990)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR15","first-page":"441","volume":"10","author":"DHD Warren","year":"1982","unstructured":"Warren, D.H.D.: High-order extensions to Prolog - are they needed? Mach. Intell. 10, 441\u2013454 (1982)","journal-title":"Mach. Intell."},{"key":"2_CR16","unstructured":"Warren, D.H.D.: An abstract Prolog instruction set. Technical note 309, SRI International (1983)"},{"issue":"1\u20132","key":"2_CR17","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1017\/S1471068411000445","volume":"12","author":"N-F Zhou","year":"2012","unstructured":"Zhou, N.-F.: The language features and architecture of B-Prolog. Theor. Pract. Logic Program. 12(1\u20132), 189\u2013218 (2012)","journal-title":"Theor. Pract. Logic Program."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Zhou, N.-F., Bart\u00e1k, R., Dovier, A.: Planning as tabled logic programming. In: Theory and Practice of Logic Programming (2015)","DOI":"10.1017\/S1471068415000216"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-319-28228-2_4","volume-title":"Practical Aspects of Declarative Languages","author":"N-F Zhou","year":"2016","unstructured":"Zhou, N.-F., Kjellerstrand, H.: The Picat-SAT compiler. In: Gavanelli, M., Reppy, J. (eds.) PADL 2016. LNCS, vol. 9585, pp. 48\u201362. Springer, Cham (2016). doi:\n                    10.1007\/978-3-319-28228-2_4"},{"key":"2_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-25883-6","volume-title":"Constraint Solving and Planning with Picat","author":"N-F Zhou","year":"2015","unstructured":"Zhou, N.-F., Kjellerstrand, H., Fruhman, J.: Constraint Solving and Planning with Picat. Springer, Heidelberg (2015)"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51676-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T02:02:02Z","timestamp":1558317722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51676-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,17]]},"ISBN":["9783319516752","9783319516769"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51676-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,17]]},"assertion":[{"value":"17 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Practical Aspects of Declarative Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 January 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}