A Non-Monotonic Description Logics Model for Merging Terminologies

نویسندگان

  • Martín O. Moguillansky
  • Marcelo A. Falappa
چکیده

In order to deal with the Ontology Change problem and considering an environment where Description Logics (DLs) are used to describe ontologies, the question of how to integrate distributed ontologies appears to be in touch with Belief Revision since DL terminologies may define same concept descriptions of a not necessarily same world model. A possible alternative to reason about these concepts is to generate unique concept descriptions in a different terminology. This new terminology needs to be consistently created, trying to deal with the minimal change problem, and moreover, yielding a non-monotonic layer to express ontological knowledge in order to be further updated with new distributed ontologies.

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

ثبت نام

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

منابع مشابه

Defeasible Inheritance-Based Description Logics

Defeasible inheritance networks are a non-monotonic framework that deals with hierarchical knowledge. On the other hand, rational closure is acknowledged as a landmark of the preferential approach to non-monotonic reasoning. We will combine these two approaches and define a new non-monotonic closure operation for propositional knowledge bases that combines the advantages of both. Then we redefi...

متن کامل

Semantic Foundation for Preferential Description Logics

Description logics are a well-established family of knowledge representation formalisms in Artificial Intelligence. Enriching description logics with non-monotonic reasoning capabilities, especially preferential reasoning as developed by Lehmann and colleagues in the 90’s, would therefore constitute a natural extension of such KR formalisms. Nevertheless, there is at present no generally accept...

متن کامل

Concept Model Semantics for DL Preferential Reasoning

The preferential and rational consequence relations first studied by Lehmann and colleagues play a central role in non-monotonic reasoning, not least because they provide the foundation for the determination of the important notion of rational closure. Although they can be applied directly to a large variety of logics, these constructions suffer from the limitation that they are largely proposi...

متن کامل

Description Logics with Circumscription

We show that circumscription can be used to extend description logics (DLs) with non-monotonic features in a straightforward and transparent way. In particular, we consider extensions with circumscription of the expressive DLsALCIO and ALCQO and prove that reasoning in these logics is decidable under a simple restriction: only concept names can be circumscribed, and role names vary freely durin...

متن کامل

Decidability of Circumscribed Description Logics Revisited

We revisit non-monotonic description logics based on circumscription (with preferences) and prove several decidability results for their satisfiability problem. In particular, we consider circumscribed description logics without the finite model property (DL-LiteF andALCFI) and with fixed roles (DL-LiteF and a fragment of DL-LiteR), improving upon previous decidability results that are limited ...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:
  • Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial

دوره 11  شماره 

صفحات  -

تاریخ انتشار 2007