471 search results - page 10 / 95 » Modals As A Problem For MT |
103
Voted
CCDS
2010
14 years 7 months ago
2010
We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definit...
131
click to vote
FTP
1998
Springer
15 years 1 months ago
1998
Springer
Abstract. First-order modal logic, in the usual formulations, is not sufficiently expressive, and as a consequence problems like Frege's morning
CADE
1999
Springer
15 years 2 months ago
1999
Springer
We present a PSpace algorithm that decides satisfiability of the graded modal logic Gr(KR)—a natural extension of propositional modal logic KR by counting expressions—which pl...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...