Terminologies and rules

0Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Terminological logics have become a well understood formal basis for taxonomic knowledge representation, both for the semantics (classically by Tarski models) and for the inference services (like concept subsumption, instantiation, classification, and realization) of terminological systems of the KL-ONE family. It has been demonstrated that terminological reasoning can be realized by efficient and logically complete algorithms based on tableaux style calculi. However, representation of and reasoning with terminological information supports just a rather static form of knowledge representation. Only a fixed description of a domain can be represented: There is the schematic description of concepts in the socalled TBox and the instantiation of concepts by individuals and objects in the ABox of such systems. Terminological inferences can retrieve implicit information, but cannot be used for deriving new data. In order to overcome this restriction terminological systems often allow for additional rule based formalisms. Those, however, are missing a clear declarative semantics. In this paper we will sketch several declarative forms of rule based extensions of terminological systems that have been developed recently.

Cite

CITATION STYLE

APA

Bürckert, H. J. (1994). Terminologies and rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 777 LNCS, pp. 44–63). Springer Verlag. https://doi.org/10.1007/3-540-57802-1_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free