846 search results - page 9 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
TJS
2002
13 years 7 months ago
2002
FLAME, the Flexible API for Module-based Environments, is a proposed standard interface for the integration of parameterized hardware generators into high-level design tools. This ...
CIE
2008
Springer
13 years 9 months ago
2008
Springer
There are many ways to define complexity in logic. In finite model theory, it is the complexity of describing properties, whereas in proof complexity it is the complexity of provin...
CIE
2009
Springer
14 years 2 months ago
2009
Springer
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
MFCS
2005
Springer
14 years 27 days ago
2005
Springer
This paper analyses the computational complexity of the model checking problem for Higher Order Fixpoint Logic – the modal µ-calculus enriched with a typed λ-calculus. It is ha...
TIME
2008
IEEE
14 years 1 months ago
2008
IEEE
We survey temporal description logics that are based on standard temporal logics such as LTL and CTL. In particular, we concentrate on the computational complexity of the satisfi...