{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T18:17:35Z","timestamp":1726078655321},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030446376"},{"type":"electronic","value":"9783030446383"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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-44638-3_3","type":"book-chapter","created":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T21:02:41Z","timestamp":1585342961000},"page":"42-57","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Semirings of Evidence"],"prefix":"10.1007","author":[{"given":"Michael","family":"Baur","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Studer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,3,28]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Afshari, B., Leigh, G.E.: Cut-free completeness for modal mu-calculus. In: 2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), pp. 1\u201312 (2017)","DOI":"10.1109\/LICS.2017.8005088"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/3-540-45504-3_2","volume-title":"Proof Theory in Computer Science","author":"J Alt","year":"2001","unstructured":"Alt, J., Artemov, S.: Reflective $$\\lambda $$-calculus. In: Kahle, R., Schroeder-Heister, P., St\u00e4rk, R. (eds.) PTCS 2001. LNCS, vol. 2183, pp. 22\u201337. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45504-3_2"},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"346","DOI":"10.14778\/2095686.2095693","volume":"5","author":"Y Amsterdamer","year":"2011","unstructured":"Amsterdamer, Y., Davidson, S.B., Deutch, D., Milo, T., Stoyanovich, J., Tannen, V.: Putting lipstick on pig: enabling database-style workflow provenance. Proc. VLDB Endow. 5(4), 346\u2013357 (2011)","journal-title":"Proc. VLDB Endow."},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Amsterdamer, Y., Deutch, D., Tannen, V.: Provenance for aggregate queries. In: Proceedings of the Thirtieth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2011, pp. 153\u2013164. ACM (2011)","DOI":"10.1145\/1989284.1989302"},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2687821","volume":"7","author":"S Artemov","year":"2001","unstructured":"Artemov, S.: Explicit provability and constructive semantics. Bull. Symbolic Logic 7(1), 1\u201336 (2001)","journal-title":"Bull. Symbolic Logic"},{"issue":"1\u20133","key":"3_CR6","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.tcs.2006.03.009","volume":"357","author":"S Artemov","year":"2006","unstructured":"Artemov, S.: Justified common knowledge. Theoret. Comput. Sci. 357(1\u20133), 4\u201322 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"3_CR7","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1017\/S1755020308090060","volume":"1","author":"S Artemov","year":"2008","unstructured":"Artemov, S.: The logic of justification. Rev. Symbolic Logic 1(4), 477\u2013513 (2008)","journal-title":"Rev. Symbolic Logic"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-15025-8_3","volume-title":"Fields of Logic and Computation","author":"S Artemov","year":"2010","unstructured":"Artemov, S.: Tracking evidence. In: Blass, A., Dershowitz, N., Reisig, W. (eds.) Fields of Logic and Computation. LNCS, vol. 6300, pp. 61\u201374. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-15025-8_3"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-319-27683-0_3","volume-title":"Logical Foundations of Computer Science","author":"S Artemov","year":"2016","unstructured":"Artemov, S.: On aggregating probabilistic evidence. In: Artemov, S., Nerode, A. (eds.) LFCS 2016. LNCS, vol. 9537, pp. 27\u201342. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-27683-0_3"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-540-72734-7_2","volume-title":"Logical Foundations of Computer Science","author":"S Artemov","year":"2007","unstructured":"Artemov, S., Bonelli, E.: The intensional lambda calculus. In: Artemov, S.N., Nerode, A. (eds.) LFCS 2007. LNCS, vol. 4514, pp. 12\u201325. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-72734-7_2"},{"key":"3_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/9781108348034","volume-title":"Justification Logic: Reasoning with Reasons","author":"S Artemov","year":"2019","unstructured":"Artemov, S., Fitting, M.: Justification Logic: Reasoning with Reasons. Cambridge University Press, Cambridge (2019)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/11874683_9","volume-title":"Computer Science Logic","author":"S Artemov","year":"2006","unstructured":"Artemov, S., Kuznets, R.: Logical omniscience via proof complexity. In: \u00c9sik, Z. (ed.) CSL 2006. LNCS, vol. 4207, pp. 135\u2013149. Springer, Heidelberg (2006). \nhttps:\/\/doi.org\/10.1007\/11874683_9"},{"key":"3_CR13","unstructured":"Artemov, S., Kuznets, R.: Logical omniscience as a computational complexity problem. In: Heifetz, A. (ed.) Proceedings of the Twelfth Conference Theoretical Aspects of Rationality and Knowledge (TARK 2009), pp. 14\u201323, Stanford University, California, 6\u20138 July 2009. ACM (2009)"},{"issue":"1","key":"3_CR14","first-page":"6","volume":"165","author":"S Artemov","year":"2014","unstructured":"Artemov, S., Kuznets, R.: Logical omniscience as infeasibility. APAL 165(1), 6\u201325 (2014)","journal-title":"APAL"},{"issue":"1","key":"3_CR15","first-page":"49","volume":"165","author":"A Baltag","year":"2014","unstructured":"Baltag, A., Renne, B., Smets, S.: The logic of justified belief, explicit knowledge, and conclusive evidence. APAL 165(1), 49\u201381 (2014)","journal-title":"APAL"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-319-94821-8_8","volume-title":"Interactive Theorem Proving","author":"C Baston","year":"2018","unstructured":"Baston, C., Capretta, V.: The coinductive formulation of common knowledge. In: Avigad, J., Mahboubi, A. (eds.) ITP 2018. LNCS, vol. 10895, pp. 126\u2013141. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-94821-8_8"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Bucheli, S., Kuznets, R., Studer, T.: Two ways to common knowledge. In: Bolander, T., Bra\u00fcner, T. (eds.) Proceedings of M4M\u20136. ENTCS, vol. 262, pp. 83\u201398. Elsevier (2010)","DOI":"10.1016\/j.entcs.2010.04.007"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"35","DOI":"10.3166\/jancl.21.35-60","volume":"21","author":"S Bucheli","year":"2011","unstructured":"Bucheli, S., Kuznets, R., Studer, T.: Justifications for common knowledge. J. Appl. Non-Class. Log. 21(1), 35\u201360 (2011)","journal-title":"J. Appl. Non-Class. Log."},{"issue":"4","key":"3_CR19","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s00778-015-0390-5","volume":"24","author":"D Deutch","year":"2015","unstructured":"Deutch, D., Moskovitch, Y., Tannen, V.: Provenance-based analysis of data-centric processes. VLDB J. 24(4), 583\u2013607 (2015). \nhttps:\/\/doi.org\/10.1007\/s00778-015-0390-5","journal-title":"VLDB J."},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Foster, J.N., Green, T.J., Tannen, V.: Annotated XML: queries and provenance. In: Proceedings of the Twenty-seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, pp. 271\u2013280. ACM (2008)","DOI":"10.1145\/1376916.1376954"},{"issue":"1","key":"3_CR21","first-page":"1","volume":"63","author":"Geerts, F., Unger, T., Karvounarakis, G., Fundulaki, I., Christophides, V.","year":"2016","unstructured":"Geerts, F., Unger, T., Karvounarakis, G., Fundulaki, I., Christophides, V.: Algebraic structures for capturing the provenance of SPARQL queries. J. ACM 63(1), 1\u201363 (2016)","journal-title":"J. ACM"},{"issue":"5","key":"3_CR22","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1093\/jigpal\/jzw019","volume":"24","author":"M Ghari","year":"2016","unstructured":"Ghari, M.: Pavelka-style fuzzy justification logics. Logic J. IGPL 24(5), 743\u2013773 (2016)","journal-title":"Logic J. IGPL"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Green, T.J.: Containment of conjunctive queries on annotated relations. In: Proceedings of the 12th International Conference on Database Theory, ICDT 2009, pp. 296\u2013309. ACM (2009)","DOI":"10.1145\/1514894.1514930"},{"issue":"2","key":"3_CR24","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/s00224-011-9323-x","volume":"49","author":"TJ Green","year":"2011","unstructured":"Green, T.J., Ives, Z.G., Tannen, V.: Reconcilable differences. Theory Comput. Syst. 49(2), 460\u2013488 (2011)","journal-title":"Theory Comput. Syst."},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Green, T.J., Karvounarakis, G., Tannen, V.: Provenance semirings. In: Proceedings of the Twenty-Sixth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 31\u201340. ACM (2007)","DOI":"10.1145\/1265530.1265535"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Green, T.J., Tannen, V.: The semiring framework for database provenance. In: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 93\u201399. ACM (2017)","DOI":"10.1145\/3034786.3056125"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1007\/978-3-642-59136-5_9","volume-title":"Handbook of Formal Languages, vol. 1","author":"W Kuich","year":"1997","unstructured":"Kuich, W.: Semirings and formal power series: their relevance to formal languages and automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 609\u2013677. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/978-3-642-59136-5_9"},{"key":"3_CR28","unstructured":"Kuznets, R.: A note on the use of sum in the Logic of Proofs. In: Drossos, C., Peppas, P., Tsinakis, C. (eds.) Proceedings of the 7th Panhellenic Logic Symposium, 15\u201319 July 2009, pp. 99\u2013103. Patras University Press, Patras University, Patras (2009)"},{"issue":"3","key":"3_CR29","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1093\/jigpal\/jzw002","volume":"24","author":"R Kuznets","year":"2016","unstructured":"Kuznets, R., Studer, T.: Weak arithmetical interpretations for the Logic of Proofs. Logic J. IGPL 24(3), 424\u2013440 (2016)","journal-title":"Logic J. IGPL"},{"key":"3_CR30","unstructured":"Kuznets, R., Studer, T.: Logics of Proofs and Justifications. College Publications, London (2019)"},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-662-59533-6_26","volume-title":"Logic, Language, Information, and Computation","author":"E Lehmann","year":"2019","unstructured":"Lehmann, E., Studer, T.: Subset models for justification logic. In: Iemhoff, R., Moortgat, M., de Queiroz, R. (eds.) WoLLIC 2019. LNCS, vol. 11541, pp. 433\u2013449. Springer, Heidelberg (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-662-59533-6_26"},{"key":"3_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-030-36755-8_6","volume-title":"Logical Foundations of Computer Science","author":"E Lehmann","year":"2020","unstructured":"Lehmann, E., Studer, T.: Belief expansion in subset models. In: Artemov, S., Nerode, A. (eds.) LFCS 2020. LNCS, vol. 11972, pp. 85\u201397. Springer, Cham (2020). \nhttps:\/\/doi.org\/10.1007\/978-3-030-36755-8_6"},{"key":"3_CR33","unstructured":"Lehmann, E., Studer, T.: Exploring subset models for justification logic (submitted)"},{"issue":"9","key":"3_CR34","doi-asserted-by":"publisher","first-page":"1344","DOI":"10.1070\/SM8667","volume":"207","author":"D Shamkanov","year":"2016","unstructured":"Shamkanov, D.: A realization theorem for the G\u00f6del-L\u00f6b provability logic. Sbornik Math. 207(9), 1344\u20131360 (2016)","journal-title":"Sbornik Math."},{"issue":"3","key":"3_CR35","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s11225-008-9133-6","volume":"89","author":"T Studer","year":"2008","unstructured":"Studer, T.: On the proof theory of the modal mu-calculus. Studia Logica 89(3), 343\u2013363 (2008). \nhttps:\/\/doi.org\/10.1007\/s11225-008-9133-6","journal-title":"Studia Logica"},{"issue":"2","key":"3_CR36","doi-asserted-by":"publisher","first-page":"388","DOI":"10.2178\/jsl.7802030","volume":"78","author":"T Studer","year":"2013","unstructured":"Studer, T.: Decidability for some justification logics with negative introspection. J. Symbolic Logic 78(2), 388\u2013402 (2013)","journal-title":"J. Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Logic and Argumentation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-44638-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,28]],"date-time":"2020-03-28T03:07:19Z","timestamp":1585364839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-44638-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030446376","9783030446383"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-44638-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CLAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Logic and Argumentation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hangzhou","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"clar2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.xixilogic.org\/events\/clar2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}