TU Dresden. Account Anmelden. Edit tools Diskussion. Formular anzeigen. Quelltext anzeigen. Suche Search. Lage und Kontakt. Studium Lehrveranstaltungen. Europäischer Master. Internationaler Master. Forschung Forschungsfelder. Kooperation Angebote. Completeness and soundness guarantees for conjunctive SPARQL queries over RDF data sources with completeness statements Aus International Center for Computational Logic. Wechseln zu: NavigationSuche. Publikationen Publications. Sebastian Rudolph Sebastian Rudolph Simon Razniewski Simon Razniewski. Computational Logic Computational Logic. Toggle side column. Completeness and soundness guarantees for conjunctive SPARQL queries over RDF data sources with completeness statements Fariz Darari Fariz DarariSebastian Rudolph Sebastian RudolphSimon Razniewski Simon RazniewskiWerner Nutt Werner Nutt. Download DOI Link. Fariz Darari, Sebastian Rudolph, Simon Razniewski, Werner Nutt Completeness and soundness guarantees for conjunctive SPARQL queries over RDF data sources with completeness statements Semantic Web, 11 3Details Bibtex Kurzfassung Abstract RDF generally follows the open-world assumption: information is incomplete by default. Consequently, SPARQL queries cannot retrieve with certainty complete answers, and even worse, when they involve negation, it is unclear whether they produce sound answers. Nevertheless, there is hope to lift this limitation. On many specific topics e. In this work, we leverage completeness statements over RDF data sources to provide guarantees of completeness and soundness for conjunctive SPARQL queries. We develop a technique to check whether query completeness can be guaranteed by taking into account also the specifics of the queried graph, and analyze the complexity of such checking. For queries with negation, we approach the problem of query soundness checking, and distinguish between answer soundness i. We provide a formalization and characterize the soundness problem via a reduction to the completeness problem. We further develop heuristic techniques for completeness checking, werner nutt conduct experimental evaluations based on Wikidata, a prominent, real-world knowledge base, to demonstrate the feasibility of our approach. Weitere Informationen unter: Further Werner nutt Link Forschungsgruppe: Research Group: Computational Logic Computational Logic. Kategorien : Article Publikation. Links auf diese Seite. Änderungen an verlinkten Seiten. Permanenter Link. Attribute anzeigen.
Für die neusten Vakanzen registrieren Sie sich für die Job-Alerts. Please activate JavaScript in your browser settings. Consequently, SPARQL queries cannot retrieve with certainty complete answers, and even worse, when they involve negation, it is unclear whether they produce sound answers. Jobs nach Arbeitgeber IU International University o April um Uhr bearbeitet.
Page footer with additional informations about DFKI
AusschreibungDekret des Rektors Nr. / vom Ausschreibung. Completeness and soundness guarantees for conjunctive SPARQL queries over RDF data sources. Author(s): Nutt, Werner. Nutt, Werner). Title: Unification in monoidal theories is solving linear equations over semirings. Proceedings of the Workshop on Knowledge Representation and Configuration. Year of Publication: Forscher/Forscherin mit befristetem Arbeitsvertrag - Informatik (Prof. In: Franz Baader; Hans-Jürgen Bürckert; Werner Nutt (Hrsg.). Fariz Darari, Sebastian Rudolph, Simon Razniewski, Werner Nutt. Language: English.Zeigt jobs in Englisch, Deutsch Einstellungen ändern. Bitte aktivieren sie JavaScript in den Einstellungen Ihres Browsers. We develop a technique to check whether query completeness can be guaranteed by taking into account also the specifics of the queried graph, and analyze the complexity of such checking. Download DOI Link. You can instead create a job alert here. Region wählen. Permanenter Link. SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz. In this work, we leverage completeness statements over RDF data sources to provide guarantees of completeness and soundness for conjunctive SPARQL queries. Veröffentlicht vor 2 Monaten. Monoidal theories axiomatize varieties of abelian monoids. Europäischer Master. Einstellungen speichern. We show that every unification problem in a monoidal theory can be translated into a system of linear equations over the corresponding semiring. An email confirmation has been sent to your email. Wähle deine Region Wähle die Region, die am besten zu deinem Standort oder deinen Vorlieben passt. AusschreibungDekret des Rektors Nr. Applying Hilbert's Basis Theorem we prove that theories of groups with commuting homomorphisms are unitary with respect to unification with and without constants. Please activate JavaScript in your browser settings. To every monoidal theory we associate a semiring. Änderungen an verlinkten Seiten. Nevertheless, there is hope to lift this limitation. TU Dresden. For questions regarding your application, please contact the employer. Although for numerous equational theories unification algorithms have been developed there is still a lack of general methods. Forschung Forschungsfelder. Suche Search. Die Publikationen der UdS SciDok - Der Wissenschaftsserver der Universität des Saarlandes. We provide a formalization and characterize the soundness problem via a reduction to the completeness problem.