| 000 | 03035nam a22005655i 4500 | ||
|---|---|---|---|
| 001 | 978-3-540-44613-2 | ||
| 003 | DE-He213 | ||
| 005 | 20240423132548.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 121227s2001 gw | s |||| 0|eng d | ||
| 020 |
_a9783540446132 _9978-3-540-44613-2 |
||
| 024 | 7 |
_a10.1007/3-540-44613-3 _2doi |
|
| 050 | 4 | _aQ334-342 | |
| 050 | 4 | _aTA347.A78 | |
| 072 | 7 |
_aUYQ _2bicssc |
|
| 072 | 7 |
_aCOM004000 _2bisacsh |
|
| 072 | 7 |
_aUYQ _2thema |
|
| 082 | 0 | 4 |
_a006.3 _223 |
| 100 | 1 |
_aKüsters, Ralf. _eauthor. _4aut _4http://id.loc.gov/vocabulary/relators/aut |
|
| 245 | 1 | 0 |
_aNon-Standard Inferences in Description Logics _h[electronic resource] : _bFrom Foundations and Definitions to Algorithms and Analysis / _cby Ralf Küsters. |
| 250 | _a1st ed. 2001. | ||
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2001. |
|
| 300 |
_aX, 254 p. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v2100 |
|
| 505 | 0 | _aDescription Logics -- Non-Standard Inferences -- Characterizing Subsumption -- LCS and MSC -- Matching -- Conclusion. | |
| 520 | _aDescription logics (DLs) are used to represent structured knowledge. Inference services testing consistency of knowledge bases and computing subconcept/superconcept hierarchies are the main feature of DL systems. Intensive research during the last fifteen years has led to highly optimized systems that allow to reason about knowledge bases efficiently. However, applications often require additional non-standard inferences to support both the construction and the maintenance of knowledge bases, thus making the inference procedures again incomplete. This book, which is a revised version of the author's PhD thesis, constitutes a significant step to fill this gap by providing an excellent formal foundation of the most prominent non-standard inferences. The descriptions given include precise definitions, complete algorithms and thorough complexity analysis. With its solid foundation, the book also serves as a basis for future research. | ||
| 650 | 0 | _aArtificial intelligence. | |
| 650 | 0 | _aSoftware engineering. | |
| 650 | 0 | _aMachine theory. | |
| 650 | 1 | 4 | _aArtificial Intelligence. |
| 650 | 2 | 4 | _aSoftware Engineering. |
| 650 | 2 | 4 | _aFormal Languages and Automata Theory. |
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer Nature eBook | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783540423973 |
| 776 | 0 | 8 |
_iPrinted edition: _z9783662205846 |
| 830 | 0 |
_aLecture Notes in Artificial Intelligence, _x2945-9141 ; _v2100 |
|
| 856 | 4 | 0 | _uhttps://doi.org/10.1007/3-540-44613-3 |
| 912 | _aZDB-2-SCS | ||
| 912 | _aZDB-2-SXCS | ||
| 912 | _aZDB-2-LNC | ||
| 912 | _aZDB-2-BAE | ||
| 942 | _cSPRINGER | ||
| 999 |
_c189155 _d189155 |
||