A New Method for Bounding the Complexity of Modal Logics.

David A. Basin Seán Matthews Luca Viganò

Published in: Kurt Gödel Colloquium (1997)

Keyphrases

support vector machine
modal logic
preprocessing
dynamic programming
computational complexity
probabilistic model
clustering method
similarity measure
pairwise
special case
cost function
upper bound