BIROn - Birkbeck Institutional Research Online

    Datalog extensions for tractable query answering over ontologies

    Calì, Andrea and Gottlob, G. and Lukasiewicz, T. (2009) Datalog extensions for tractable query answering over ontologies. In: de Virgilio, R. and Giunchiglia, F. and Tanca, L. (eds.) Semantic Web Information Management. Berlin, Germany: Springer, pp. 249-279. ISBN 9783642043284.

    Full text not available from this repository.

    Abstract

    We survey a recently introduced family of expressive extensions of Datalog, called Datalog±, which is a new framework for representing ontologies in the form of integrity constraints, and for query answering under such constraints. Datalog± is derived from Datalog by allowing existentially quantified variables in rule heads, and by enforcing suitable properties in rule bodies, to ensure decidable and efficient query answering. We first present different languages in the Datalog± family, providing tight complexity bounds for nearly all cases. We then show that such languages are general enough to capture the most common tractable ontology languages. In particular, Datalog± can express the DL-Lite family of description logics and F-Logic Lite. Datalog± is a natural and very general framework that can be employed in different contexts such as data integration and exchange.

    Metadata

    Item Type: Book Section
    Additional Information: A Model-Based Perspective
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Research Centre: Birkbeck Knowledge Lab
    Depositing User: Administrator
    Date Deposited: 14 May 2013 10:23
    Last Modified: 02 Dec 2016 13:22
    URI: http://eprints.bbk.ac.uk/id/eprint/6743

    Statistics

    Downloads
    Activity Overview
    0Downloads
    86Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item