846 search results - page 76 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
166
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Depth of an object concerns a tradeoff between computation time and excess of program length over the shortest program length required to obtain the object. It gives an unconditio...
223
click to vote
FUIN
2007
15 years 6 months ago
2007
Abstract. Consider an agent executing a plan with nondeterministic actions, in a dynamic environment, which might fail. Suppose that she is given a description of this action domai...
127
click to vote
LOGCOM
2007
15 years 6 months ago
2007
Recently, the old logical notion of forgetting propositional symbols (or reducing the logical vocabulary) has been generalized to a new notion: forgetting literals. The aim was to...
176
click to vote
EUSFLAT
2009
15 years 4 months ago
2009
This paper demonstrates that several known sequence kernels can be expressed in a unified framework in which the position specificity is modeled by fuzzy equivalence relations. In ...
148
click to vote
CONCUR
2004
Springer
15 years 11 months ago
2004
Springer
In this paper, we study the complexity of model-checking formulas of three important real-time logics (MTL, MITL, and TCTL) over restricted sets of timed paths. The classes of rest...