Please use this identifier to cite or link to this item:
|Title:||Decidable reasoning in terminological knowledge representation systems|
Donini, Francesco M.
|Year of Publication:||1993|
|OPUS Source:||Kaiserslautern ; Saarbrücken : DFKI, 1993|
|SWD key words:||Künstliche Intelligenz|
|DDC notations:||004 Computer science, internet|
|Abstract:||Terminological Knowledge Representation Systems (TKRS) are tools for designing and using knowledge bases that make use of terminological languages (or concept languages). We analyze from a theoretical point of view a TKRS whose capabilities go beyond the ones of presently available TKRS. The new features studied, all of practical interest, can be summarized in three main points. First, we consider a highly expressive terminological language, called ALCNR, including general complements of concepts, number restrictions and role conjunction. Second, we allow to express inclusion statements between general concepts, and terminological cycles as a particular case. Third, we prove the decidability of a number of desirable TKRS-deduction services (like satisfiability-, subsumption- and instance checking) through a sound, complete and terminating calculus for reasoning in ALCNR-knowledge bases. Our calculus extends the general technique of constraint systems and can be easily turned into a procedure using exponential space. As a byproduct of the proof, we get also the result that inclusion statements in ALCNR can be simulated by terminological cycles, if descriptive semantics is adopted.|
|Link to this record:||urn:nbn:de:bsz:291-scidok-36500|
|Series name:||Research report / Deutsches Forschungszentrum für Künstliche Intelligenz [ISSN 0946-008x]|
|Date of registration:||27-Jun-2011|
|Faculty:||SE - Sonstige Einrichtungen|
|Department:||SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz|
|Collections:||SciDok - Der Wissenschaftsserver der Universität des Saarlandes|
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.