846 search results - page 24 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
TACAS
2010
Springer
15 years 4 months ago
2010
Springer
Deciding whether a modal formula is satisfiable with respect to a given set of (global) assumptions is a question of fundamental importance in applications of logic in computer sc...
68
Voted
FPGA
2004
ACM
15 years 2 months ago
2004
ACM
In this paper, we introduce a reconfigurable fabric based around a new class of circuit element: the hybrid Hall effect (HHE) magnetoelectronic device. Because they incorporate a ...
DLOG
2003
14 years 11 months ago
2003
We present lower bounds on the computational complexity of satisfiability and subsumption in several description logics. We interpret these lower bounds as coming from different...
BIRTHDAY
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We survey some of the main results regarding the complexity and expressive power of Live Sequence Charts (LSCs). We first describe the two main semantics given to LSCs: a...
CONCUR
2007
Springer
15 years 3 months ago
2007
Springer
We introduce strategy logic, a logic that treats strategies in two-player games as explicit first-order objects. The explicit treatment of strategies allows us to specify properti...