2011
DOI: 10.1007/s10817-011-9235-0
|View full text |Cite
|
Sign up to set email alerts
|

Tractable Extensions of the Description Logic ${\mathcal{EL}}$ with Numerical Datatypes

Abstract: We consider extensions of the lightweight description logic (DL) EL with numerical datatypes such as naturals, integers, rationals and reals equipped with relations such as equality and inequalities. It is well-known that the main reasoning problems for such DLs are decidable in polynomial time provided that the datatypes enjoy the so-called convexity property. Unfortunately many combinations of the numerical relations violate convexity, which makes the usage of these datatypes rather limited in practice. In t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
5
2
1

Relationship

1
7

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 5 publications
0
4
0
Order By: Relevance
“…We will also seek to extend our prototype to accommodate subsumption between chemical classes so as to generate a complete multi-level chemical hierarchy using ideas from our recent work [49,50]. We could extend our formalism with numerical value restrictions [51] in order to express e.g. classes depending on molecular weight.…”
Section: Resultsmentioning
confidence: 99%
“…We will also seek to extend our prototype to accommodate subsumption between chemical classes so as to generate a complete multi-level chemical hierarchy using ideas from our recent work [49,50]. We could extend our formalism with numerical value restrictions [51] in order to express e.g. classes depending on molecular weight.…”
Section: Resultsmentioning
confidence: 99%
“…There are only 19 datatypes that were chosen such that their intersections are either infinite or empty [32]. Magka et al proved that OWL 2 EL class expressions can be extended with inequalities over numeric domains [29]. For a SubClassOf: axioms with a subclass expression in OWL 2 EL, a superclass expression can be extended with ≥ and ≤ relations over real, rational, and integer numbers, and with ≥ relation over natural numbers.…”
Section: Owl 2 Elmentioning
confidence: 99%
“…Thus, an object will be expensive if its cost is greater than the threshold d. The relation expensive resembles a datatype property in OWL, associating an individual with a data value. In DL, we could introduce a concept Expensive and constrain its interpretation with a datatype restriction of the following kind [27], where X is a variable whose role we will discuss shortly:…”
Section: Gradable Adjectives and Measuresmentioning
confidence: 99%