A query tool for EL with non-monotonic rules

16Citations
Citations of this article
19Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present the Protégé plug-in NoHR that allows the user to take an EL⊥+ ontology, add a set of non-monotonic (logic programming) rules - suitable e.g. to express defaults and exceptions - and query the combined knowledge base. Our approach uses the well-founded semantics for MKNF knowledge bases as underlying formalism, so no restriction other than DL-safety is imposed on the rules that can be written. The tool itself builds on the procedure SLG(O) and, with the help of OWL 2 EL reasoner ELK, pre-processes the ontology into rules, whose result together with the non-monotonic rules serve as input for the top-down querying engine XSB Prolog. With the resulting plug-in, even queries to very large ontologies, such as SNOMED CT, augmented with a large number of rules, can be processed at an interactive response time after one initial brief pre-processing period. At the same time, our system is able to deal with possible inconsistencies between the rules and an ontology that alone is consistent. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Ivanov, V., Knorr, M., & Leite, J. (2013). A query tool for EL with non-monotonic rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8218 LNCS, pp. 216–231). https://doi.org/10.1007/978-3-642-41335-3_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free