Author of the publication

Redundancy Elimination on RDF Graphs in the Presence of Rules, Constraints, and Queries.

, , , and . RR, volume 6333 of Lecture Notes in Computer Science, page 133-148. Springer, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Complexity Analysis of General and Fractional Hypertree Decompositions., , , and . CoRR, (2020)Towards Reconciling SPARQL and Certain Answers., , , , and . WWW, page 23-33. ACM, (2015)Fractional Covers of Hypergraphs with Bounded Multi-Intersection., , , and . MFCS, volume 170 of LIPIcs, page 41:1-41:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings., , , and . AMW, volume 2369 of CEUR Workshop Proceedings, CEUR-WS.org, (2019)Containment and equivalence of well-designed SPARQL., and . PODS, page 39-50. ACM, (2014)The complexity of XPath query evaluation., , and . PODS, page 179-190. ACM, (2003)Solving Equational Problems Efficiently.. CADE, volume 1632 of Lecture Notes in Computer Science, page 97-111. Springer, (1999)Multicut Algorithms via Tree Decompositions., , and . CIAC, volume 6078 of Lecture Notes in Computer Science, page 167-179. Springer, (2010)Belief Revision within Fragments of Propositional Logic., , , and . KR, AAAI Press, (2012)On the Complexity of Enumerating the Answers to Well-designed Pattern Trees., , and . ICDT, volume 48 of LIPIcs, page 22:1-22:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)