Non-Standard Inferences

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2100)


As described in the previous chapter, during the last fifteen years DLs have been investigated thoroughly with respect to their expressive power and the complexity of the standard inference problems. In some applications it has turned out, however, that additional non-standard inferences are needed to support the construction and maintenance of large DL knowledge bases. Some systems, e.g., Classic, contain ad hoc implementations of such novel inferences, mostly without having defined them formally or having investigated their computational complexity. This situation corresponds to the early days of DLs where systems have been built without an exact understanding of the formal properties of the implemented reasoning services. In this book, we aim at taking non-standard inferences to a formal level by providing precise definitions, complete algorithms, and first complexity results.


Normal Form Matching Problem Concept Description Concept Conjunction Standard Inference 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Personalised recommendations