846 search results - page 29 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
CADE
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In functional programming languages the use of infinite structures is common practice. For total correctness of programs dealing with infinite structures one must guarant...
FOSSACS
2007
Springer
15 years 3 months ago
2007
Springer
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
We study the complexity of the propositional minimal inference problem. Its complexity has been extensively studied before because of its fundamental importance in artificial int...
71
Voted
CSL
2005
Springer
15 years 3 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
AAAI
2010
14 years 11 months ago
2010
We design minimal temporal description logics that are capable of expressing various aspects of temporal conceptual data models and investigate their computational complexity. We ...