Practical reasoning for expressive description logics (Q4938424)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1405450
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Practical reasoning for expressive description logics |
scientific article; zbMATH DE number 1405450 |
Statements
26 October 2000
0 references
description logics
0 references
satisfiability
0 references
subsumption
0 references
complexity
0 references
PSPACE
0 references
decidability
0 references
0.8156664371490479
0 references
0.8012984395027161
0 references
0.796848714351654
0 references
0.7853789925575256
0 references
Practical reasoning for expressive description logics (English)
0 references
This paper examines a particular class of knowledge representation formalisms, namely description logics. Specifically, several extensions and variants of a classical example, \(\mathcal ALC\), introduced in 1991 by \textit{M. Schmidt-Schauss} and \textit{G. Smolka} [J. Artif. Intell. 48, No. 1, 1-26 (1991; Zbl 0712.68095)] are studied. It was shown that deciding coherence and subsumption for \(\mathcal ALC\) are PSPACE-complete problems in linear space. The present paper examines satisfiability and subsumption of the examined variants and proves, among others, that these problems are still in PSPACE. This conference version contains only selected proofs; the authors refer to technical reports, published at their institutions, for full details. For the entire collection see [Zbl 0921.00037].
0 references
