Parameterized Complexity and Fixed-Parameter Tractability of Description Logic Reasoning

An important goal of research in description logics (DLs) and related logic-based KR formalisms is to identify the worst-case complexity of reasoning. Such results, however, measure the complexity of a logic as a whole. For example, reasoning in the basic DL \(\mathcal{ALCI}\) is ExpTime-complete, which means that \(\mathcal{ALCI}\) constructors can be used in a way so that exponential time is strictly required for solving a reasoning problem. It is, however, well known that, given two \(\mathcal{ALCI}\) knowledge bases of roughly the same size, reasoning with one knowledge base may be much more difficult than with the other, depending on the interaction of the axioms in the KBs. Thus, existing worst-case complexity results provide only a very coarse measure of reasoning complexity, and they do not tell us much about the “hardness” of each individual knowledge base.

Authors and Affiliations

1. Department of Computer Science, University of Oxford, Wolfson Building, Parks Road, OX1 3QD, Oxford, UK

   Boris Motik

Editors and Affiliations

1. Microsoft Research, One Microsoft Way, 98052-6399, Redmond, WA, USA

   Nikolaj Bjørner

2. School of computer Science, University of Manchester, Kilburn Building, Oxford Road, MP13 9PL, Manchester, UK

   Andrei Voronkov

Reprints and permissions

© 2012 Springer-Verlag Berlin Heidelberg

Policies and ethics