Imperial College London
Mr Lloyd Kamara

MrLloydKamara

Faculty of Engineering, Department of Computing

Computing Support Manager
 
 
 
//

Contact

 

+44 (0)20 7594 8400l.kamara Website

 
 
//

Location

 

305Huxley BuildingSouth Kensington Campus

//

Summary

 

Publications

Citation

BibTex format

@techreport{Schroder:2008:10.25561/95334,
author = {Schroder, L and Pattinson, D},
booktitle = {Departmental Technical Report: 08/3},
doi = {10.25561/95334},
publisher = {Department of Computing, Imperial College London},
title = {The craft of model making: PSPACE bounds for non-iterative modal logics},
url = {http://dx.doi.org/10.25561/95334},
year = {2008}
}
Download

RIS format (EndNote, RefMan)

TY  - RPRT
AB  - The methods used to establish PSPACE-bounds for modal logics can roughly be groupedinto two classes: syntax driven methods establish that exhaustive proof search can beperformed in polynomial space whereas semantic approaches directly construct shallowmodels. In this paper, we follow the latter approach and establish generic PSPACE-bounds for a large and heterogeneous class of modal logics in a coalgebraic framework.In particular, no complete axiomatisation of the logic under scrutiny is needed. Thisdoes not only complement our earlier, syntactic, approach conceptually, but also coversa wide variety of new examples which are di cult to harness by purely syntactic means.Apart from re-proving known complexity bounds for a large variety of structurally di erentlogics, we apply our method to obtain previously unknown PSPACE-bounds for Elgesem'slogic of agency and for graded modal logic over reexive frames.
AU  - Schroder,L
AU  - Pattinson,D
DO  - 10.25561/95334
PB  - Department of Computing, Imperial College London
PY  - 2008///
TI  - The craft of model making: PSPACE bounds for non-iterative modal logics
T1  - Departmental Technical Report: 08/3
UR  - http://dx.doi.org/10.25561/95334
UR  - http://hdl.handle.net/10044/1/95334
ER  -
Download