{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T16:53:23Z","timestamp":1753894403403,"version":"3.41.2"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>This paper studies the complexity of classical modal logics and of their\nextension with fixed-point operators, using translations to transfer results\nacross logics. In particular, we show several complexity results for\nmulti-agent logics via translations to and from the $\\mu$-calculus and modal\nlogic, which allow us to transfer known upper and lower bounds. We also use\nthese translations to introduce terminating and non-terminating tableau systems\nfor the logics we study, based on Kozen's tableau for the $\\mu$-calculus and\nthe one of Fitting and Massacci for modal logic. Finally, we describe these\ntableaux with $\\mu$-calculus formulas, thus reducing the satisfiability of each\nof these logics to the satisfiability of the $\\mu$-calculus, resulting in a\ngeneral 2EXP upper bound for satisfiability testing.<\/jats:p>","DOI":"10.46298\/lmcs-20(3:14)2024","type":"journal-article","created":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T08:20:23Z","timestamp":1723018823000},"source":"Crossref","is-referenced-by-count":0,"title":["Complexity results for modal logic with recursion via translations and tableaux"],"prefix":"10.46298","volume":"Volume 20, Issue 3","author":[{"given":"Luca","family":"Aceto","sequence":"first","affiliation":[]},{"given":"Antonis","family":"Achilleos","sequence":"additional","affiliation":[]},{"given":"Elli","family":"Anastasiadi","sequence":"additional","affiliation":[]},{"given":"Adrian","family":"Francalanza","sequence":"additional","affiliation":[]},{"given":"Anna","family":"Ing\u00f3lfsd\u00f3ttir","sequence":"additional","affiliation":[]}],"member":"25203","published-online":{"date-parts":[[2024,8,7]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/14031\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/14031\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T08:20:23Z","timestamp":1723018823000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/11525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,7]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-20(3:14)2024","relation":{"has-preprint":[{"id-type":"arxiv","id":"2306.16881v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2306.16881v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2306.16881","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2306.16881","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2024,8,7]]},"article-number":"11525"}}