Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics

Abstract

Full Citation:

Ronald de Haan, Stefan Szeider. Parameterized Complexity Results for Symbolic Model Checking of Temporal Logics. Proceedings of KR 2016, the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning, Cape Town, South Africa, April 25-29, 2016 (Chitta Baral and James P. Delgrande and Frank Wolter), pages 453-462, 2016, AAAI Press.

Stefan Szeider
Stefan Szeider
Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.