Complexity of Monadic inf-datalog. Application to temporal logic

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

2006-03-30

arxiv.org/abs/cs/0603122v1

Proc. 4th Panhellenic Logic Symposium (2003) 95-99

Computer Science

Data Structures and Algorithms

Scientific paper

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$).}

Affiliated with

Also associated with

No associations

Rating

Complexity of Monadic inf-datalog. Application to temporal logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Complexity of Monadic inf-datalog. Application to temporal logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Complexity of Monadic inf-datalog. Application to temporal logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-141480