Boosting the correspondence between description logics and propositional dynamic logics
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Expressiveness of concept expressions in first-order description logics
Artificial Intelligence
Mathematical Theory of Program Correctness
Mathematical Theory of Program Correctness
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Automata theoretic techniques for modal logics of programs: (Extended abstract)
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family
Journal of Automated Reasoning
Complexity of Subsumption in the EL Family of Description Logics: Acyclic and Cyclic TBoxes
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
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
Deciding inseparability and conservative extensions in the description logic EL
Journal of Symbolic Computation
Effective query rewriting with ontologies over DBoxes
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A finite basis for the set of ƐL-implications holding in a finite model
ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
A practical approach for computing generalization inferences in EL
ESWC'11 Proceedings of the 8th extended semantic web conference on The semantic web: research and applications - Volume Part I
Most specific generalizations w.r.t. general EL-TBoxes
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Beth definability in expressive description logics
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
We investigate the expressive power and computational complexity of ELν, the extension of the lightweight description logic EL with concept constructors for greatest fixpoints. It is shown that ELν has the same expressive power as EL extended with simulation quantifiers and that it can be characterized as a largest fragment of monadic second-order logic that is preserved under simulations and has finite minimal models. As in basic EL, all standard reasoning problems for general TBoxes can be solved in polynomial time. ELν has a range of very desirable properties that EL itself is lacking. Firstly, least common subsumers w.r.t. general TBoxes as well as most specific concepts always exist and can be computed in polynomial time. Secondly, ELν shares with EL the Craig interpolation property and the Beth definability property, but in contrast to EL allows the computation of interpolants and explicit concept definitions in polynomial time.