Reasoning about RDF statements with default rules.
Elisa Bertino, Alessandro Provetti, Franco Salvetti · BIROn (Birkbeck, University of London) · 2005
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.