Satisfiability problem for modal logic with global counting...

Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete

Zawidzki, Michał, Schmidt, Renate A., Tishkovsky, Dmitry
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
113
Language:
english
Journal:
Information Processing Letters
DOI:
10.1016/j.ipl.2012.09.007
Date:
January, 2013
File:
PDF, 216 KB
english, 2013
Conversion to is in progress
Conversion to is failed