846 search results - page 52 / 170 » On the Computational Complexity of Spatio-Temporal Logics |
TLCA
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
74
Voted
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
— This paper bridges the advances in computer science and control to allow automatic synthesis of control strategies for complex dynamical systems which are guaranteed, by constr...
90
Voted
CORR
2010
Springer
14 years 6 months ago
2010
Springer
am analysis and has been widely studied. In this paper we consider this problem at the abstraction level of program schemas in which computations occur in the Herbrand domain of te...
LATIN
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order ...
105
click to vote
JMLR
2008
14 years 11 months ago
2008
The use of computational models is increasingly expected to play an important role in predicting the behaviour of biological systems. Models are being sought at different scales o...