Adding Epistemic Operators to Concept Languages

We investigate the use of epistemic operators in the framework of concept languages (also called terminological languages). The results of this work have a twofold signiicance. From the point of view of epistemic logics, our contribution is to have identiied an effective procedure for the problem of answering epistemic queries posed to a knowledge base expressed in the concept language ALC. From the point of view of concept languages, the most relevant aspect of our work is that we have reconstructed in logic several common features of existing knowledge representation systems. Epistemic operators provide a highly expressive query language; allow for the treatment of several database features, such as closed world reasoning and integrity constraints; and nally can give a formal characterization of some procedural mechanisms , such as trigger rules, usually considered in frame-based systems.

[1]  Hector J. Levesque,et al.  Foundations of a Functional Approach to Knowledge Representation , 1984, Artif. Intell..

[2]  Franz Baader,et al.  A Terminological Knowledge Representation System with Complete Inference Algorithms , 1991, PDK.

[3]  Projektgruppe WINOPostfa.  A Terminological Knowledge Representation System with Complete Inference Algorithms , 1991 .

[4]  Maurizio Lenzerini,et al.  Querying Concept-based Knowledge Bases , 1991, PDK.

[5]  Raymond Reiter.  On Asking What a Database Knows , 1990 .

[6]  Werner Nutt,et al.  The Complexity of Concept Languages , 1997, KR.

[7]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[8]  Bernhard Hollunder.  Hybrid Inferences in KL-ONE-Based Knowledge Representation Systems , 1990, GWAI.

[9]  Bernhard Nebel,et al.  Reasoning and Revision in Hybrid Representation Systems , 1990, Lecture Notes in Computer Science.

[10]  John Yen,et al.  CLASP: Integrating Term Subsumption Systems and Production Systems , 1991, IEEE Trans. Knowl. Data Eng..

[11]  Bernhard Nebel,et al.  Terminological Reasoning is Inherently Intractable , 1990, Artif. Intell..

[12]  Deborah L. McGuinness,et al.  CLASSIC: a structural data model for objects , 1989, SIGMOD '89.

[13]  Klaus Schild.  Towards a Theory of Frames and Rules , 1989 .

[14]  R. Reiter.  On Closed World Data Bases , 1987, Logic and Data Bases.

[15]  William A. Woods,et al.  Understanding Subsumption and Taxonomy: A Framework for Progress , 1991, Principles of Semantic Networks.

[16]  Vladimir Lifschitz,et al.  On Open Defaults , 1990 .

[17]  Werner Nutt,et al.  Tractable Concept Languages , 1991, IJCAI.

[18]  Hector J. Levesque,et al.  The Tractability of Subsumption in Frame-Based Description Languages , 1984, AAAI.

[19]  Vladimir Lifschitz,et al.  Nonmonotonic Databases and Epistemic Queries , 1991, IJCAI.

[20]  Jon Doyle,et al.  Two Theses of Knowledge Representation: Language Restrictions, Taxonomic Classification, and the Utility of Representation Services , 1991, Artif. Intell..

[21]  Jeffrey D. Uuman.  Principles of database and knowledge- base systems , 1989 .