Sciweavers

22 search results - page 2 / 5
» Temporal Logics over Unranked Trees
Sort
View
LICS
2007
IEEE
15 years 3 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic
JAPLL
2010
124views more  JAPLL 2010»
14 years 8 months ago
Reasoning about XML with temporal logics and automata
We show that problems arising in static analysis of XML specifications and transformations can be dealt with using techniques similar to those developed for static analysis of pr...
Leonid Libkin, Cristina Sirangelo
56
Voted
LICS
2007
IEEE
15 years 3 months ago
Two-way unary temporal logic over trees
Mikolaj Bojanczyk
162
Voted
PODS
2009
ACM
122views Database» more  PODS 2009»
15 years 10 months ago
Satisfiability of downward XPath with data equality tests
In this work we investigate the satisfiability problem for the logic XPath( , , =), that includes all downward axes as well as equality and inequality tests. We address this probl...
Diego Figueira
CADE
2005
Springer
15 years 9 months ago
Temporal Logics over Transitive States
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
Boris Konev, Frank Wolter, Michael Zakharyaschev