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.

    Rough EL Classification

    Date
    2013
    Author
    Peñaloza, R
    Zou, T
    Metadata
    Show full item record
    Abstract
    Rough Description Logics (DLs) have been studied as a means for representing and reasoning with imprecise knowledge. It has been shown that reasoning in rough DLs can be reduced to reasoning in a classical DL that allows value restrictions, and transitive and inverse roles. This shows that for propositionally closed DLs, the complexity of reasoning is not increased by the inclusion of rough constructors. However, applying such a reduction to rough EL yields an exponential time upper bound. We show that this blow-up in complexity can be avoided, providing a polynomial-time completion-based algorithm for classifying rough EL ontologies.
    URI
    http://ceur-ws.org/Vol-1014/paper_7.pdf
    http://hdl.handle.net/10863/2788
    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