View Item 
    •   Bozen-Bolzano Institutional Archive (BIA)
    • Free University of Bozen-Bolzano (UNIBZ)
    • Publications of the Faculty of Computer Science
    • Conference related Publications - Computer Science
    • View Item
    •   Bozen-Bolzano Institutional Archive (BIA)
    • Free University of Bozen-Bolzano (UNIBZ)
    • Publications of the Faculty of Computer Science
    • Conference related Publications - Computer Science
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Query rewriting in DL-Lite HN horn

    Thumbnail
    View/Open
    boto-arta-calv-DL-2010-submitted.pdf (225.7Kb)

    Date
    2010
    Author
    Botoeva, E
    Artale, A
    Calvanese, D
    Metadata
    Show full item record
    Abstract
    In this paper we present practical algorithms for query answering and knowledge base satisfiability checking in DL-Lite (HN) horn, a logic from the extended DL-Lite family that contains horn concept inclusions and number restriction. This logic is the most expressive DL that is shown to be FOL-rewritable. The algorithms we present are based on the rewriting technique so that reasoning over the TBox and over the ABox can be done independently of each other, and the inference problems are reduced to first order query evaluation. This allows for employing relational database technology for the final query evaluation and gives optimal data complexity.
    URI
    http://ceur-ws.org/Vol-573/paper_45.pdf
    http://hdl.handle.net/10863/2166
    Collections
    • Conference related Publications - Computer Science

    Browse

    All of BIACommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    Admin Login
    Privacy | Contact Us | About
    © UniBz