Complexity of Monadic inf-datalog. Application to temporal logic.

Eugénie Foustoucos (1) , Irene Guessarian (2)

1 Department of Mathematics [Athens]
2 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

In [11] we defined Inf-Datalog and characterized the fragments of Monadic inf-Datalog that have the same expressive power as Modal Logic (resp. $CTL$, alternation-free Modal $\mu$-calculus and Modal $\mu$-calculus). We study here the time and space complexity of evaluation of Monadic inf-Datalog programs on finite models. We deduce a new unified proof that model checking has 1. linear data and program complexities (both in time and space) for $CTL$ and alternation-free Modal $\mu$-calculus, and 2. linear-space (data and program) complexities, linear-time program complexity and polynomial-time data complexity for $L\mu_k$ (Modal $\mu$-calculus with fixed alternation-depth at most $k$).}

Domaines: Algorithme et structure de données [cs.DS]

Eugénie Foustoucos, Irene Guessarian. Complexity of Monadic inf-datalog. Application to temporal logic.. 2003, pp.95-99. ⟨hal-00021966⟩