As applications of description logics proliferate, efficient reasoning with large ABoxes (sets
of individuals with descriptions) becomes ever more important. Motivated by the prospects of …

Abstract Description logics (DLs) are knowledge representation formalisms with well-
understood model-theoretic semantics and computational properties. The DL SHIQ (D) …

In this paper we advocate the use of multi-dimensional modal logics as a framework for
knowledge representation and, in particular, for representing spatio-temporal information …

Consequence-based ontology reasoning procedures have so far been known only for Horn
ontology languages. A difficulty in extending such procedures is that non-Horn axioms seem …

For lack of general algorithmic methods that apply to wide classes of logics, establishing a
complexity bound for a given modal logic is often a laborious task. The present work is a …

The guarded fragment and its extensions and subfragments are often considered as a
framework for investigating the properties of description logics. There are also other, some …

LNAI 1847 - MSPASS: Modal Reasoning by Translation and First-Order Resolution Page 1
MSPASS: Modal Reasoning by Translation and First-Order Resolution Ullrich Hustadt1 and …

It has often been claimed that model checking, special purpose automated deduction or
interactive theorem proving are needed for formal program development. We demonstrate …

Publisher Summary This chapter examines computational approaches to modal logics. A
variety of computational approaches and reasoning problems are considered, the use of …

We provide a simple translation of the satisfiability problem for regular grammar logics with
converse into GF 2, which is the intersection of the guarded fragment and the 2-variable …