Regional Languages and Tiling: A Unifying Approach to Picture Grammars
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Formal language characterizations of P, NP, and Pspace
Journal of Automata, Languages and Combinatorics
Positive first-order logic is NP-complete
IBM Journal of Research and Development
Resets vs. aborts in linear temporal logic
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Solving general lattice puzzles
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Some complexity results for systemverilog assertions
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Turing machines for dummies: why representations do matter
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
LTL over description logic axioms
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
We analyze the computational complexity of determining whether F is satisfiable when F is a formula of the classical predicate calculus which obeys certain syntactic restrictions. For example, for the monadic predicate calculus and the Gödel or ∃ ... ∃∀∀∃ ... ∃ prefix class we obtain lower and upper nondeterministic time bounds of the form cn/log n. The main tool in in these proofs is a finite version of Wang's domino problem, about which we present an interesting open question.