BIROn - Birkbeck Institutional Research Online

    Conservative rewritability of description logic TBoxes: first results

    Konev, B. and Lutz, C. and Wolter, F. and Zakharyaschev, Michael (2015) Conservative rewritability of description logic TBoxes: first results. CEUR Workshop Proceedings , ISSN 1613-0073.

    [img]
    Preview
    Text
    17729.pdf - Published Version of Record

    Download (388kB) | Preview

    Abstract

    We want to understand when a given TBox T in a description logic L can be rewritten into a TBox T′ in a weaker description logic L′. Two notions of rewritability are considered: model-conservative rewritability (T′ entails T and all models of T can be expanded to models of T′) and L-conservative rewritability (T′ entails T and every L-consequence of T′ in the signature of T is a consequence of T ) and investigate rewritability of TBoxes in ALCI to ALC, ALCQ to ALC, ALC to EL⊥, and ALCI to DL-Litehorn. We compare conservative rewritability with equivalent rewritability, give model-theoretic characterizations of conservative rewritability, prove complexity results for deciding rewritability, and provide some rewriting algorithms.

    Metadata

    Item Type: Article
    Additional Information: DL 2015 Description Logics Workshop - Proceedings of the 28th International Workshop on Description Logics. Athens, Greece, June 7th to 10th, 2015. Edited by Diego Calvanese and Boris Konev
    School: Birkbeck Schools and Departments > School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Administrator
    Date Deposited: 19 Dec 2016 15:45
    Last Modified: 07 Jul 2020 00:17
    URI: http://eprints.bbk.ac.uk/id/eprint/17729

    Statistics

    Downloads
    Activity Overview
    33Downloads
    109Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item