乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T18:36:38Z","timestamp":1725820598887},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319171296"},{"type":"electronic","value":"9783319171302"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-17130-2_12","type":"book-chapter","created":{"date-parts":[[2015,4,15]],"date-time":"2015-04-15T06:20:11Z","timestamp":1429078811000},"page":"177-192","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Tableaux and Complexity Bounds for a Multiagent Justification Logic with Interacting Justifications"],"prefix":"10.1007","author":[{"given":"Antonis","family":"Achilleos","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,4,16]]},"reference":[{"issue":"6","key":"12_CR1","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1016\/j.jcss.2014.03.009","volume":"80","author":"A Achilleos","year":"2014","unstructured":"Achilleos, A.: A complexity question in justification logic. J. Comput. Syst. Sci. 80(6), 1038\u20131045 (2014)","journal-title":"J. Comput. Syst. Sci."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Achilleos, A.: Modal logics with hard diamond-free fragments. CoRR, abs\/1401.5846 (2014)","DOI":"10.1007\/978-3-319-27683-0_1"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-09764-0_1","volume-title":"Computational Logic in Multi-Agent Systems","author":"A Achilleos","year":"2014","unstructured":"Achilleos, A.: On the complexity of two-agent justification logic. In: Bulling, N., van der Torre, L., Villata, S., Jamroga, W., Vasconcelos, W. (eds.) CLIMA 2014. LNCS, vol. 8624, pp. 1\u201318. Springer, Heidelberg (2014)"},{"issue":"1","key":"12_CR4","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"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-87803-2_1","volume-title":"Logics in Artificial Intelligence","author":"S Artemov","year":"2008","unstructured":"Artemov, S.: Justification logic. In: H\u00f6lldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol. 5293, pp. 1\u20134. Springer, Heidelberg (2008)"},{"issue":"4","key":"12_CR6","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"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.apal.2013.07.003","volume":"165","author":"S Artemov","year":"2014","unstructured":"Artemov, S., Kuznets, R.: Logical omniscience as infeasibility. Ann. Pure Appl. Logic 165(1), 6\u201325 (2014). http:\/\/dx.doi.org\/10.1016\/j.apal.2013.07.003","journal-title":"Ann. Pure Appl. Logic"},{"issue":"7","key":"12_CR8","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1016\/j.apal.2011.09.010","volume":"163","author":"SR Buss","year":"2012","unstructured":"Buss, S.R., Kuznets, R.: Lower complexity bounds in justification logic. Ann. Pure Appl. Logic 163(7), 888\u2013905 (2012)","journal-title":"Ann. Pure Appl. Logic"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/10722086_17","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"S Demri","year":"2000","unstructured":"Demri, S.: Complexity of simple dependent bimodal logics. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS, vol. 1847, pp. 190\u2013204. Springer, Heidelberg (2000)"},{"issue":"1","key":"12_CR10","first-page":"239","volume":"75","author":"M Dziubi\u0144ski","year":"2007","unstructured":"Dziubi\u0144ski, M., Verbrugge, R., Dunin-K\u0229plicz, B.: Complexity issues in multiagent logics. Fundamenta Informaticae 75(1), 239\u2013262 (2007)","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"12_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.apal.2004.04.009","volume":"132","author":"M Fitting","year":"2005","unstructured":"Fitting, M.: The logic of proofs, semantically. Ann. Pure Appl. Logic 132(1), 1\u201325 (2005)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1\u20133","key":"12_CR12","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.tcs.2006.03.015","volume":"357","author":"NV Krupski","year":"2006","unstructured":"Krupski, N.V.: On the complexity of the reflected logic of proofs. Theor. Comput. Sci. 357(1\u20133), 136\u2013142 (2006)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/3-540-44622-2_25","volume-title":"Computer Science Logic","author":"R Kuznets","year":"2000","unstructured":"Kuznets, R.: On the complexity of explicit modal logics. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 371\u2013383. Springer, Heidelberg (2000). Errata concerning the explicit counterparts of $${\\cal D}$$ and $${\\cal D4}$$ are published as [15]"},{"key":"12_CR14","unstructured":"Kuznets, R.: Complexity Issues in Justification Logic. Ph.D. thesis, CUNY Graduate Center, May 2008"},{"key":"12_CR15","unstructured":"Kuznets, R.: Complexity through tableaux in justification logic. In: Plenary Talks, Tutorials, Special Sessions, Contributed Talks of Logic Colloquium (LC 2008), Bern, Switzerland, pp. 38\u201339 (2008)"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-540-79709-8_24","volume-title":"Computer Science \u2013 Theory and Applications","author":"R Kuznets","year":"2008","unstructured":"Kuznets, R.: Self-referentiality of justified knowledge. In: Hirsch, E.A., Razborov, A.A., Semenov, A., Slissenko, A. (eds.) Computer Science \u2013 Theory and Applications. LNCS, vol. 5010, pp. 228\u2013239. Springer, Heidelberg (2008)"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-35722-0_19","volume-title":"Logical Foundations of Computer Science","author":"R Kuznets","year":"2013","unstructured":"Kuznets, R., Studer, T.: Update as evidence: belief expansion. In: Artemov, S., Nerode, A. (eds.) LFCS 2013. LNCS, vol. 7734, pp. 266\u2013279. Springer, Heidelberg (2013)"},{"key":"12_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/3-540-63045-7_27","volume-title":"Logical Foundations of Computer Science","author":"A Mkrtychev","year":"1997","unstructured":"Mkrtychev, A.: Models for the logic of proofs. In: Adian, S., Nerode, A. (eds.) Logical Foundations of Computer Science. LNCS, vol. 1234, pp. 266\u2013275. Springer, Heidelberg (1997)"},{"key":"12_CR19","unstructured":"Pacuit, E.: A note on some explicit modal logics. In: Proceedings of the 5th Panhellenic Logic Symposium, Athens, Greece, University of Athens (2005)"},{"key":"12_CR20","unstructured":"Spaan, E.: Complexity of modal logics. Ph.D. thesis, University of Amsterdam (1993)"},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/s00224-007-9057-y","volume":"43","author":"T Yavorskaya (Sidon)","year":"2008","unstructured":"Yavorskaya (Sidon), T.: Interacting explicit evidence systems. Theor. Comput. Syst. 43(2), 272\u2013293 (2008)","journal-title":"Theor. Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17130-2_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T07:21:35Z","timestamp":1676445695000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17130-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319171296","9783319171302"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17130-2_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"16 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}