Dl-Link: a Conceptual Clustering Algorithm for Indexing Description Logics Knowledge Bases

نویسندگان

  • Claudia d'Amato
  • Steffen Staab
  • Nicola Fanizzi
  • Floriana Esposito
چکیده

Efficient resource retrieval is a crucial issue, particularly when semantic resource descriptions are considered which enable the exploitation of reasoning services during the retrieval process. In this context, resources are commonly retrieved by checking if each available resource description satisfies the given query. This approach becomes inefficient with the increase of available resources. We propose a method for improving the retrieval process by constructing a tree index through a new conceptual clustering method for resources expressed as class definitions or as instances of classes in ontology languages. The available resource descriptions are located at the leaf nodes of the index, while inner nodes represent intensional descriptions (generalizations) of their child nodes. The retrieval is performed by following the tree branches whose nodes satisfy the query. Query answering time may be improved as the number of retrieval steps may be O(logn) in the best case.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

DL+log: Tight Integration of Description Logics and Disjunctive Datalog

The integration of Description Logics and Datalog rules presents many semantic and computational problems. In particular, reasoning in a system fully integrating Description Logics knowledge bases (DL-KBs) and Datalog programs is undecidable. Many proposals have overcomed this problem through a “safeness” condition that limits the interaction between the DL-KB and the Datalog rules. Such a safe...

متن کامل

Towards an Eecient Description Logics System with Individuals

This report presents the status of the research the author is conducting on the development of a complete Description Logics knowledge representation system. Description Logics knowledge representation systems are based of a family of formal languages for describing complex structured classes. These languages comprise boolean operators and quanti cation over class attributes, as well as the dec...

متن کامل

Finite Model Reasoning in DL-Lite with Cardinality Constraints

The relationship of description logics (DLs) and conceptual modelling has been extensively studied in the literature [5, 4, 1]. One of the advantages of using description logics as modelling languages is that along with their capability of representing knowledge they provide also reasoning services. More precisely, a conceptual model can be represented by a DL ontology (TBox), and standard reas...

متن کامل

Past and Future of DL-Lite

We design minimal temporal description logics that are capable of expressing various aspects of temporal conceptual data models and investigate their computational complexity. We show that, depending on the required types of temporal and atemporal constraints, the satisfiability problem for temporal knowledge bases in the resulting logics can be NLOGSPACE-, NPand PSPACE-complete, as well as und...

متن کامل

Master ’ s Thesis on Subsumption in the Description Logic

Description Logics are a family of knowledge representation formalisms for representing and reasoning about conceptual knowledge. Every DL system has reasoning services as an important component that infer implicit knowledge from the one explicitly given. Standard reasoning problems include concept satisfiability, concept subsumption, ABox consistency and the instance problem. This work conside...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Int. J. Semantic Computing

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2010