122
click to vote
CSR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We prove a conjecture by A. Pnueli and strengthen it showing a sequence of "counting modalities" none of which is expressible in the temporal logic generated by...
106
click to vote
CSR
2006
Springer
15 years 6 months ago
2006
Springer
The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
130
click to vote
CSR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Queries over streaming data offer the potential to provide timely information for modern database applications, such as sensor networks and web services. Isoline-based vi...
146
click to vote
CSR
2006
Springer
15 years 6 months ago
2006
Springer
We propose a new model of restricted branching programs specific to solving GEN problems, which we call incremental branching programs. We show that syntactic incremental branchin...
CSR
2006
Springer
15 years 6 months ago
2006
Springer
