272 search results - page 15 / 55 » Reifying Concepts in Description Logics |
101
click to vote
DLOG
2006
15 years 1 months ago
2006
Tree automata are often used for satisfiability testing in the area of description logics, which usually yields ExpTime complexity results. We examine conditions under which this ...
127
click to vote
AAAI
1996
15 years 1 months ago
1996
We introduce a predictive concept recognition methodology for description logics based on a new closed terminology assumption. During knowledge engineering, our system adopts the ...
DLOG
2010
14 years 9 months ago
2010
Unsatisfiable concepts are a major cause for inconsistencies in Description Logics knowledge bases. Popular methods for repairing such concepts aim to remove or rewrite axioms to r...
113
click to vote
AI
2003
Springer
15 years 4 months ago
2003
Springer
This paper introduces a formal theory for describing actions in terminological knowledge bases, closely related to description logics. It deals in particular with the problem of ad...
DLOG
2001
15 years 1 months ago
2001
For description logics with existential restrictions, the size of the least common subsumer (lcs) of concept descriptions may grow exponentially in the size of the concept descrip...