{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:43:45Z","timestamp":1743007425029,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030510732"},{"type":"electronic","value":"9783030510749"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-51074-9_28","type":"book-chapter","created":{"date-parts":[[2020,6,29]],"date-time":"2020-06-29T22:02:47Z","timestamp":1593468167000},"page":"482-499","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["NP Reasoning in the Monotone $$\\mu $$-Calculus"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Hausmann","sequence":"first","affiliation":[]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,24]]},"reference":[{"volume-title":"The Description Logic Handbook","year":"2003","key":"28_CR1","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2003)"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Bradfield, J., Stirling, C.: Modal $$\\mu $$-calculi. In: Handbook of Modal Logic, pp. 721\u2013756. Elsevier (2006)","DOI":"10.1016\/S1570-2464(07)80015-2"},{"issue":"2","key":"28_CR3","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1093\/jigpal\/jzu030","volume":"23","author":"F Bruse","year":"2015","unstructured":"Bruse, F., Friedmann, O., Lange, M.: On guarded transformation in the modal $$\\mu $$-calculus. Log. J. IGPL 23(2), 194\u2013216 (2015)","journal-title":"Log. J. IGPL"},{"key":"28_CR4","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":"28_CR5","doi-asserted-by":"crossref","unstructured":"C\u00eerstea, C., Kupke, C., Pattinson, D.: EXPTIME tableaux for the coalgebraic $$\\mu $$-calculus. Log. Methods Comput. Sci. 7(3:03), 1\u201333 (2011)","DOI":"10.2168\/LMCS-7(3:3)2011"},{"key":"28_CR6","unstructured":"Donini, F.: Complexity of reasoning. In: Baader, F., et al. [1], pp. 96\u2013136"},{"key":"28_CR7","doi-asserted-by":"crossref","unstructured":"Enqvist, S., Hansen, H.H., Kupke, C., Marti, J., Venema, Y.: Completeness for game logic. In: Logic in Computer Science (LICS 2019), pp. 1\u201313. IEEE (2019)","DOI":"10.1109\/LICS.2019.8785676"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Enqvist, S., Seifan, F., Venema, Y.: Monadic second-order logic and bisimulation invariance for coalgebras. In: Logic in Computer Science (LICS 2015), pp. 353\u2013365. IEEE (2015)","DOI":"10.1109\/LICS.2015.41"},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0022-0000(79)90046-1","volume":"18","author":"M Fischer","year":"1979","unstructured":"Fischer, M., Ladner, R.: Propositional dynamic logic of regular programs. J. Comput. Syst. Sci. 18, 194\u2013211 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"28_CR10","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1080\/11663081.2013.861181","volume":"23","author":"O Friedmann","year":"2013","unstructured":"Friedmann, O., Lange, M.: Deciding the unguarded modal $$\\rm \\mu $$-calculus. J. Appl. Non-Classical Log. 23, 353\u2013371 (2013)","journal-title":"J. Appl. Non-Classical Log."},{"key":"28_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1093\/logcom\/2.1.5","volume":"2","author":"V Goranko","year":"1992","unstructured":"Goranko, V., Passy, S.: Using the universal modality: gains and questions. J. Log. Comput. 2, 5\u201330 (1992)","journal-title":"J. Log. Comput."},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Hansen, H., Kupke, C.: A coalgebraic perspective on monotone modal logic. In: Ad\u00e1mek, J., Milius, S. (eds.) Coalgebraic Methods in Computer Science (CMCS 2004) of ENTCS, vol. 106, pp. 121\u2013143. Elsevier (2004)","DOI":"10.1016\/j.entcs.2004.02.028"},{"key":"28_CR13","unstructured":"Hausmann, D., Schr\u00f6der, L., Egger, C.: Global caching for the alternation-free coalgebraic $$\\mu $$-calculus. In: Concurrency Theory (CONCUR 2016) of LIPIcs, vol. 59, pp. 34:1\u201334:15. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"issue":"1","key":"28_CR14","doi-asserted-by":"publisher","first-page":"99","DOI":"10.2307\/2586754","volume":"64","author":"M Kracht","year":"1999","unstructured":"Kracht, M., Wolter, F.: Normal monomodal logics can simulate all others. J. Symb. Log. 64(1), 99\u2013138 (1999)","journal-title":"J. Symb. Log."},{"key":"28_CR15","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1137\/0206033","volume":"6","author":"R Ladner","year":"1977","unstructured":"Ladner, R.: The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput. 6, 467\u2013480 (1977)","journal-title":"SIAM J. Comput."},{"key":"28_CR16","unstructured":"Lange, M., Stirling, C.: Focus games for satisfiability and completeness of temporal logic. In: Logic in Computer Science (LICS 2001), pp. 357\u2013365. IEEE Computer Society (2001)"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/3-540-36387-4_2","volume-title":"Automata Logics, and Infinite Games","author":"R Mazala","year":"2002","unstructured":"Mazala, R.: Infinite games. In: Gr\u00e4del, E., Thomas, W., Wilke, T. (eds.) Automata Logics, and Infinite Games. LNCS, vol. 2500, pp. 23\u201338. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36387-4_2"},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(84)90049-5","volume":"32","author":"S Miyano","year":"1984","unstructured":"Miyano, S., Hayashi, T.: Alternating finite automata on $$\\omega $$-words. Theory Comput. Sci. 32, 321\u2013330 (1984)","journal-title":"Theory Comput. Sci."},{"key":"28_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(95)00136-0","volume":"163","author":"D Niwinski","year":"1996","unstructured":"Niwinski, D., Walukiewicz, I.: Games for the $$\\mu $$-calculus. Theory Comput. Sci. 163, 99\u2013116 (1996)","journal-title":"Theory Comput. Sci."},{"key":"28_CR20","first-page":"111","volume":"24","author":"R Parikh","year":"1985","unstructured":"Parikh, R.: The logic of games and its applications. Ann. Discrete Math. 24, 111\u2013140 (1985)","journal-title":"Ann. Discrete Math."},{"key":"28_CR21","unstructured":"Pauly, M.: Bisimulation for general non-normal modal logic. Unpublished manuscript (1999)"},{"key":"28_CR22","unstructured":"Pauly, M.: Logic for social software. Ph.D. thesis, Universiteit van Amsterdam (2001)"},{"issue":"2","key":"28_CR23","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1027354826364","volume":"75","author":"M Pauly","year":"2003","unstructured":"Pauly, M., Parikh, R.: Game logic - an overview. Stud. Log. 75(2), 165\u2013182 (2003)","journal-title":"Stud. Log."},{"key":"28_CR24","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1145\/23005.23008","volume":"34","author":"D Peleg","year":"1987","unstructured":"Peleg, D.: Concurrent dynamic logic. J. ACM 34, 450\u2013479 (1987)","journal-title":"J. ACM"},{"key":"28_CR25","doi-asserted-by":"crossref","unstructured":"Pratt, V.: A decidable mu-calculus: preliminary report. In: Foundations of Computer Science (FOCS 1981), pp. 421\u2013427. IEEE Computer Society (1981)","DOI":"10.1109\/SFCS.1981.4"},{"issue":"4","key":"28_CR26","doi-asserted-by":"publisher","first-page":"719","DOI":"10.1007\/s11225-018-9825-5","volume":"107","author":"J van Benthem","year":"2019","unstructured":"van Benthem, J., Bezhanishvili, N., Enqvist, S.: A propositional dynamic logic for instantial neighborhood semantics. Stud. Log. 107(4), 719\u2013751 (2019)","journal-title":"Stud. Log."},{"key":"28_CR27","unstructured":"Vardi, M.: On the complexity of epistemic reasoning. In: Logic in Computer Science (LICS 1989), pp. 243\u2013252. IEEE Computer Society (1989)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51074-9_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T21:34:52Z","timestamp":1656797692000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-51074-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030510732","9783030510749"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51074-9_28","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":"24 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCAR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Automated Reasoning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"1 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcar2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ijcar2020.org\/","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":"150","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":"46","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":"5","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":"31% - 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.03","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":"7.38","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)"}},{"value":"11 system descriptions are also included. The conference was held virtually due to the COVID-19 pandemic.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}