BIROn - Birkbeck Institutional Research Online

    DL − Lite and role inclusions

    Kontchakov, Roman and Zakharyaschev, Michael (2008) DL − Lite and role inclusions. In: Domingue, J. and Anutariya, C. (eds.) The Semantic Web. Lecture Notes in Computer Science 5367. Berlin, Germany: Springer, pp. 16-30. ISBN 9783540897033.

    Full text not available from this repository.


    We give a classification of the complexity of DL-Lite logics extended with role inclusion axioms. We show that the data complexity of instance checking becomes P-hard in the presence of functionality constraints, and coNP-hard if arbitrary number restrictions are allowed, even with primitive concept inclusions. The combined complexity of satisfiability in this case jumps to ExpTime. On the other side, the combined complexity for the logics without number restrictions depends only on the form of concept inclusions and can range from NLogSpace and P to NP; the data complexity for such logics stays in LogSpace.


    Item Type: Book Section
    Additional Information: 3rd Asian Semantic Web Conference, ASWC 2008, Bangkok, Thailand, December 8-11, 2008. Proceedings.
    School: Birkbeck Faculties and Schools > Faculty of Science > School of Computing and Mathematical Sciences
    Depositing User: Administrator
    Date Deposited: 13 May 2013 13:06
    Last Modified: 09 Aug 2023 12:33


    Activity Overview
    6 month trend
    6 month trend

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item