Reasoning with Individuals for the Description Logic SHIQ
Ian Horrock, Ulrike Sattler, Stephan Tobies
Abstract
While there has been a great deal of work on the development of reasoning algorithms for expressive description logics, in most cases only Tbox reasoning is considered. In this paper we present an algorithm for combined Tbox and Abox reasoning in the SHIQ description logic. This algorithm is of particular interest as it can be used to decide the problem of (database) conjunctive query containment w.r.t. a schema. Moreover, the realisation of an efficient implementation should be relatively straightforward as it can be based on an existing highly optimised implementation of the Tbox algorithm in the FaCT system.
Create a lesson
Related papers
Timed Games under Environmental Interference with Real-Time Objectives
Andrea Manini, Matteo Rossi, Pierluigi San Pietro
Executable Specifications in Transition Algebra
Daniel Găină, Adrián Riesco, Ionuţ Ţuţu
Essential Unitarity for Higher-Order Quantum Computation (Extended Abstract)
Samson Abramsky, Radha Jagadeesan
Sundance: A Simple SMT Solver for Program Verification
Amar Shah, Benjamin F. Jones, Can Cebeci et al.
Global Trace Condition for Injective Transition Graphs
Stefano Berardi, Ugo de'Liguoro, Daniel Osorio-Valencia
Aero-VPA: Few-Step Flow-Matching Control over Non-Reconstructive JEPA Latents for Agile Flight on Edge Hardware
Yeonseok Lee