Generalized Satisfiability for the Description Logic ALC - (Extended Abstract)

@inproceedings{Meier2011GeneralizedSF,
  title={Generalized Satisfiability for the Description Logic ALC - (Extended Abstract)},
  author={Arne Meier and Thomas Schneider},
  booktitle={TAMC},
  year={2011}
}
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIMEcomplete 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… CONTINUE READING