Complexity of Information Logics

Abstract

In this chapter we study the computational complexity of logics presented in the previous chapters. Most of the results concern the complexity upper bounds. For each complexity analysis we present a different proof technique, thus providing a useful toolkit for investigating the complexity of other information logics. Although the general principles of the techniques in complexity theory for modal logics are standard, the peculiarity of the information logics under consideration leads to substantial modifications of known techniques. In order to be able to deal with more involved logics, we have to develop various extensions of the known methods.