Querying in EL+ with Nonmonotonic Rules

  • Authors:
  • Matthias Knorr;José Júlio Alferes

  • Affiliations:
  • CENTRIA, FCT/UNL, Portugal, email: {mknorr, jja}@di.fct.unl.pt;CENTRIA, FCT/UNL, Portugal, email: {mknorr, jja}@di.fct.unl.pt

  • Venue:
  • Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

A general top-down algorithmization for the Well-Founded MKNF Semantics --a semantics for combining rules and ontologies --was recently defined based on an extension of SLG resolution for Logic Programming with an abstract oracle to the parametric ontology language. Here we provide a concrete oracle with practical usage, namely for EL+ which is tractable for reasoning tasks like subsumption. We show that the defined oracle remains tractable (wrt. data complexity) so that the combined (query-driven) approach of non-monotonic rules with that oracle is tractable as well.