Reasoning with Axioms: Theory and Pratice

05/09/2000
by   Ian Horrocks, et al.
0

When reasoning in description, modal or temporal logics it is often useful to consider axioms representing universal truths in the domain of discourse. Reasoning with respect to an arbitrary set of axioms is hard, even for relatively inexpressive logics, and it is essential to deal with such axioms in an efficient manner if implemented systems are to be effective in real applications. This is particularly relevant to Description Logics, where subsumption reasoning with respect to a terminology is a fundamental problem. Two optimisation techniques that have proved to be particularly effective in dealing with terminologies are lazy unfolding and absorption. In this paper we seek to improve our theoretical understanding of these important techniques. We define a formal framework that allows the techniques to be precisely described, establish conditions under which they can be safely applied, and prove that, provided these conditions are respected, subsumption testing algorithms will still function correctly. These results are used to show that the procedures used in the FaCT system are correct and, moreover, to show how efficiency can be significantly improved, while still retaining the guarantee of correctness, by relaxing the safety conditions for absorption.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/09/2011

Fusions of Description Logics and Abstract Description Systems

Fusions are a simple way of combining logics. For normal modal logics, f...
research
05/11/2000

Reasoning with Individuals for the Description Logic SHIQ

While there has been a great deal of work on the development of reasonin...
research
02/06/2013

Limitations of Skeptical Default Reasoning

Poole has shown that nonmonotonic logics do not handle the lottery parad...
research
10/02/2020

A Framework for Reasoning on Probabilistic Description Logics

While there exist several reasoners for Description Logics, very few of ...
research
01/15/2014

Automated Reasoning in Modal and Description Logics via SAT Encoding: the Case Study of K(m)/ALC-Satisfiability

In the last two decades, modal and description logics have been applied ...
research
02/26/2014

Even more generic solution construction in Valuation-Based Systems

Valuation algebras abstract a large number of formalisms for automated r...

Please sign up or login with your details

Forgot password? Click here to reset