846 search results - page 93 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
88
Voted
AGILE
2007
Springer
15 years 7 months ago
2007
Springer
Using qualitative reasoning with geographic information, contrarily, for instance, with robotics, looks not only fastidious (i.e.: encoding knowledge Propositional Logics PL), but ...
SPIN
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We present an approach for the veri cation of spatial properties with Spin. We rst extend one of Spin's main property speci cation mechanisms, i.e., the linear-time...
144
click to vote
DALT
2005
Springer
15 years 6 months ago
2005
Springer
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
100
Voted
HIPC
2004
Springer
15 years 6 months ago
2004
Springer
This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines (FSMs). High performance CAD tools are necessary to...
109
Voted
STACS
1994
Springer
15 years 4 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...