Querying in ℰℒ+ with nonmonotonic rules

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Citations (Scopus)

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 ℰℒ+ 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.

Original languageEnglish
Title of host publicationECAI 2010 - 19th European Conference on Artificial Intelligence
EditorsH. Coelho, R. Studer, M. Wooldridge
Publisher{IOS} Press
Pages1079-1080
Number of pages2
ISBN (Print)9781607506058
DOIs
Publication statusPublished - 1 Jan 2010
Event2nd Workshop on Knowledge Representation for Health Care, KR4HC 2010, held in conjunction with the 19th European Conference in Artificial Intelligence, ECAI 2010 - Lisbon, Portugal
Duration: 17 Aug 201017 Aug 2010

Publication series

NameFrontiers in Artificial Intelligence and Applications
Publisher{IOS} Press
Volume215
ISSN (Print)0922-6389

Conference

Conference2nd Workshop on Knowledge Representation for Health Care, KR4HC 2010, held in conjunction with the 19th European Conference in Artificial Intelligence, ECAI 2010
CountryPortugal
CityLisbon
Period17/08/1017/08/10

Fingerprint

Dive into the research topics of 'Querying in ℰℒ<sup>+</sup> with nonmonotonic rules'. Together they form a unique fingerprint.

Cite this