522 search results - page 20 / 105 » Real-time Logics: Complexity and Expressiveness |
CSL
1999
Springer
14 years 22 days ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...
CSL
2007
Springer
14 years 2 months ago
2007
Springer
We study the complexity of satisfiability for DLP+ dyn , an expressive logic introduced by Demri that allows to reason about dynamic policies. DLP+ dyn extends the logic DLPdyn of...
ISCA
1997
IEEE
14 years 20 days ago
1997
IEEE
The performance tradeoff between hardware complexity and clock speed is studied. First, a generic superscalar pipeline is defined. Then the specific areas of register renaming, ...
ICDE
2003
IEEE
14 years 9 months ago
2003
IEEE
This paper presents SPEX, a streamed and progressive evaluation of regular path expressions with XPath-like qualifiers against XML streams. SPEX proceeds as follows. An expression...