BIROn - Birkbeck Institutional Research Online

    Temporal OBDA with LTL and DL-Lite

    Artale, A. and Kontchakov, Roman and Kovtunova, A. and Ryzhikov, V. and Wolter, F. and Zakharyaschev, Michael (2014) Temporal OBDA with LTL and DL-Lite. In: Bienvenu, M. and Ortiz, M. and Rosati, R. and Simkus, M. (eds.) Informal Proceedings of DL (Vienna, 17-20 July). CEUR Workshop Proceedings 1193. CEUR, pp. 21-32.

    [img]
    Preview
    Text
    DL-2014-final.pdf - Author's Accepted Manuscript

    Download (395kB) | Preview

    Abstract

    We investigate various types of query rewriting over ontologies given in the standard temporal logic LTL as well as combinations of LTL with DL-Lite logics. In particular, we consider FO(<)-rewritings that can use the temporal precedence relation, FO(<; +)-rewritings that can also employ the arithmetic predicate PLUS, and rewritings to fi�nite automata with data given on the automaton tape.

    Metadata

    Item Type: Book Section
    Additional Information: Informal Proceedings of the 27th International Workshop on Description Logics - Vienna, Austria, July 17-20, 2014. - Series ISSN: 1613-073
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Roman Kontchakov
    Date Deposited: 11 Aug 2014 08:56
    Last Modified: 01 Aug 2019 06:12
    URI: http://eprints.bbk.ac.uk/id/eprint/10352

    Statistics

    Downloads
    Activity Overview
    0Downloads
    0Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item