Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoningReportar como inadecuado




Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Reference: Kaminski, M, Nenov, Y and Cuenca Grau, B, (2014). Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning.Citable link to this page:

 

Datalog rewritability of disjunctive datalog programs and its applications to ontology reasoning

Abstract: We study the problem of rewriting a disjunctive datalog program into plain datalog. We show that a disjunctive program is rewritable if and only if it is equivalent to a linear disjunctive program, thus providing a novel characterisation of datalog rewritability. Motivated by this result, we propose weakly linear disjunctive datalog—a novel rule-based KR language that extends both datalog and linear disjunctive datalog and for which reasoning is tractable in data complexity. We then explore applications of weakly linear programs to ontology reasoning and propose a tractable extension of OWL 2 RL with disjunctive axioms. Our empirical results suggest that many non-Horn ontologies can be reduced to weakly linear programs and that query answering over such ontologies using a datalog engine is feasible in practice.

Peer Review status:Peer reviewedPublication status:PublishedVersion:Accepted manuscript Funder: Royal Society   Funder: Engineering and Physical Sciences Research Council   Funder: Seventh Framework Programme   Conference Details: Twenty-Eighth AAAI Conference on Artificial IntelligenceNotes:Copyright © 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Bibliographic Details

Publisher: Association for Computing Machinery

Publisher Website: http://www.acm.org/

Host: Twenty-Eighth AAAI Conference on Artificial Intelligencesee more from them

Publication Website: http://dl.acm.org/citation.cfm?id=2893873

Issue Date: 2014-07

pages:1077-1083Identifiers

Urn: uuid:d7f67d5b-8ca7-4f75-b970-4a303e3f36a1

Isbn: 9781577356783

Source identifier: 462835 Item Description

Type: Conference;

Version: Accepted manuscriptKeywords: cs.AI cs.AI cs.LO Tiny URL: pubs:462835

Relationships





Autor: Kaminski, M - institutionUniversity of Oxford Oxford, MPLS, Computer Science - - - Nenov, Y - institutionUniversity of Oxford Oxf

Fuente: https://ora.ox.ac.uk/objects/uuid:d7f67d5b-8ca7-4f75-b970-4a303e3f36a1



DESCARGAR PDF




Documentos relacionados