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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Meier, A., & Schneider, T. (2011). Generalized satisfiability for the description logic ALC (extended abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6648 LNCS, pp. 552–562). https://doi.org/10.1007/978-3-642-20877-5_53
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
