1032 search results - page 92 / 207 » Extended Computation Tree Logic |
130
click to vote
TLCA
2007
Springer
15 years 9 months ago
2007
Springer
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
134
Voted
CIKM
2006
Springer
15 years 7 months ago
2006
Springer
Skyline queries compute the set of Pareto-optimal tuples in a relation, i.e., those tuples that are not dominated by any other tuple in the same relation. Although several algorit...
138
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
134
Voted
ATVA
2006
Springer
15 years 7 months ago
2006
Springer
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
141
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for check...