The Complexity of the Graded mu-Calculus

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column

The Complexity of the Graded mu-Calculus

O. KupfermanO. Kupferman,  Ulrike SattlerUlrike Sattler,  M. Y. VardiM. Y. Vardi
O. Kupferman, Ulrike Sattler, M. Y. Vardi
The Complexity of the Graded mu-Calculus
Proceedings of the Conference on Automated Deduction, volume 2392 of Lecture Notes in Artificial Intelligence, 2002. Springer
The final publication is available at Springer.
@inproceedings{ KupfermanSattlerVardi-CADE2002,
  author = {O. {Kupferman} and U. {Sattler} and M. Y. {Vardi}},
  booktitle = {Proceedings of the Conference on Automated Deduction},
  publisher = {Springer Verlag},
  series = {Lecture Notes in Artificial Intelligence},
  title = {The Complexity of the Graded mu-Calculus},
  volume = {2392},
  year = {2002},
}