|
|||||
|
|
Satisfiability problem for modal logic with global counting operators coded in binary is NExpTime-complete |
|
| Authors: | Michał Zawidzki Renate A. Schmidt Dmitry Tishkovsky |
| Affiliation: | 1. School of Computer Science, The University of Manchester, United Kingdom;2. Department of Logic, University of Lodz, Poland |
| Abstract: | |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |