As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
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 [Escr ][Lscr ]+ 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.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.