Effective Reasoning With Large Ontologies in Polynomial Time
Pospishnyi O.S.
This paper overviews the problem of computational complexity of reasoning with ontologies. The description logic EL and EL++ is considered where logical entailment could be accomplished in polynomial time. We propose few modification to new and very promising ELK reasoner to support concrete domains (D) and ABox assertions.