2022 search results - page 27 / 405 » Complexity of Non-Monotonic Logics |
103
Voted
DLOG
2011
14 years 1 months ago
2011
We propose an extension of SROIQ with nominal schemas which can be used like “variable nominal concepts” within axioms. This feature allows us to express arbitrary DL-safe rule...
63
Voted
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
Typing of lambda-terms in Elementary and Light Affine Logic (EAL , LAL resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL ...
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...
74
Voted
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