乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T13:57:43Z","timestamp":1726063063180},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030367541"},{"type":"electronic","value":"9783030367558"}],"license":[{"start":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T00:00:00Z","timestamp":1576800000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,12,20]],"date-time":"2019-12-20T00:00:00Z","timestamp":1576800000000},"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-36755-8_3","type":"book-chapter","created":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T20:04:49Z","timestamp":1576267489000},"page":"27-46","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Countermodel Construction via Optimal Hypersequent Calculi for Non-normal Modal Logics"],"prefix":"10.1007","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-7153-0506","authenticated-orcid":false,"given":"Tiziano","family":"Dalmonte","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-5335-1838","authenticated-orcid":false,"given":"Bj\u00f6rn","family":"Lellmann","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6254-3754","authenticated-orcid":false,"given":"Nicola","family":"Olivetti","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-7113-0801","authenticated-orcid":false,"given":"Elaine","family":"Pimentel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,12,20]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1080\/11663081.2016.1214804","volume":"26","author":"D Askounis","year":"2016","unstructured":"Askounis, D., Koutras, C.D., Zikos, Y.: Knowledge means \u201call\u201d, belief means \u201cmost\u201d. J. Appl. Non-Class. Logics 26(3), 173\u2013192 (2016)","journal-title":"J. Appl. Non-Class. Logics"},{"key":"3_CR2","doi-asserted-by":"crossref","unstructured":"Avron, A.: The method of hypersequents in the proof theory of propositional non-classical logics. In: Logic: From Foundations to Applications. Clarendon P. (1996)","DOI":"10.1093\/oso\/9780198538622.003.0001"},{"key":"3_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511621192","volume-title":"Modal Logic","author":"BF Chellas","year":"1980","unstructured":"Chellas, B.F.: Modal Logic. Cambridge University Press, Cambridge (1980)"},{"key":"3_CR4","unstructured":"Dalmonte, T., Olivetti, N., Negri, S.: Non-normal modal logics: bi-neighbourhood semantics and its labelled calculi. In: Proceedings of AiML (2018)"},{"key":"3_CR5","unstructured":"Dalmonte, T., Olivetti, N., Negri, S.: Bi-neighbourhood semantics and labelled sequent calculi for non-normal modal logics. Part 1 (draft) (2019). http:\/\/www.lsis.org\/olivetti\/TR2019\/TR-BINS.pdf"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Dalmonte, T., Olivetti, N., Negri, S., Pozzato, G.L.: PRONOM: proof-search and countermodel generation for non-normal modal logics. In: Proceedings of AIIA (2019, to appear)","DOI":"10.1007\/978-3-030-35166-3_12"},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s11225-014-9556-1","volume":"103","author":"D Gilbert","year":"2015","unstructured":"Gilbert, D., Maffezioli, P.: Modular sequent calculi for classical modal logics. Studia Logica 103(1), 175\u2013217 (2015)","journal-title":"Studia Logica"},{"key":"3_CR8","first-page":"241","volume":"1","author":"L Goble","year":"2013","unstructured":"Goble, L.: Prima facie norms, normative conflicts, and dilemmas. Handb. Deontic Logic Normative Syst. 1, 241\u2013352 (2013)","journal-title":"Handb. Deontic Logic Normative Syst."},{"issue":"3","key":"3_CR9","first-page":"151","volume":"34","author":"A Indrzejczak","year":"2005","unstructured":"Indrzejczak, A.: Sequent calculi for monotonic modal logics. Bull. Section Logic 34(3), 151\u2013164 (2005)","journal-title":"Bull. Section Logic"},{"key":"3_CR10","first-page":"189","volume":"21","author":"A Indrzejczak","year":"2011","unstructured":"Indrzejczak, A.: Admissibility of cut in congruent modal logics. Logic Logical Philos. 21, 189\u2013203 (2011)","journal-title":"Logic Logical Philos."},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1026753129680","volume":"65","author":"R Lavendhomme","year":"2000","unstructured":"Lavendhomme, R., Lucas, T.: Sequent calculi and decision procedures for weak modal systems. Studia Logica 65, 121\u2013145 (2000)","journal-title":"Studia Logica"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-030-29026-9_12","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"B Lellmann","year":"2019","unstructured":"Lellmann, B.: Combining monotone and normal modal logic in nested sequents \u2013 with countermodels. In: Cerrito, S., Popescu, A. (eds.) TABLEAUX 2019. LNCS (LNAI), vol. 11714, pp. 203\u2013220. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29026-9_12"},{"issue":"2","key":"3_CR13","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/3288757","volume":"20","author":"B Lellmann","year":"2019","unstructured":"Lellmann, B., Pimentel, E.: Modularisation of sequent calculi for normal and non-normal modalities. ACM Trans. Comput. Logic 20(2), 7:1\u20137:46 (2019)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"4","key":"3_CR14","first-page":"1241","volume":"4","author":"S Negri","year":"2017","unstructured":"Negri, S.: Proof theory for non-normal modal logics: the neighbourhood formalism and basic results. IfCoLog J. Log. Appl 4(4), 1241\u20131286 (2017)","journal-title":"IfCoLog J. Log. Appl"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Orlandelli, E.: Sequent calculi and interpolation for non-normal logics. arXiv preprint arXiv:1903.11342 (2019)","DOI":"10.12775\/LLP.2020.018"},{"key":"3_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-67149-9","volume-title":"Neighborhood Semantics for Modal Logic","author":"E Pacuit","year":"2017","unstructured":"Pacuit, E.: Neighborhood Semantics for Modal Logic. Springer, Heidelberg (2017)"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Pattinson, D.: The logic of exact covers: completeness and uniform interpolation. In: LICS 2013 (2013)","DOI":"10.1109\/LICS.2013.48"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/logcom\/12.1.149","volume":"12","author":"M Pauly","year":"2002","unstructured":"Pauly, M.: A modal logic for coalitional power in games. J. Log. Comput. 12(1), 149\u2013166 (2002)","journal-title":"J. Log. Comput."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: On epistemic logic and logical omniscience. In: Theoretical Aspects of Reasoning About Knowledge, pp. 293\u2013305. Elsevier (1986)","DOI":"10.1016\/B978-0-934613-04-0.50024-7"},{"key":"3_CR20","unstructured":"Vardi, M.Y.: On the complexity of epistemic reasoning. In: Proceedings of 4th IEEE Symposium on Logic in Computer Science, pp. 243\u2013252 (1989)"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-36755-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,28]],"date-time":"2024-07-28T16:10:24Z","timestamp":1722183024000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-36755-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,12,20]]},"ISBN":["9783030367541","9783030367558"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-36755-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019,12,20]]},"assertion":[{"value":"20 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LFCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logical Foundations of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Deerfield Beach, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"4 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lfcs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lfcs.ws.gc.cuny.edu\/lfcs-2020\/","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":"30","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":"17","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":"57% - 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":"3.3","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.7","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}