Sciweavers

2920 search results - page 33 / 584
» Finite information logic
Sort
View
LPAR
2010
Springer
15 years 4 months ago
On the Satisfiability of Two-Variable Logic over Data Words
Data trees and data words have been studied extensively in connection with XML reasoning. These are trees or words that, in addition to labels from a finite alphabet, carry labels ...
Claire David, Leonid Libkin, Tony Tan
MICCAI
2000
Springer
15 years 10 months ago
Fusing Speed and Phase Information for Vascular Segmentation in Phase Contrast MR Angiograms
This paper presents a statistical approach to aggregating speed and phase (directional) information for vascular segmentation in phase contrast magnetic resonance angiograms (PC-MR...
Albert C. S. Chung, J. Alison Noble, Paul E. Summe...
CORR
2008
Springer
81views Education» more  CORR 2008»
15 years 6 months ago
Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions
We prove that optimal strategies exist in perfect-information stochastic games with finitely many states and actions and tail winning conditions.
Florian Horn, Hugo Gimbert
CONCUR
2000
Springer
15 years 10 months ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
IGPL
2010
142views more  IGPL 2010»
15 years 3 months ago
Logics of Kripke meta-models
This paper introduces and studies a new type of logical construction, which allows to combine various non-classical propositional logics with the temporal or modal background. The...
Sergey Babenyshev, Vladimir V. Rybakov