Generalized Satisfiability for the Description Logic ALC
Logic in Computer Science
2017-07-19 v1 Computational Complexity
Abstract
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and DL-Lite families, have an easier satisfiability problem; sometimes it is even tractable. We classify the complexity of the standard satisfiability problems for all possible Boolean and quantifier fragments of ALC in the presence of general axioms.
Cite
@article{arxiv.1103.0853,
title = {Generalized Satisfiability for the Description Logic ALC},
author = {Arne Meier and Thomas Schneider},
journal= {arXiv preprint arXiv:1103.0853},
year = {2017}
}
Comments
Technical Report with complete Proofs, Conference Version appeared in TAMC2011