846 search results - page 92 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
171
click to vote
FOSSACS
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. This paper develops a highly expressive semantic framework for program refinement that supports both temporal reasoning and reasoning about the knowledge of a single agen...
174
click to vote
AGP
1994
IEEE
15 years 10 months ago
1994
IEEE
Kowalski and Sergot's Event Calculus (EC) is a formalism for reasoning about time and change in a logic programming framework. From a description of events which occur in the...
171
click to vote
DSN
2002
IEEE
15 years 11 months ago
2002
IEEE
Model checking has been introduced as an automated technique to verify whether functional properties, expressed in a formal logic like computational tree logic (CTL), do hold in a...
163
click to vote
HPCA
2004
IEEE
16 years 6 months ago
2004
IEEE
Design of wakeup-free issue queues is becoming desirable due to the increasing complexity associated with broadcast-based instruction wakeup. The effectiveness of most wakeup-free...
174
click to vote
MFCS
2009
Springer
16 years 25 days ago
2009
Springer
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...