BIROn - Birkbeck Institutional Research Online

    Reasoning about RDF statements with default rules

    Bertino, E. and Provetti, Alessandro and Salvetti, F. (2005) Reasoning about RDF statements with default rules. In: UNSPECIFIED (ed.) W3C Workshop on Rule Languages for Interoperability. W3C.

    Full text not available from this repository.

    Abstract

    We propose a version of Local Closed-World Assumption that is well-suited for logic-based data and knowledge integration from disparate Web sources and for agent communication over the Web. To do so, we propose a default-based interpretation of the basic type inheritance primitives of RDF in terms of Answer Set Programs. Translating such statements into Answer Set Programming gives them an alternative declarative semantics and makes it possible to apply the inferential engines now available for Answer Set Programming. Our proposal is orthogonal to the current development of Semantic Web languages but it can help by i) making object description compact and most importantly ii) preventing large data sets from inconsistencies arising from multiple inheritance.

    Metadata

    Item Type: Book Section
    School: School of Business, Economics & Informatics > Computer Science and Information Systems
    Depositing User: Sarah Hall
    Date Deposited: 26 Jul 2021 17:42
    Last Modified: 27 Jul 2021 13:27
    URI: https://eprints.bbk.ac.uk/id/eprint/45293

    Statistics

    Downloads
    Activity Overview
    0Downloads
    15Hits

    Additional statistics are available via IRStats2.

    Archive Staff Only (login required)

    Edit/View Item Edit/View Item