Module Extraction via Query Inseparability in OWL 2 QL

We show that deciding conjunctive query inseparability for OWL 2 QL ontologies is PSpace-hard and in ExpTime. We give polynomial-time (incomplete) algorithms and demonstrate by experiments that they can be used for practical module extraction.

• Type: Journal
• Year: 2011
• Where: DLOG
• Authors: Boris Konev, Roman Kontchakov, Michel Ludwig, Thomas Schneider 0002, Frank Wolter, Michael Zakharyaschev
• Keywords: Automated Reasoning, DLOG 2011, Inseparability, Ontologies, Polynomial Time