1032 search results - page 13 / 207 » Extended Computation Tree Logic |
97
Voted
FUIN
2010
14 years 7 months ago
2010
We study an extension of monadic second-order logic of order with the uncountability quantifier "there exist uncountably many sets". We prove that, over the class of fini...
ECAI
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Until recently, computational aspects of the Shapley value were only studied under the assumption that there are no externalities from coalition formation, i.e., that the...
SODA
2000
ACM
14 years 11 months ago
2000
ACM
We show that contour trees can be computed in all dimensions by a simple algorithm that merges two trees. Our algorithm extends, simplifies, and improves work of Tarasov and Vyaly...
CONCUR
2001
Springer
15 years 2 months ago
2001
Springer
A key issue in the design of a model-checking tool is the choice of the formal language with which properties are specified. It is now recognized that a good language should exten...
CSL
2006
Springer
14 years 9 months ago
2006
Springer
In a data word or a data tree each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been considered in the realm of sem...