Complexity results of description logics

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper is concerned with the Description Logics (DLs) with focused on complexity results which come from reasoning problems. First I give you a short overview about the knowledge presentation systems that based on DLs. Then introduce you in the DSs AL and the AL-family. The next chapter is an introducing in TBox and ABox such as reasoning in DLs. At the end I will show you the characteristic of role-constructors and the complexity results. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Gong, W., Zhang, D., & Zhao, J. (2011). Complexity results of description logics. In Communications in Computer and Information Science (Vol. 163 CCIS, pp. 66–72). https://doi.org/10.1007/978-3-642-25002-6_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free