Adding threshold concepts to the description logic εL

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

Abstract

We introduce an extension of the lightweight Description Logic EL that allows us to define concepts in an approximate way. For this purpose, we use a graded membership function, which for each individual and concept yields a number in the interval [0, 1] expressing the degree to which the individual belongs to the concept. Threshold concepts C∼t for ∼ ∈ {, ≥} then collect all the individuals that belong to C with degree ∼ t.We generalize a well-known characterization of membership in EL concepts to construct a specific graded membership function deg, and investigate the complexity of reasoning in the Description Logic τεL(deg), which extends εL by threshold concepts defined using deg. We also compare the instance problem for threshold concepts of the form C>t in TεL(deg) with the relaxed instance queries of Ecke et al.

Cite

CITATION STYLE

APA

Baader, F., Brewka, G., & Gil, O. F. (2015). Adding threshold concepts to the description logic εL. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9322, pp. 33–48). Springer Verlag. https://doi.org/10.1007/978-3-319-24246-0_3

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