778 search results - page 7 / 156 » Expressiveness and complexity of graph logic |
ICDE
2011
IEEE
14 years 1 months ago
2011
IEEE
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
LPAR
2004
Springer
15 years 2 months ago
2004
Springer
We propose a new parameter for the complexity of finite directed graphs which measures to what extent the cycles of the graph are intertwined. This measure, called entanglement, i...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theore...
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
STACS
2007
Springer
15 years 3 months ago
2007
Springer
