Inf-datalog, Modal Logic and Complexities

Abstract

Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in [16]. In the present paper, we study the complexity of query evaluation on finite models for (various fragments of) inf-Datalog. We deduce a unified and elementary proof that global model-checking (computing all nodes satisfying a formula in a given structure) has 1. quadratic data complexity in time and linear program complexity in space for CT L and alternation-free modal µ-calculus, and 2. linear-space (data and program) complexities, linear-time program complexity and polynomial-time data complexity for Lµ k (modal µ-calculus with fixed alternation-depth at most k).