1582 search results - page 37 / 317 » On Higher-Order Description Logics |
CSL
2010
Springer
13 years 8 months ago
2010
Springer
We study probabilistic complexity classes and questions of derandomisation from a logical point of view. For each logic L we introduce a new logic BPL, bounded error probabilistic ...
CSL
2000
Springer
14 years 26 days ago
2000
Springer
We study definability of languages in arithmetic and the free monoid by bounded versions of fixed-point and transitive-closure logics. In particular we give logical characterisat...
TIME
2007
IEEE
14 years 2 months ago
2007
IEEE
It is known that for temporal languages, such as firstorder LT L, reasoning about constant (time-independent) relations is almost always undecidable. This applies to temporal des...
AAAI
2006
13 years 10 months ago
2006
For ontologies represented as Description Logic Tboxes, optimised DL reasoners are able to detect logical errors, but there is comparatively limited support for resolving such pro...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logic...