2022
DOI: 10.1007/s10817-022-09626-2
|View full text |Cite
|
Sign up to set email alerts
|

Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains

Abstract: Concrete domains have been introduced in the area of Description Logic to enable reference to concrete objects (such as numbers) and predefined predicates on these objects (such as numerical comparisons) when defining concepts. Unfortunately, in the presence of general concept inclusions (GCIs), which are supported by all modern DL systems, adding concrete domains may easily lead to undecidability. To regain decidability of the DL $$\mathcal {ALC}$$ ALC in the presence of GCIs, q… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
10
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(10 citation statements)
references
References 59 publications
0
10
0
Order By: Relevance
“…We recall the DLs EL ⊥ and ALC [9], and then discuss their extensions EL ⊥ [D] and ALC [D] with a concrete domain D [8,7]. Following [11], we use square brackets to indicate that no role paths are allowed. We also introduce the two p-admissible concrete domains D Q,diff and D Q,lin [7,11].…”
Section: Description Logics With Concrete Domainsmentioning
confidence: 99%
See 4 more Smart Citations
“…We recall the DLs EL ⊥ and ALC [9], and then discuss their extensions EL ⊥ [D] and ALC [D] with a concrete domain D [8,7]. Following [11], we use square brackets to indicate that no role paths are allowed. We also introduce the two p-admissible concrete domains D Q,diff and D Q,lin [7,11].…”
Section: Description Logics With Concrete Domainsmentioning
confidence: 99%
“…Following [11], we use square brackets to indicate that no role paths are allowed. We also introduce the two p-admissible concrete domains D Q,diff and D Q,lin [7,11]. 3 The three reasoning problems of deciding consistency, checking subsumption, and computing the classification are mutually reducible in polynomial time.…”
Section: Description Logics With Concrete Domainsmentioning
confidence: 99%
See 3 more Smart Citations