Luca Aceto (School of Computer Science, Reykjavik University, Gran Sasso Science Institute, L'Aquila, Italy) |
Antonis Achilleos (School of Computer Science, Reykjavik University) |
Elli Anastasiadi (School of Computer Science, Reykjavik University) |
Adrian Francalanza (Dept. of Computer Science, ICT, University of Malta) |
Anna Ingolfsdottir (School of Computer Science, Reykjavik University) |
This paper studies the complexity of classical modal logics and of their extension with fixed-point operators, using translations to transfer results across logics. In particular, we show several complexity results for multi-agent logics via translations to and from the mu-calculus and modal logic, which allow us to transfer known upper and lower bounds. We also use these translations to introduce a terminating tableau system for the logics we study, based on Kozen's tableau for the mu-calculus, and the one of Fitting and Massacci for modal logic. |
ArXived at: https://dx.doi.org/10.4204/EPTCS.370.3 | bibtex | |
Comments and questions to: eptcs@eptcs.org |
For website issues: webmaster@eptcs.org |