{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T17:38:21Z","timestamp":1758044301256,"version":"3.44.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032048479","type":"print"},{"value":"9783032048486","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T00:00:00Z","timestamp":1757376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T00:00:00Z","timestamp":1757376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04848-6_4","type":"book-chapter","created":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T11:59:39Z","timestamp":1757678379000},"page":"57-74","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extending the\u00a0FSyntax\/Hiord Approach with\u00a0Imperative Notation"],"prefix":"10.1007","author":[{"given":"Paula","family":"Corral","sequence":"first","affiliation":[]},{"given":"Jose F.","family":"Morales","sequence":"additional","affiliation":[]},{"given":"Pedro","family":"Lopez-Garcia","sequence":"additional","affiliation":[]},{"given":"Manuel V.","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,9]]},"reference":[{"issue":"5","key":"4_CR1","doi-asserted-by":"publisher","first-page":"1014","DOI":"10.1145\/293677.293679","volume":"20","author":"KR Apt","year":"1998","unstructured":"Apt, K.R., Brunekreef, J., Partington, V., Schaerf, A.: Alma-O: an imperative language that supports declarative programming. ACM Trans. Program. Lang. Syst. 20(5), 1014\u20131066 (1998). https:\/\/doi.org\/10.1145\/293677.293679","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-44957-4_9","volume-title":"Computational Logic \u2014 CL 2000","author":"D Cabeza","year":"2000","unstructured":"Cabeza, D., Hermenegildo, M.: A New Module System for Prolog. In: Lloyd, J., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 131\u2013148. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44957-4_9"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-30502-6_7","volume-title":"Advances in Computer Science - ASIAN 2004. Higher-Level Decision Making","author":"D Cabeza","year":"2004","unstructured":"Cabeza, D., Hermenegildo, M., Lipton, J.: Hiord: a type-free higher-order logic programming language with predicate abstraction. In: Maher, M.J. (ed.) ASIAN 2004. LNCS, vol. 3321, pp. 93\u2013108. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30502-6_7"},{"issue":"1\u20132","key":"4_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1017\/S1471068411000482","volume":"12","author":"M Carlsson","year":"2012","unstructured":"Carlsson, M., Mildner, P.: SICStus Prolog - the First 25 Years. Theory Pract. Logic Program. 12(1\u20132), 35\u201366 (2012). https:\/\/doi.org\/10.1017\/S1471068411000482","journal-title":"Theory Pract. Logic Program."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Casas, A., Cabeza, D., Hermenegildo, M.: A syntactic approach to combining functional notation, lazy evaluation and higher-order in LP systems. In: The 8th International Symposium on Functional and Logic Programming (FLOPS 2006), Fuji Susono (Japan), pp. 142\u2013162 (April 2006)","DOI":"10.1007\/11737414_11"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Fages, F.: A constraint-based mathematical modeling library in prolog with answer constraint semantics (2024), https:\/\/arxiv.org\/abs\/2402.17286","DOI":"10.1007\/978-981-97-2300-3_8"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-030-45260-5_3","volume-title":"Logic-Based Program Synthesis and Transformation","author":"I Garcia-Contreras","year":"2020","unstructured":"Garcia-Contreras, I., Morales, J.F., Hermenegildo, M.V.: Incremental analysis of logic programs with assertions and open predicates. In: Gabbrielli, M. (ed.) LOPSTR 2019. LNCS, vol. 12042, pp. 36\u201356. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45260-5_3"},{"key":"4_CR8","unstructured":"Hanus, M.: Curry: An integrated functional logic language (vers. 0.9.0) (2013). http:\/\/www.curry-language.org language Report"},{"key":"4_CR9","unstructured":"Henderson, F., et al.: The Mercury Language Reference Manual. State Variables. The University of Melbourne (2014). https:\/\/mercurylang.org\/information\/doc-release\/mercury_ref\/State-variables.html"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Hermenegildo, M.V., et al.: An overview of ciao and its design philosophy. Theory Pract. Logic Programm. 12(1\u20132), 219\u2013252 (2012). https:\/\/doi.org\/10.1017\/S1471068411000457","DOI":"10.1017\/S1471068411000457"},{"key":"4_CR11","unstructured":"Hughes, C.: Project euler (2025). https:\/\/projecteuler.net"},{"key":"4_CR12","unstructured":"McGrail, R.: Monads and Control in Logic Programming. Ph.D. thesis, Wesleyan University (1999)"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a Standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"key":"4_CR14","doi-asserted-by":"publisher","unstructured":"O\u2019Neill, M.: The genuine sieve of eratosthenes. J. Funct. Program. 19, 95\u2013106 (2009). https:\/\/doi.org\/10.1017\/S0956796808007004","DOI":"10.1017\/S0956796808007004"},{"issue":"11","key":"4_CR15","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1145\/71605.71617","volume":"24","author":"PV Roy","year":"1989","unstructured":"Roy, P.V.: A useful extension to prolog\u2019s definite clause grammar notation. ACM SIGPLAN Notices 24(11), 132\u2013134 (1989)","journal-title":"ACM SIGPLAN Notices"},{"issue":"1\u20132","key":"4_CR16","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1017\/S1471068411000512","volume":"12","author":"V Santos Costa","year":"2012","unstructured":"Santos Costa, V., Rocha, R., Damas, L.: The YAP prolog system. Theory Pract. Logic Program. 12(1\u20132), 5\u201334 (2012). https:\/\/doi.org\/10.1017\/S1471068411000512","journal-title":"Theory Pract. Logic Program."},{"key":"4_CR17","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). https:\/\/doi.org\/10.1007\/3-540-45619-8_16"},{"key":"4_CR18","unstructured":"Stuckey, P.J., Marriott, K., Tack, G.: MiniZinc Documentation. https:\/\/docs.minizinc.dev\/en\/stable\/index.html"},{"issue":"1\u20132","key":"4_CR19","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1017\/S1471068411000500","volume":"12","author":"T Swift","year":"2012","unstructured":"Swift, T., Warren, D.S.: XSB: extending prolog with tabled logic programming. Theory Pract. Logic Program. 12(1\u20132), 157\u2013187 (2012). https:\/\/doi.org\/10.1017\/S1471068411000500","journal-title":"Theory Pract. Logic Program."},{"issue":"1\u20132","key":"4_CR20","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1017\/S1471068411000494","volume":"12","author":"J Wielemaker","year":"2012","unstructured":"Wielemaker, J., Schrijvers, T., Triska, M., Lager, T.: SWI-Prolog. Theory Pract. Logic Program. 12(1\u20132), 67\u201396 (2012). https:\/\/doi.org\/10.1017\/S1471068411000494","journal-title":"Theory Pract. Logic Program."},{"key":"4_CR21","doi-asserted-by":"publisher","unstructured":"Zhou, N.F.: Picat: a scalable logic-based language and system. In: 2nd Symposium on Languages, Applications and Technologies. Open Access Series in Informatics (OASIcs), vol.\u00a029, pp.\u00a05\u20136. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2013). https:\/\/doi.org\/10.4230\/OASIcs.SLATE.2013.5, https:\/\/drops.dagstuhl.de\/entities\/document\/10.4230\/OASIcs.SLATE.2013.5","DOI":"10.4230\/OASIcs.SLATE.2013.5"},{"key":"4_CR22","unstructured":"Zhou, N.F., Fruhman, J.: Picat Guide (2025) https:\/\/picat-lang.org\/download\/picat_guide.pdf"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04848-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T11:59:43Z","timestamp":1757678383000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04848-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,9]]},"ISBN":["9783032048479","9783032048486"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04848-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,9]]},"assertion":[{"value":"9 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rende","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lopstr.github.io\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}