Abstract. Grammar logics were introduced by Fariñas del Cerro and Penttonen in  and have been widely studied. In this paper we consider regular grammar logics with converse (REG c logics) and present sound and complete tableau calculi for the general satisfiability problem of REG c logics and the problem of checking consistency of an ABox w.r.t. a TBox in a REG c logic. Using our calculi we develop ExpTime (optimal) tableau decision procedures for the mentioned problems, to which various optimization techniques can be applied. We also prove a new result that the data complexity of the instance checking problem in REG c logics is coNP-complete.
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.