{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:59:52Z","timestamp":1757627992465,"version":"3.44.0"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032028662"},{"type":"electronic","value":"9783032028679"}],"license":[{"start":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T00:00:00Z","timestamp":1756598400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,31]],"date-time":"2025-08-31T00:00:00Z","timestamp":1756598400000},"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-02867-9_3","type":"book-chapter","created":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T05:44:38Z","timestamp":1756532678000},"page":"17-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Constraint-Based Reasoning and\u00a0Analysis for\u00a0BPM: CSP to\u00a0the\u00a0Rescue"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4216-5199","authenticated-orcid":false,"given":"Alessandro","family":"Gianola","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8425-2309","authenticated-orcid":false,"given":"Andrey","family":"Rivkin","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7269-8215","authenticated-orcid":false,"given":"Mateusz","family":"\u015ala\u017cy\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,31]]},"reference":[{"issue":"7","key":"3_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-A","volume":"17","author":"A Aggoun","year":"1993","unstructured":"Aggoun, A., Beldiceanu, N.: Extending chip in order to solve complex scheduling and placement problems. Math. Comput. Model. 17(7), 57\u201373 (1993)","journal-title":"Math. Comput. Model."},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10009-008-0091-0","volume":"11","author":"A Armando","year":"2009","unstructured":"Armando, A., Mantovani, J., Platania, L.: Bounded model checking of software using SMT solvers instead of SAT solvers. Int. J. Softw. Tools Technol. Transf. 11(1), 69\u201383 (2009)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"3_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2024.104277","volume":"340","author":"S Attieh","year":"2025","unstructured":"Attieh, S., Dang, N., Jefferson, C., Miguel, I., Nightingale, P.: Athanor: local search over abstract constraint specifications. Artif. Intell. 340, 104277 (2025)","journal-title":"Artif. Intell."},{"key":"3_CR4","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Barrett, C.W., Tinelli, C.: Satisfiability modulo theories. In: Handbook of Model Checking, pp. 305\u2013343 (2018)","DOI":"10.1007\/978-3-319-10575-8_11"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Belov, G., Stuckey, P.J., Tack, G., Wallace, M.: Improved linearization of constraint programming models. In: Principles and Practice of Constraint Programming, pp. 49\u201365 (2016)","DOI":"10.1007\/978-3-319-44953-1_4"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Biere, A.: Bounded model checking. In: Handbook of Satisfiability, 2nd edn, Frontiers in Artificial Intelligence and Applications, vol.\u00a0336, pp. 739\u2013764. IOS Press (2021)","DOI":"10.3233\/FAIA201002"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s10601-015-9184-z","volume":"20","author":"G Bj\u00f6rdal","year":"2015","unstructured":"Bj\u00f6rdal, G., Monette, J.-N., Flener, P., Pearson, J.: A constraint-based local search backend for MiniZinc. Constraints 20(3), 325\u2013345 (2015). https:\/\/doi.org\/10.1007\/s10601-015-9184-z","journal-title":"Constraints"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-70583-3_16","volume-title":"Automata, Languages and Programming","author":"M Bodirsky","year":"2008","unstructured":"Bodirsky, M., Grohe, M.: Non-dichotomies in constraint satisfaction complexity. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5126, pp. 184\u2013196. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70583-3_16"},{"issue":"1","key":"3_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s00607-020-00831-8","volume":"103","author":"M Boltenhagen","year":"2021","unstructured":"Boltenhagen, M., Chatain, T., Carmona, J.: Optimized SAT encoding of conformance checking artefacts. Computing 103(1), 29\u201350 (2021)","journal-title":"Computing"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/S0377-2217(98)00364-6","volume":"119","author":"SC Brailsford","year":"1999","unstructured":"Brailsford, S.C., Potts, C.N., Smith, B.M.: Constraint satisfaction problems: algorithms and applications. Eur. J. Oper. Res. 119(3), 557\u2013581 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-030-26619-6_12","volume-title":"Business Process Management","author":"D Calvanese","year":"2019","unstructured":"Calvanese, D., Ghilardi, S., Gianola, A., Montali, M., Rivkin, A.: Formal modeling and SMT-based parameterized verification of data-aware BPMN. In: Hildebrandt, T., van Dongen, B.F., R\u00f6glinger, M., Mendling, J. (eds.) BPM 2019. LNCS, vol. 11675, pp. 157\u2013175. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26619-6_12"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-319-10575-8_9","volume-title":"Handbook of Model Checking","author":"J Marques-Silva","year":"2018","unstructured":"Marques-Silva, J., Malik, S.: Propositional SAT Solving. In: Marques-Silva, J., Malik, S. (eds.) Handbook of Model Checking, pp. 247\u2013275. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_9"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-642-23059-2_3","volume-title":"Business Process Management","author":"E Damaggio","year":"2011","unstructured":"Damaggio, E., Deutsch, A., Hull, R., Vianu, V.: Automatic verification of data-centric business processes. In: Rinderle-Ma, S., Toumani, F., Wolf, K. (eds.) BPM 2011. LNCS, vol. 6896, pp. 3\u201316. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23059-2_3"},{"key":"3_CR15","volume-title":"Constraint Processing","author":"R Dechter","year":"2003","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2003)"},{"issue":"2","key":"3_CR16","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1145\/3212019.3212025","volume":"5","author":"A Deutsch","year":"2018","unstructured":"Deutsch, A., Hull, R., Li, Y., Vianu, V.: Automatic verification of database-centric systems. ACM SIGLOG News 5(2), 37\u201356 (2018)","journal-title":"ACM SIGLOG News"},{"key":"3_CR17","doi-asserted-by":"publisher","unstructured":"Dumas, M., La Rosa, M., Mendling, J., Reijers, H.A.: Process-aware information systems. In: umas, M., La Rosa, M., Mendling, J., Reijers, H.A. (eds.) Fundamentals of Business Process Management, pp. 341\u2013369. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-662-56509-4_9","DOI":"10.1007\/978-3-662-56509-4_9"},{"key":"3_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2023.102230","volume":"117","author":"P Felli","year":"2023","unstructured":"Felli, P., Gianola, A., Montali, M., Rivkin, A., Winkler, S.: Data-aware conformance checking with SMT. Inf. Syst. 117, 102230 (2023)","journal-title":"Inf. Syst."},{"issue":"3","key":"3_CR19","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/s10601-008-9047-y","volume":"13","author":"AM Frisch","year":"2008","unstructured":"Frisch, A.M., Harvey, W., Jefferson, C., Mart\u00ednez-Hern\u00e1ndez, B., Miguel, I.: Essence: a constraint language for specifying combinatorial problems. Constraints 13(3), 268\u2013306 (2008)","journal-title":"Constraints"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Fromherz, M.P.J.: Constraint-based scheduling. In: American Control Conference, ACC 2001, Arlington, VA, USA, 25\u201327 June, 2001, pp. 3231\u20133244. IEEE (2001)","DOI":"10.1109\/ACC.2001.946421"},{"key":"3_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2022.102011","volume":"107","author":"S Ghilardi","year":"2022","unstructured":"Ghilardi, S., Gianola, A., Montali, M., Rivkin, A.: Petri net-based object-centric processes with read-only data. Inf. Syst. 107, 102011 (2022)","journal-title":"Inf. Syst."},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Ghilardi, S., Gianola, A., Montali, M., Rivkin, A.: Safety verification and universal invariants for relational action bases. In: Proceedings of IJCAI 2023, pp. 3248\u20133257. ijcai.org (2023)","DOI":"10.24963\/ijcai.2023\/362"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Gianola, A.: Verification of Data-Aware Processes via Satisfiability Modulo Theories. LNBIP, vol.\u00a0470. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-42746-6","DOI":"10.1007\/978-3-031-42746-6"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Gianola, A., Montali, M., Winkler, S.: Linear-time verification of data-aware processes modulo theories via covers and automata. In: Proceedings of AAAI 2024, pp. 10525\u201310534. AAAI Press (2024)","DOI":"10.1609\/aaai.v38i9.28922"},{"key":"3_CR25","unstructured":"Goldblatt, R.: Logics of time and computation. Center for the Study of Language and Information, USA (1987)"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"de\u00a0Leoni, M., van\u00a0der Aalst, W.M.P.: Data-aware process mining: discovering decisions in processes using alignments. In: Proceedings of SAC 2013, pp. 1454\u20131461. ACM (2013)","DOI":"10.1145\/2480362.2480633"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Handbook of Satisfiability, 2nd edn, Frontiers in Artificial Intelligence and Applications, vol.\u00a0336, pp. 133\u2013182. IOS Press (2021)","DOI":"10.3233\/FAIA200987"},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-45069-6_1","volume-title":"Computer Aided Verification","author":"KL McMillan","year":"2003","unstructured":"McMillan, K.L.: Interpolation and SAT-based model checking. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 1\u201313. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-45069-6_1"},{"key":"3_CR29","doi-asserted-by":"crossref","unstructured":"McMillan, K.L.: Symbolic model checking. Kluwer (1993). https:\/\/doi.org\/10.1007\/978-1-4615-3190-6","DOI":"10.1007\/978-1-4615-3190-6"},{"issue":"2","key":"3_CR30","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/1646353.1646372","volume":"53","author":"SP Miller","year":"2010","unstructured":"Miller, S.P., Whalen, M.W., Cofer, D.D.: Software model checking takes off. Commun. ACM 53(2), 58\u201364 (2010)","journal-title":"Commun. ACM"},{"key":"3_CR31","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":"3_CR32","unstructured":"Perron, L., Didier, F., Gay, S.: The CP-SAT-LP solver. In: 29th International Conference on Principles and Practice of Constraint Programming (CP 2023). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a0280, pp. 3:1\u20133:2. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2023)"},{"key":"3_CR33","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(81)90110-9","volume":"13","author":"A Pnueli","year":"1981","unstructured":"Pnueli, A.: The temporal semantics of concurrent programs. Theor. Comput. Sci. 13, 45\u201360 (1981)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR34","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming, Foundations of Artificial Intelligence, vol.\u00a02. Elsevier, Amsterdam (2006)"},{"key":"3_CR35","unstructured":"Stuckey, P.J.: Minizinc for formal methods. In: Nadel, A., Rozier, K.Y. (eds.) Formal Methods in Computer-Aided Design, FMCAD 2023, Ames, IA, USA, 24\u201327 October 2023, p.\u00a01. IEEE (2023)"},{"issue":"2","key":"3_CR36","first-page":"55","volume":"35","author":"PJ Stuckey","year":"2014","unstructured":"Stuckey, P.J., Feydy, T., Schutt, A., Tack, G., Fischer, J.: The minizinc challenge 2008\u20132013. AI Mag. 35(2), 55\u201360 (2014)","journal-title":"AI Mag."},{"key":"3_CR37","unstructured":"Walsh, T.: SAT vs CSP: a commentary. CoRR abs\/1910.00128 (2019). http:\/\/arxiv.org\/abs\/1910.00128"},{"key":"3_CR38","doi-asserted-by":"crossref","unstructured":"Weske, M.: Business Process Management - Concepts, Languages, Architectures, 3rd edn. Springer, Cham (2019)","DOI":"10.1007\/978-3-662-59432-2_1"},{"key":"3_CR39","doi-asserted-by":"crossref","unstructured":"Wi\u015bniewski, P., Kluza, K., Jemio\u0142o, P., Lig\u0119za, A., Suchenia, A.: Business process recomposition as a way to redesign workflows effectively. In: Proceedings of FedCSIS 2021, pp. 471\u2013474. IEEE (2021)","DOI":"10.15439\/2021F138"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Wi\u015bniewski, P., Kluza, K., \u015ala\u017cy\u0144ski, M., Lig\u0119za, A.: Constraint-based composition of business process models. In: Proceedings of BPM 2017 (Workshops). Springer, Cham (2018)","DOI":"10.1007\/978-3-319-74030-0_9"}],"container-title":["Lecture Notes in Computer Science","Business Process Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-02867-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T05:37:27Z","timestamp":1757482647000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-02867-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,31]]},"ISBN":["9783032028662","9783032028679"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-02867-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,31]]},"assertion":[{"value":"31 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BPM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Business Process Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seville","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"31 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bpm2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.bpm2025seville.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}