Using model theory to find decidable and tractable description logics with concrete domains (Q2090131)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using model theory to find decidable and tractable description logics with concrete domains |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using model theory to find decidable and tractable description logics with concrete domains |
scientific article |
Statements
Using model theory to find decidable and tractable description logics with concrete domains (English)
0 references
24 October 2022
0 references
description logic
0 references
concrete domains
0 references
GCIs
0 references
\(\omega\)-admissibility
0 references
homogeneity
0 references
finite boundedness
0 references
decidability
0 references
P-admissibility
0 references
convexity
0 references
\(\omega\)-categoricity
0 references
tractability
0 references
constraint satisfaction
0 references
0 references
0 references
