First-order rewritability of atomic queries in horn description logics

    IJCAI, pp. 754-760, 2013.

    Cited by: 46|Bibtex|Views17|Links
    EI
    Keywords:
    tight complexity boundrelational database systemtight boundbasic classfirst-order rewritabilityMore(9+)

    Abstract:

    One of the most advanced approaches to querying data in the presence of ontologies is to make use of relational database systems, rewriting the original query and the ontology into a new query that is formulated in SQL or, equivalently, in first-order logic (FO). For ontologies written in many standard description logics (DLs), however, s...More

    Code:

    Data:

    Your rating :
    0

     

    Tags
    Comments