362 search results - page 70 / 73 » Formal Theories for Linear Algebra |
HYBRID
2010
Springer
13 years 9 months ago
2010
Springer
In this paper, we describe a receding horizon scheme that satisfies a class of linear temporal logic specifications sufficient to describe a wide range of properties including saf...
JSYML
2007
13 years 7 months ago
2007
We investigate the complexity of various combinatorial theorems about linear and partial orders, from the points of view of computability theory and reverse mathematics. We focus ...
POPL
2011
ACM
12 years 10 months ago
2011
ACM
We describe a new algorithm for proving temporal properties expressed in LTL of infinite-state programs. Our approach takes advantage of the fact that LTL properties can often be...
PODS
2009
ACM
14 years 8 months ago
2009
ACM
Querying uncertain data has emerged as an important problem in data management due to the imprecise nature of many measurement data. In this paper we study answering range queries...
DIMACS
1996
13 years 8 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...