[Pellet-Users] Computational complexity and Pellet

[Renato Bulcão]

Hi all.

I've read such interesting Bernardo Cuenca's draft entitled "Tractable
Fragments of the OWL 1.1 Web Ontology Language". I have concerned
about the computational complexity using OWL 1.0 ontologies in the
reasoning process.

Bernardo's draft says OWL-DL and OWL-Lite combined complexities, but I
still have some doubts about that.

1. Can Pellet reduce the complexity of key inference problems to
polynomial time?
2. What are Pellet's optimizations for?
3. Which OWL constructs raise computational complexity w.r.t. Pellet
(e.g. unionOf, complementOf)?

Sorry for so many questions, but I really need those answers to
continue my PhD work.

Regards,

Renato Bulcão Neto