2035 search results - page 25 / 407 » On the complexity of stratified logics |
LPAR
2004
Springer
15 years 3 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...
TIME
2008
IEEE
15 years 4 months ago
2008
IEEE
We survey temporal description logics that are based on standard temporal logics such as LTL and CTL. In particular, we concentrate on the computational complexity of the satisfi...
SOFSEM
2010
Springer
15 years 7 months ago
2010
Springer
LPNMR
2009
Springer
15 years 4 months ago
2009
Springer
TAMC
2009
Springer
15 years 4 months ago
2009
Springer