Searching for "On the Expressiveness of Temporal Logic Programming" – sorted by Relevance.
-
Memoryless determinacy of parity and mean payoff games: A simple proof
- logics of programs, expressively subsuming virtually � Supported by Swedish Research Council Grants “In
- Cited by 7 (3 self) – Add To MetaCart
-
666 BIBLIOGRAPHY
- . Abadi and Z. Manna. Temporal Logic Programming. Journal of Symbolic Computation, 8(3), 1989. [Abadi
- Add To MetaCart
-
On Fixed-Parameter Complexity of Infinite Games
- , for instance, are equivalent to model checking for the µ-calculus, one of the most expressive temporal logics
- Add To MetaCart
-
On Fixed-Parameter Complexity of Infinite Games
- of the most expressive temporal logics of programs, subsuming virtually all propositional temporal logics
- Add To MetaCart
-
unknown title
- , automata, complexity theories, combinatorial optimization, temporal logic of programs, computer
- Add To MetaCart
-
Algorithms forCombinatorial Optimization and GamesAdapted from Linear
- of the most expressive temporal logics of programs, subsuming logics like LTL, CTL, CTL*, etc. It is also
- Add To MetaCart
-
ISSN 1404-3203Randomized Subexponential Algorithms for Infinite Games
- checking [20,19]. 4The µ-calculus is one of the most expressive temporal logics of programs [19
- Add To MetaCart

