Talks and Poster Presentations (with Proceedings-Entry):
R. Pichler, A. Polleres, S. Skritek, S. Woltran:
"Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries";
Talk: RR 2010 - The fourth international Conference on Web Reasoning and Rule Systems,
- 2010-09-24; in: "RR 2010",
P. Hitzler, T. Lukasiewicz (ed.);
Lecture Notes/ Springer,
Based on practical observations on rule-based inference on RDF data, we study the problem of redundancy elimination on RDF graphs in the presence of rules (in the form of Datalog rules) and constraints
(in the form of so-called tuple-generating dependencies), as well
as with respect to queries (ranging from conjunctive queries up to more complex ones, particularly covering features of SPARQL, such as union, negation, or filters). To this end, we investigate the influence of several problem parameters (like restrictions on the size of the rules, the constraints, and/or the queries) on the complexity of detecting redundancy. The main result of this paper is a fine-grained complexity analysis of both graph and rule minimisation in various settings.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
Created from the Publication Database of the Vienna University of Technology.