{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T07:15:44Z","timestamp":1760080544637,"version":"3.37.3"},"reference-count":63,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,29]],"date-time":"2021-06-29T00:00:00Z","timestamp":1624924800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000288","name":"Royal Society","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000288","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,6,29]]},"DOI":"10.1109\/lics52264.2021.9470597","type":"proceedings-article","created":{"date-parts":[[2021,7,7]],"date-time":"2021-07-07T20:14:07Z","timestamp":1625688847000},"page":"1-14","source":"Crossref","is-referenced-by-count":6,"title":["Responsibility and verification: Importance value in temporal logics"],"prefix":"10.1109","author":[{"given":"Corto","family":"Mascle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christel","family":"Baier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Funke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Jantsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Kiefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.05.003"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.2.257"},{"key":"ref33","first-page":"4768","article-title":"A unified approach to interpreting model predictions","author":"lundberg","year":"2017","journal-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems ser NeurIPS’17"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-011-0132-2"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/10722167_17"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-005-0202-0"},{"key":"ref37","first-page":"592","article-title":"Strategic responsibility under imperfect information","author":"yazdanpanah","year":"2019","journal-title":"Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS)"},{"article-title":"Game-theoretic network centrality: A review","year":"2017","author":"tarkowski","key":"ref36"},{"key":"ref35","first-page":"9269","article-title":"The many shapley values for model explanation","volume":"119","author":"sundararajan","year":"2020","journal-title":"Proceedings of the 37th International Conference on Machine Learning ser Proceedings of Machine Learning Research"},{"key":"ref34","article-title":"Consistent individualized feature attribution for tree ensembles","author":"lundberg","year":"2018","journal-title":"Tech Rep"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0016"},{"key":"ref62","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","article-title":"Complete sets and the polynomial-time hierarchy","volume":"3","author":"wrathall","year":"1976","journal-title":"Theoretical Computer Science"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90061-X"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(94)90086-8"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2003.1240292"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44829-2_8"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24730-2_8"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/bjps\/axi147"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1352582.1352588"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45657-0_39"},{"key":"ref22","first-page":"10:1","article-title":"Coverage and Vacuity in Network Formation Games","author":"bielous","year":"0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/FMCAD.2008.ECP.29"},{"article-title":"Responsibility and verification: Importance value in temporal logics","year":"0","author":"mascle","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/DAC.1995.249985"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/587051.587053"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/604131.604140"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24372-1_17"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00150-1"},{"key":"ref58","first-page":"1093","article-title":"A polynomial algorithm in linear programming","volume":"244","author":"khachiyan","year":"1979","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.69"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.2307\/1969529"},{"journal-title":"Game Theory","year":"2013","author":"owen","key":"ref55"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45309-1_11"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78499-9_9"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22993-0_9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/11549345_43"},{"key":"ref11","article-title":"Modular synthesis of reactive systems","author":"rosner","year":"1992","journal-title":"PhD diss Ph D thesis"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3235026"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1016\/j.artint.2005.12.003","article-title":"Causes and explanations in the structural-model approach: Tractable cases","volume":"170","author":"eiter","year":"2006","journal-title":"Artificial Intelligence"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00271-0"},{"key":"ref14","first-page":"300","article-title":"Coverage estimation for symbolic model checking","author":"hoskote","year":"0","journal-title":"Proceedings of the 36th Annual ACM\/IEEE Design Automation Conference"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44585-4_7"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45319-9_36"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-004-0175-4"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63166-6_28"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48153-2_8"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1391"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/bjps\/axi148"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(81)90039-8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1515\/9781400881970-018"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56922-7_32"},{"key":"ref7","first-page":"328","article-title":"The complexity of tree automata and logics of programs (extended abstract)","author":"emerson","year":"0"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/BF01753703"},{"key":"ref9","first-page":"235","article-title":"Explicit Muller Games are PTIME","author":"horn","year":"0"},{"journal-title":"Principles of Model Checking","year":"2008","author":"baier","key":"ref46"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/B978-044450813-3\/50026-6"},{"journal-title":"Computational Complexity","year":"2007","author":"papadimitriou","key":"ref48"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36387-4"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1201\/9781351241410"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/s10458-019-09429-7","article-title":"Partition decision trees: representation for efficient computation of the Shapley value extended to games with externalities","volume":"34","author":"skibski","year":"2020","journal-title":"Autonomous Agents and Multi-Agent Systems"},{"key":"ref44","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/978-3-319-63121-9_3","article-title":"30 Years of Modal Transition Systems: Survey of Extensions and Analysis","author":"k?et\u00ednsk\u00fd","year":"2017","journal-title":"Models Algorithms Logics and Tools Essays Dedicated to Kim Guldstrand Larsen on the Occasion of His 60th Birthday"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1988.5119"}],"event":{"name":"2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","start":{"date-parts":[[2021,6,29]]},"location":"Rome, Italy","end":{"date-parts":[[2021,7,2]]}},"container-title":["2021 36th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9470497\/9470501\/09470597.pdf?arnumber=9470597","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T15:46:21Z","timestamp":1652197581000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9470597\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,29]]},"references-count":63,"URL":"https:\/\/doi.org\/10.1109\/lics52264.2021.9470597","relation":{},"subject":[],"published":{"date-parts":[[2021,6,29]]}}}