Complexity of Monadic inf-datalog Application to temporal logic
<|reference_start|>Complexity of Monadic inf-datalog Application to temporal logic: 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$).}<|reference_end|>
@article{foustoucos2006complexity,
    title={Complexity of Monadic inf-datalog. Application to temporal logic},
    author={Eug'enie Foustoucos (MPLA), Irene Guessarian (LIAFA)},
    journal={Proc. 4th Panhellenic Logic Symposium (2003) 95-99},
    year={2006},
    archivePrefix={arXiv},
    eprint={cs/0603122},
    primaryClass={cs.DS}
}