{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T05:56:40Z","timestamp":1777528600345,"version":"3.51.4"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031161025","type":"print"},{"value":"9783031161032","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16103-2_20","type":"book-chapter","created":{"date-parts":[[2022,9,6]],"date-time":"2022-09-06T21:05:56Z","timestamp":1662498356000},"page":"289-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Measuring Inconsistency in\u00a0Declarative Process Specifications"],"prefix":"10.1007","author":[{"given":"Carl","family":"Corea","sequence":"first","affiliation":[]},{"given":"John","family":"Grant","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"Thimm","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,7]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Cecconi, A., De Giacomo, G., Di Ciccio, C., Maggi, F.M., Mendling, J.: A temporal logic-based measurement framework for process mining. In: Proceedings of the 2nd ICPM, pp. 113\u2013120. IEEE (2020)","DOI":"10.1109\/ICPM49681.2020.00026"},{"key":"20_CR2","series-title":"Lecture Notes in Business Information Processing","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-85440-9_1","volume-title":"Business Process Management Forum","author":"C Corea","year":"2021","unstructured":"Corea, C., Nagel, S., Mendling, J., Delfmann, P.: Interactive and minimal repair of declarative process models. In: Polyvyanyy, A., Wynn, M.T., Van Looy, A., Reichert, M. (eds.) BPM 2021. LNBIP, vol. 427, pp. 3\u201319. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85440-9_1"},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/j.is.2016.09.005","volume":"64","author":"C Di Ciccio","year":"2017","unstructured":"Di Ciccio, C., Maggi, F.M., Montali, M., Mendling, J.: Resolving inconsistencies and redundancies in declarative process models. Inf. Syst. 64, 425\u2013446 (2017)","journal-title":"Inf. Syst."},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Fionda, V., Greco, G.: The complexity of LTL on finite traces: hard and easy fragments. In: Proceedings of the 30th AAAI Conference on AI, Phoenix, pp. 971\u2013977. AAAI (2016)","DOI":"10.1609\/aaai.v30i1.10104"},{"key":"20_CR5","unstructured":"Giacomo, G.D., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: Proceedings of the 23rd IJCAI, Beijing, pp. 854\u2013860. AAAI (2013)"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1080\/11663081.2021.1915688","volume":"31","author":"J Grant","year":"2021","unstructured":"Grant, J.: Measuring inconsistency in some branching time logics. J. Appl. Non-Classic. Logics 31, 85\u2013107 (2021)","journal-title":"J. Appl. Non-Classic. Logics"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-642-22152-1_31","volume-title":"Symbolic and Quantitative Approaches to Reasoning with Uncertainty","author":"J Grant","year":"2011","unstructured":"Grant, J., Hunter, A.: Measuring consistency gain and information loss in stepwise inconsistency resolution. In: Liu, W. (ed.) ECSQARU 2011. LNCS (LNAI), vol. 6717, pp. 362\u2013373. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22152-1_31"},{"key":"20_CR8","unstructured":"Grant, J., Martinez, M.V.: Measuring Inconsistency in Information. College Publication (2018)"},{"issue":"5\u20137","key":"20_CR9","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.jlap.2013.05.005","volume":"82","author":"T Hildebrandt","year":"2013","unstructured":"Hildebrandt, T., Mukkamala, R.R., Slaats, T., Zanitti, F.: Contracts for cross-organizational workflows as timed dynamic condition response graphs. J. Logic Algebr. Program. 82(5\u20137), 164\u2013185 (2013)","journal-title":"J. Logic Algebr. Program."},{"key":"20_CR10","first-page":"249","volume":"6","author":"A Hunter","year":"2006","unstructured":"Hunter, A., et al.: Shapley inconsistency values. KR 6, 249\u2013259 (2006)","journal-title":"KR"},{"key":"20_CR11","first-page":"358","volume":"8","author":"A Hunter","year":"2008","unstructured":"Hunter, A., et al.: Measuring inconsistency through minimal inconsistent sets. KR 8, 358\u2013366 (2008)","journal-title":"KR"},{"issue":"1","key":"20_CR12","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/A:1015015709557","volume":"31","author":"K Knight","year":"2002","unstructured":"Knight, K.: Measuring inconsistency. J. Philos. Logic 31(1), 77\u201398 (2002)","journal-title":"J. Philos. Logic"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Ly, L.T., Maggi, F.M., Montali, M., Rinderle-Ma, S., van der Aalst, W.M.: A framework for the systematic comparison and evaluation of compliance monitoring approaches. In: 17th IEEE EDOC, Vancouver, pp. 7\u201316. IEEE (2013)","DOI":"10.1109\/EDOC.2013.11"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-29860-8_11","volume-title":"Runtime Verification","author":"FM Maggi","year":"2012","unstructured":"Maggi, F.M., Westergaard, M., Montali, M., van der Aalst, W.M.P.: Runtime verification of LTL-based declarative process models. In: Khurshid, S., Sen, K. (eds.) RV 2011. Runtime verification of ltl-based declarative process models, vol. 7186, pp. 131\u2013146. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29860-8_11"},{"key":"20_CR15","volume-title":"Computational Complexity","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.: Computational Complexity. Addison-Wesley, Boston (1994)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Pesic, M., Schonenberg, H., Van der Aalst, W.M.: Declare: full support for loosely-structured processes. In: 11th IEEE EDOC, Annapolis, pp. 287\u2013287. IEEE (2007)","DOI":"10.1109\/EDOC.2007.14"},{"key":"20_CR17","unstructured":"Pill, I., Quaritsch, T.: Behavioral diagnosis of LTL specifications at operator level. In: 23rd International Joint Conference on Artificial Intelligence. Citeseer (2013)"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Symposium on Foundations of Computer Science, Rhode Island, pp. 46\u201357. IEEE Computer Society (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"20_CR19","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF00258428","volume":"8","author":"G Priest","year":"1979","unstructured":"Priest, G.: Logic of Paradox. J. Philos. Logic 8, 219\u2013241 (1979)","journal-title":"J. Philos. Logic"},{"key":"20_CR20","unstructured":"Roveri, M., Di Ciccio, C., Di Francescomarino, C., Ghidini, C.: Computing unsatisfiable cores for LTLf specifications (Preprint). arXiv (2022)"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-45005-1_18","volume-title":"Service-Oriented Computing","author":"D Solomakhin","year":"2013","unstructured":"Solomakhin, D., Montali, M., Tessaris, S., De Masellis, R.: Verification of artifact-centric systems: decidability and modeling issues. In: Basu, S., Pautasso, C., Zhang, L., Fu, X. (eds.) ICSOC 2013. LNCS, vol. 8274, pp. 252\u2013266. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-45005-1_18"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-030-35514-2_2","volume-title":"Scalable Uncertainty Management","author":"M Thimm","year":"2019","unstructured":"Thimm, M.: Inconsistency measurement. In: Ben Amor, N., Quost, B., Theobald, M. (eds.) SUM 2019. LNCS (LNAI), vol. 11940, pp. 9\u201323. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35514-2_2"},{"key":"20_CR23","first-page":"411","volume":"275","author":"M Thimm","year":"2019","unstructured":"Thimm, M., Wallner, J.P.: On the complexity of inconsistency measuring. AI. 275, 411\u2013456 (2019)","journal-title":"AI."},{"key":"20_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-45319-9_1","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"MY Vardi","year":"2001","unstructured":"Vardi, M.Y.: Branching vs. linear time: final showdown. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 1\u201322. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45319-9_1"}],"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-031-16103-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T16:10:56Z","timestamp":1710259856000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16103-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031161025","9783031161032"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16103-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"7 September 2022","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":"M\u00fcnster","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bpm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/bpm2022.uni-muenster.de","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"98","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"For the BPM Forum 13 papers have been accepted out of the total of 98 submissions. The Blockchain, RPA and CEE Forum accepted 20 papers out of a total of 40 submissions.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}