Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
Terminological reasoning is inherently intractable (research note)
Artificial Intelligence
Attributive concept descriptions with complements
Artificial Intelligence
The complexity of existential quantification in concept languages
Artificial Intelligence
The complexity of concept languages
Information and Computation
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
Journal of the ACM (JACM)
Artificial Intelligence
Information and Computation
A Terminological Knowledge Representation System with Complete Inference Algorithms
PDK '91 Proceedings of the International Workshop on Processing Declarative Knowledge
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A practical decision method for propositional dynamic logic (Preliminary Report)
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
The description logic handbook
Proof-Theoretic Approach to Description-Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
The complexity of propositional implication
Information Processing Letters
DL-Lite: tractable description logics for ontologies
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 2
DL-lite in the light of first-order logic
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Terminological cycles in a description logic with existential restrictions
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
The DL-lite family and relations
Journal of Artificial Intelligence Research
Generalized modal satisfiability
Journal of Computer and System Sciences
| Hi-index | 5.23 |
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 FL, EL, 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.