Optimized Description Logic Reasoning via Core Blocking

نویسندگان

  • Birte Glimm
  • Ian Horrocks
  • Boris Motik
چکیده

State of the art reasoners for expressive description logics, such as those that underpin the OWL ontology language, are typically based on highly optimized implementations of (hyper)tableau algorithms. Despite numerous optimizations, certain ontologies encountered in practice still pose significant challenges to such reasoners, mainly because of the size of the model abstractions that they construct. To address this problem, we propose a new blocking technique that tries to identify and halt redundant construction at a much earlier stage than standard blocking techniques. An evaluation of a prototypical implementation in the HermiT reasoner shows that our technique can dramatically reduce the size of constructed model abstractions and reduce reasoning time.

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

ثبت نام

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

منابع مشابه

Optimized Reasoning in Description Logics Using Hypertableaux

We present a novel reasoning calculus for Description Logics (DLs)—knowledge representation formalisms with applications in areas such as the Semantic Web. In order to reduce the nondeterminism due to general inclusion axioms, we base our calculus on hypertableau and hyperresolution calculi, which we extend with a blocking condition to ensure termination. To prevent the calculus from generating...

متن کامل

Nonmonotonic Reasoning in Description Logic by Tableaux Algorithm with Blocking

To support nonmonotonic reasoning we introduce the description logic of minimal knowledge and negation as failure (MKNF-DL) as an extension of description logic with modal operators K and A. We discuss the problems with representation of a model for an MKNF-DL theory. For satisfiability checking of MKNF-DL theories, we introduce a tableaux algorithm with blocking, where blocking works with the ...

متن کامل

Model-Generation Theorem Proving for First-Order Logic Ontologies

Formal ontologies play an increasingly important role in demanding knowledge representation applications like the Semantic Web. Automated reasoning support for these ontologies is mandatory for tasks like debugging, classifying or querying the knowledge bases, and description logic (DL) reasoners have been shown to be very effective for that. Yet, as language extensions beyond (decidable) DLs a...

متن کامل

MetTeL: A Tableau Prover with Logic-Independent Inference Engine

MetTeL is a generic tableau prover for various modal, intuitionistic, hybrid, description and metric logics. The core component of MetTeL is a logic-independent tableau inference engine. A novel feature is that users have the ability to flexibly specify the set of tableau rules to be used in derivations. Termination can be achieved via a generalisation of a standard loop checking mechanism or u...

متن کامل

Optimized DL Reasoning via Core Blocking

State of the art reasoners for expressive DLs are typically model building procedures that decide the (un)satisfiability of a knowledge base K via a constructive search for an abstraction of a model for K. Despite numerous optimizations, certain existing and emerging knowledge bases still pose significant challenges to such reasoners mainly because these abstractions can be very large. To ensur...

متن کامل

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


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

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

ثبت نام

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

عنوان ژورنال:

دوره   شماره 

صفحات  -

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