Generalized satisfiability for the description logic ALC
l The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSpAcE-complete, and it is EXPTIME-complete in the presence of general concept inclusions. Several fragments of ALC, notably logics in the F L, E L, and DL-Lite families, have an easier satisfiability problem; for some of these logics, satisfiability can be decided in polynomial time. We classify the complexity of the standard variants of the satisfiability problem for all possible Boolean and quantifier fragments of ALC with and without general concept inclusions. (C) 2013 Published by Elsevier B.V.
satisfiability description logic alc complexity ontologies post's lattice