Reasoning with Axioms: Theory and Pratice
| dc.creator | Horrocks, Ian | |
| dc.creator | Tobies, Stephan | |
| dc.date | 2000-05-09 | |
| dc.date.accessioned | 2026-07-07T03:16:13Z | |
| dc.date.available | 2026-07-07T03:16:13Z | |
| dc.description | 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. | |
| dc.description | This paper appeard in the Proceedings of KR'2000 | |
| dc.identifier | https://arxiv.org/abs/cs/0005012 | |
| dc.identifier | http://arxiv.org/abs/cs/0005012 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/30264 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Artificial Intelligence | |
| dc.subject | F.4.1, I.2.3, I.2.4 | |
| dc.title | Reasoning with Axioms: Theory and Pratice | |
| dc.type | text |