Computer Science – Logic in Computer Science
Scientific paper
2010-04-15
Proc. 21st International Conference on Concurrency Theory, CONCUR 2010, Vol. 6269 of Lecture Notes in Computer Science, Spring
Computer Science
Logic in Computer Science
Scientific paper
10.1007/978-3-642-15375-4_36
Fixed point logics have a wide range of applications in computer science, in particular in artificial intelligence and concurrency. The most expressive logics of this type are the mu-calculus and its relatives. However, popular fixed point logics tend to trade expressivity for simplicity and readability, and in fact often live within the single variable fragment of the mu-calculus. The family of such flat fixed point logics includes, e.g., CTL, the *-nesting-free fragment of PDL, and the logic of common knowledge. Here, we extend this notion to the generic semantic framework of coalgebraic logic, thus covering a wide range of logics beyond the standard mu-calculus including, e.g., flat fragments of the graded mu-calculus and the alternating-time mu-calculus (such as ATL), as well as probabilistic and monotone fixed point logics. Our main results are completeness of the Kozen-Park axiomatization and a timed-out tableaux method that matches EXPTIME upper bounds inherited from the coalgebraic mu-calculus but avoids using automata.
Schröder Linda L.
Venema Yde
No associations
LandOfFree
Flat coalgebraic fixed point logics 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 Flat coalgebraic fixed point logics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Flat coalgebraic fixed point logics will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-622770