A general framework for representing, reasoning and querying with annotated Semantic Web data
Journal of Web SemanticsPublished 16 September 2011
Antoine Zimmermann, Nuno Lopes, Axel Polleres, Umberto Straccia
Citations139
SJR quartileQ2
SJR score0.64
SNIP1.59
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
A generic framework for representing and reasoning with annotated Semantic Web data is described, and a generic method for combining multiple annotation domains allowing to represent, e.g., temporally-annotated fuzzy RDF is provided.
Abstract
We describe a generic framework for representing and reasoning with annotated Semantic Web data, a task becoming more important with the recent increased amount of inconsistent and non-reliable meta-data on the web. We formalise the annotated language, the corresponding deductive system and address the query answering problem. Previous contributions on specific RDF annotation domains are encompassed by our unified reasoning formalism as we show by instantiating it on (i) temporal, (ii) fuzzy, and (iii) provenance annotations. Moreover, we provide a generic method for combining multiple annotation domains allowing to represent, e.g., temporally-annotated fuzzy RDF. Furthermore, we address the development of a query language – AnQL – that is inspired by SPARQL, including several features of SPARQL 1.1 (subqueries, aggregates, assignment, solution modifiers) along with the formal definitions of their semantics.
Keywords
Computer ScienceDecision Sciences
Communications of the ACMMaintaining knowledge about temporal intervals
7,550 Citations1983James F. Allen
An interval-based temporal logic is introduced, together with a computationally effective reasoning algorithm based on constraint propagation, which is notable in offering a delicate balance between space and time.
Trends in logicMetamathematics of Fuzzy Logic
3,973 Citations1998Petr Hájek
This paper presents a meta-analysis of many-Valued Propositional Logic, focusing on the part of Lukasiewicz's Logic that deals with Complexity, Undecidability and Generalized Quantifiers and Modalities.
ACM Transactions on Database SystemsSemantics and complexity of SPARQL
1,137 Citations2009Jorge Eduardo Pérez Pérez, Marcelo Arenas +1 more
This article identifies a large class of SPARQL patterns, defined by imposing a simple and natural syntactic restriction, where the query evaluation problem can be solved more efficiently and shows that the evaluation problem is coNP-complete for well-designed patterns.
Named graphs, provenance and trust
520 Citations2005Jeremy J. Carroll, Christian Bizer +2 more
The extension of RDF to Named Graphs provides a formally defined framework to be a foundation for the Semantic Web trust layer.
The Journal of Logic ProgrammingTheory of generalized annotated logic programming and its applications**A preliminary report on this research has appeared in [34].
446 Citations1992Michael Kifer, V. S. Subrahmanian
A new semantics for multivalued logic programming is introduced: a model theory for Fitting's bilattice-based logic programming, which until now has not been characterized model-theoretically.
Lecture notes in computer scienceThe Semantic Web - ISWC 2009
343 Citations2009Abraham Bernstein, David R. Karger +5 more
Lecture notes in computer scienceYARS2: A Federated Repository for Querying Graph Structured Data from the Web
310 Citations2007Andreas Harth, Jürgen Umbrich +2 more
The architecture of an end-to-end semantic search engine that uses a graph data model to enable interactive query answering over structured and interlinked data collected from many disparate sources on the Web is presented.
Foundations of semantic web databases
284 Citations2004Claudio Gutiérrez, Carlos Hurtado +1 more
This work proposes a query language with well-defined semantics and study the complexity of query processing, query containment, and simplification of answers, including computational aspects of testing entailment and redundancy.
IEEE Transactions on Knowledge and Data EngineeringIntroducing Time into RDF
278 Citations2007Claudio Gutiérrez, Carlos Hurtado +1 more
This paper presents a framework to incorporate temporal reasoning into RDF, yielding temporal RDF graphs, and presents a semantics for these kinds of graphs which includes the notion of temporal entailment and a syntax to incorporate this framework into standard R DF graphs, using the RDF vocabulary plus temporal labels.
Lecture notes in computer scienceThe Expressive Power of SPARQL
236 Citations2008Renzo Angles, Claudio Gutiérrez
The main result is that SPARQL and non-recursive safe Datalog with negation have equivalent expressive power, and hence, by classical results, SParQL is equivalent from an expressiveness point of view to Relational Algebra.
Journal of Web SemanticsNamed graphs
223 Citations2005Jeremy J. Carroll, Christian Bizer +2 more
This paper provides a formally defined framework suited to being a foundation for the Semantic Web trust layer.
Querying data provenance
196 Citations2010Grigoris Karvounarakis, Zachary G. Ives +1 more
A query language for provenance is developed, which can express all of the aforementioned types of queries, as well as many more, and the feasibility of provenance querying and the benefits of the indexing techniques across a variety of application classes and queries are experimentally validated.
Provenance Information in the Web of Data
181 Citations2009Olaf Hartig
This paper discusses provenance of data on the Web and proposes a suitable provenance model, which represents data access, a dimension of provenance that is particularly relevant in the context of Web data.
Lecture notes in computer scienceApplied Temporal RDF: Efficient Temporal Querying of RDF Data with SPARQL
151 Citations2009Jonas Tappolet, Abraham Bernstein
This paper presents a syntax and storage format based on named graphs to express temporal RDF and shows that, depending on the underlying data's nature, the temporal RDF approach vastly reduces the number of triples by eliminating redundancies resulting in an increased performance for processing and querying.
Lecture notes in computer scienceMinimal Deductive Systems for RDF
144 Citations2007Sergio Muñoz, Jorge Eduardo Pérez Pérez +1 more
This paper presents a minimalist program for RDF, by showing how one can do without several predicates and keywords of the RDF Schema vocabulary, obtaining a simpler language which preserves the original semantics.
ACM Transactions on Computational LogicAnnotated RDF
101 Citations2010Octavian Udrea, Diego Reforgiato Recupero +1 more
This paper presents Annotated RDF, in which RDF triples are annotated by members of a partially ordered set that can be selected in any way desired by the user, and develops algorithms to check consistency of aRDF theories and to answer queries to aR DF theories.
ACM Transactions on Computational LogicFinitary winning in ω-regular games
99 Citations2009Krishnendu Chatterjee, Thomas A. Henzinger +1 more
The determinacy of games with finitary parity and Streett objectives is proved, algorithms for solving these games are presented, and the memory requirements of winning strategies are characterized.
Maryland Shared Open Access Repository (USMAI Consortium)Tracking RDF Graph Provenance using RDF Molecules
91 Citations2005Li Ding, Yun Peng +2 more
This paper investigates lossless decomposition of RDF graph and tracking the provenance of R DF graph using RDF molecule, which is the finest and lossless component of an RDFgraph.
Scaling RDF with Time
85 Citations2008Andrea Pugliese, Octavian Udrea +1 more
This paper proposes the tGRIN index structure that builds a specialized index for temporal RDF that is physically stored in an RDBMS, and shows that even when these efforts are augmented with well known temporal indexes like R+ trees, SR-trees, ST-index, and MAP21, the t GRIN index exhibits superior performance.
Journal of Web SemanticsQuerying for provenance, trust, uncertainty and other meta knowledge in RDF
74 Citations2009Renata Dividino, Sergej Sizov +2 more
This paper presents an original, generic, formalized and implemented approach for managing many dimensions of meta knowledge, like source, authorship, certainty and others, and extends SPARQL query processing in such a way that given a SParQL query for data, one may request meta knowledge without modifying the query proper.
Lecture notes in computer scienceQuerying Trust in RDF Data with tSPARQL
73 Citations2009Olaf Hartig
This paper presents tSPARQL, a trust-aware extension to SPARQL that allows adding trust to RDF-based applications in an easy manner and proposes a trust model that associates RDF statements with trust values and extends the SParQL semantics to access these trust values in tSParQL.
Theory and Practice of Logic ProgrammingSWI-Prolog and the web
66 Citations2008Jan Wielemaker, Zhisheng Huang +1 more
Lecture notes in computer scienceA Minimal Deductive System for General Fuzzy RDF
61 Citations2009Umberto Straccia
This work provides, under a very general semantics, a deductive system for a salient fragment of fuzzy RDF and shows how to compute the top-k answers of the union of conjunctive queries in which answers may be scored by means of a scoring function.
Lecture notes in computer scienceAnQL: SPARQLing Up Annotated RDFS
58 Citations2010Nuno Lopes, Axel Polleres +2 more
This work addresses the development of a query language - AnQL - that is inspired bySPARQL, including several features of SPARQL 1.1.1, and demonstrates the value of such a framework by comparing the approach to previously proposed extensions of SParQL and showing that AnQL generalises and extends them.
Lecture notes in computer scienceColoring RDF Triples to Capture Provenance
57 Citations2009Giorgos Flouris, Irini Fundulaki +3 more
This paper relies on colored RDF triples represented as quadruples to capture and manipulate explicit provenance information in conjunction with declarative languages for querying and updating RDF graphs.
Proceedings of the AAAI Conference on Artificial IntelligenceA General Framework for Representing and Reasoning with Annotated Semantic Web Data
57 Citations2010Umberto Straccia, Nuno Lopes +2 more
A generic framework for representing and reasoning with annotated Semantic Web data, formalise the annotated language, the corresponding deductive system, and address the query answering problem is described.
Lecture notes in computer scienceThe Semantic Web: Research and Applications
54 Citations2009Lora Aroyo, Grigoris Antoniou +2 more
Lecture notes in computer scienceA Generic Approach for Large-Scale Ontological Reasoning in the Presence of Access Restrictions to the Ontology’s Axioms
41 Citations2009Franz Baader, Martin Knechtel +1 more
The framework developed in this paper can deal with scenarios where selected sub-ontologies of a large ontology are offered as views to users, based on criteria like the user's access right, the trust level required by the application, or the level of detail requested by the user.
A fuzzy semantics for semantic web languages
38 Citations2005Mauro Mazzieri, Aldo Franco Dragoni
A fuzzy counterpart of the RDF Model Theory for RDF and RDF Schema is defined and how to implement the extended semantics in inference rules is shown.
Lecture notes in computer scienceA Fuzzy Semantics for the Resource Description Framework
36 Citations2008Mauro Mazzieri, Aldo Franco Dragoni
It is shown how the interpretation of an RDF graph (or anRDF Schema ontology) can be a matter of values, addressing a common problem in real-life knowledge management.
Exploiting RDFS and OWL for Integrating Heterogeneous, Large-Scale, Linked Data Corpora
34 Citations2011Aidan Hogan
This thesis designs bespoke algorithms based on the Semantic Web standards and traditional Information Retrieval techniques to help smooth out the heterogeneity of large-scale corpora of Linked Data aggregated from millions of sources on the Web in a scalable and robust manner.
Lecture notes in computer scienceOn the Semantics of Trust and Caching in the Semantic Web
24 Citations2008Simon Schenk
The stable model and well founded semantics are redefined and the Web Ontology Language OWL2 is reformalized based on logical bilattices, to augment OWL knowledge bases with trust based reasoning.
Lecture notes in computer scienceDynamic Querying of Mass-Storage RDF Data with Rule-Based Entailment Regimes
18 Citations2009Giovambattista Ianni, Thomas Krennwallner +2 more
It is shown that SPARQL faces certain unwanted ramifications when querying ontologies in conjunction with RDF datasets that comprise multiple named graphs, and an extension for SParQL is provided that remedies these effects.
Lecture notes in computer scienceA Generic Approach for Correcting Access Restrictions to a Consequence
13 Citations2010Martin Knechtel, Rafael Peñaloza
This paper presents algorithms for solving the problem of assigning a label, representing its access level, to each consequence from a given ontology with a variety of optimizations and presents first experimental results on large scale ontologies, which show that the methods perform well in practice.