{"oa_version":"Published Version","volume":23,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"page":"563 - 577","publist_id":"4708","title":"Elementary modal logics over transitive structures","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"4929","creator":"system","file_size":454915,"file_name":"IST-2016-136-v1+2_39.pdf","checksum":"e0732e73a8b1e39483df7717d53e3e35","date_updated":"2020-07-14T12:45:34Z","relation":"main_file","date_created":"2018-12-12T10:12:11Z","content_type":"application/pdf","access_level":"open_access"}],"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"name":"Quantitative Reactive Modeling","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"month":"09","type":"conference","date_published":"2013-09-01T00:00:00Z","pubrep_id":"136","date_updated":"2020-08-11T10:09:42Z","language":[{"iso":"eng"}],"abstract":[{"text":"We show that modal logic over universally first-order definable classes of transitive frames is decidable. More precisely, let K be an arbitrary class of transitive Kripke frames definable by a universal first-order sentence. We show that the global and finite global satisfiability problems of modal logic over K are decidable in NP, regardless of choice of K. We also show that the local satisfiability and the finite local satisfiability problems of modal logic over K are decidable in NEXPTIME.","lang":"eng"}],"has_accepted_license":"1","series_title":"Leibniz International Proceedings in Informatics","_id":"2243","doi":"10.4230/LIPIcs.CSL.2013.563","alternative_title":["LIPIcs"],"ddc":["000","004"],"department":[{"_id":"ToHe"}],"conference":{"name":"CSL: Computer Science Logic","end_date":"2013-09-05","start_date":"2013-09-02","location":"Torino, Italy"},"intvolume":"        23","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","scopus_import":1,"author":[{"full_name":"Michaliszyn, Jakub","first_name":"Jakub","last_name":"Michaliszyn"},{"last_name":"Otop","first_name":"Jan","full_name":"Otop, Jan","id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87"}],"status":"public","citation":{"ieee":"J. Michaliszyn and J. Otop, “Elementary modal logics over transitive structures,” vol. 23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 563–577, 2013.","ista":"Michaliszyn J, Otop J. 2013. Elementary modal logics over transitive structures. 23, 563–577.","mla":"Michaliszyn, Jakub, and Jan Otop. <i>Elementary Modal Logics over Transitive Structures</i>. Vol. 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013, pp. 563–77, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">10.4230/LIPIcs.CSL.2013.563</a>.","chicago":"Michaliszyn, Jakub, and Jan Otop. “Elementary Modal Logics over Transitive Structures.” Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2013. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">https://doi.org/10.4230/LIPIcs.CSL.2013.563</a>.","ama":"Michaliszyn J, Otop J. Elementary modal logics over transitive structures. 2013;23:563-577. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">10.4230/LIPIcs.CSL.2013.563</a>","short":"J. Michaliszyn, J. Otop, 23 (2013) 563–577.","apa":"Michaliszyn, J., &#38; Otop, J. (2013). Elementary modal logics over transitive structures. Presented at the CSL: Computer Science Logic, Torino, Italy: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CSL.2013.563\">https://doi.org/10.4230/LIPIcs.CSL.2013.563</a>"},"file_date_updated":"2020-07-14T12:45:34Z","date_created":"2018-12-11T11:56:32Z","publication_status":"published","year":"2013","ec_funded":1,"quality_controlled":"1","oa":1,"day":"01"}