{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:12:18Z","timestamp":1759032738225},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030322571"},{"type":"electronic","value":"9783030322588"}],"license":[{"start":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T00:00:00Z","timestamp":1569974400000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-32258-8_17","type":"book-chapter","created":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T05:31:35Z","timestamp":1569907895000},"page":"149-159","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Exploring the Space of Block Structured Scheduling Processes Using Constraint Logic Programming"],"prefix":"10.1007","author":[{"given":"Amelia","family":"B\u0103dic\u0103","sequence":"first","affiliation":[]},{"given":"Costin","family":"B\u0103dic\u0103","sequence":"additional","affiliation":[]},{"given":"Mirjana","family":"Ivanovi\u0107","sequence":"additional","affiliation":[]},{"given":"Doina","family":"Logof\u0103tu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,2]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-319-92007-8_16","volume-title":"IFIP Advances in Information and Communication Technology","author":"Amelia B\u0103dic\u0103","year":"2018","unstructured":"B\u0103dic\u0103, A., B\u0103dic\u0103, C., D\u0103nciulescu, D., Logof\u0103tu, D.: Greedy heuristics for automatic synthesis of efficient block-structured scheduling processes from declarative specifications. In: Proceedings of the AIAI 2018. IFIP Advances in Information and Communication Technology, vol. 519, pp. 183\u2013195 Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-92007-8_16"},{"key":"17_CR2","unstructured":"Bordini, R.H., H\u00fcbner, J.F.: Concurrency in Jason. \n                    https:\/\/github.com\/jason-lang\/jason\/blob\/master\/doc\/tech\/concurrency.adoc\n                    \n                  . Accessed 19 June 2019"},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1287\/opre.9.3.296","volume":"9","author":"JE Kelley Jr","year":"1961","unstructured":"Kelley Jr., J.E.: Critical-path planning and scheduling: mathematical basis. Oper. Res. 9(3), 296\u2013320 (1961). \n                    https:\/\/doi.org\/10.1287\/opre.9.3.296","journal-title":"Oper. Res."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-642-38697-8_17","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"Sander J. J. Leemans","year":"2013","unstructured":"Leemans, S.J.J., Fahland, D., van der Aalst, W.M.P.: Discovering block-structured process models from event logs - a constructive approach. In: Proceedings of the PETRI NETS 2013. LNCS, vol. 7927, pp. 311\u2013329. Springer (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-38697-8_17"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-319-48472-3_3","volume-title":"On the Move to Meaningful Internet Systems: OTM 2016 Conferences","author":"Richard Mrasek","year":"2016","unstructured":"Mrasek, R., M\u00fclle, J., B\u00f6hm, K.: Process synthesis with sequential and parallel constraints. In: Proceedings of the OTM 2016. LNCS, vol. 10033, pp. 43\u201360. Springer (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-48472-3_3"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/3-540-45619-8_16","volume-title":"Logic Programming","author":"Joachim Schimpf","year":"2002","unstructured":"Schimpf, J.: Logical loops. In: Proceeding of the 18th International Conference on Logic Programming, ICLP 2002. LNCS, vol. 2401, pp. 224\u2013238. Springer (2002). \n                    https:\/\/doi.org\/10.1007\/3-540-45619-8_16"},{"issue":"1\u20132","key":"17_CR7","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. Theory Pract. Log. Program. 12(1\u20132), 127\u2013156 (2012). \n                    https:\/\/doi.org\/10.1017\/S1471068411000469","journal-title":"Theory Pract. Log. Program."},{"key":"17_CR8","unstructured":"The ECLiPSe Constraint Programming System. \n                    http:\/\/eclipseclp.org\/\n                    \n                  . Accessed 23 Jan 2019"},{"key":"17_CR9","unstructured":"Generic Constraint Development Environment. \n                    https:\/\/www.gecode.org\/\n                    \n                  . Accessed 23 Jan 2019"}],"container-title":["Studies in Computational Intelligence","Intelligent Distributed Computing XIII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-32258-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T05:33:46Z","timestamp":1569908026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-32258-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,2]]},"ISBN":["9783030322571","9783030322588"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-32258-8_17","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2019,10,2]]},"assertion":[{"value":"2 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IDC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Intelligent and Distributed Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Petersburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"idc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/idc2019.ru\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}