132 search results - page 5 / 27 » Lower bounds for modal logics |
111
click to vote
CORR
2010
Springer
15 years 15 days ago
2010
Springer
Courcelle's famous theorem from 1990 states that any property of graphs definable in monadic second-order logic (MSO2) can be decided in linear time on any class of graphs of ...
97
Voted
JACM
2002
15 years 2 days ago
2002
An exponential lower bound on the circuit complexity of deciding the weak monadic second-order theory of one successor (WS1S) is proved. Circuits are built from binary operations, ...
112
Voted
STACS
2007
Springer
15 years 6 months ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
114
click to vote
FUIN
2000
15 years 6 days ago
2000
We give algorithms to construct the least L-model for a given positive modal logic program P, where L can be one of the modal logics KD, T, KDB, B, KD4, S4, KD5, KD45, and S5. If L...
107
Voted
FUZZIEEE
2007
IEEE
15 years 6 months ago
2007
IEEE
— Possibilistic logic is essentially a formalism for handling qualitative uncertainty with an inference machinery that remains close to the one of classical logic. It is capable ...