Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
835
Signing RDF Graphs
- In 2nd ISWC, volume 2870 of LNCS
, 2003
"... Assuming P<GI<NP, the creation and verification of a digital signature of an arbitrary RDF graph cannot be done in polynomial time. ..."
Abstract
-
Cited by 65 (5 self)
- Add to MetaCart
Assuming P<GI<NP, the creation and verification of a digital signature of an arbitrary RDF graph cannot be done in polynomial time.
Matching RDF Graphs
- In 2nd ISWC, volume 2870 of LNCS
, 2002
"... The Resource Description Framework (RDF) describes graphs of statements about resources. This paper explores the equality of two RDF graphs in light of the graph isomorphism literature. We consider anonymous resources as unlabelled vertices in a graph, and show that the standard graph isomorphism al ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
The Resource Description Framework (RDF) describes graphs of statements about resources. This paper explores the equality of two RDF graphs in light of the graph isomorphism literature. We consider anonymous resources as unlabelled vertices in a graph, and show that the standard graph isomorphism
On partial encryption of rdf-graphs
- International Semantic Web Conference, volume 3729 of Lecture
, 2005
"... Abstract. In this paper a method for Partial RDF Encryption (PRE) is proposed in which sensitive data in an RDF-graph is encrypted for a set of recipients while all non-sensitive data remain publicly readable. The result is an RDF-compliant self-describing graph containing encrypted data, encryption ..."
Abstract
-
Cited by 17 (1 self)
- Add to MetaCart
Abstract. In this paper a method for Partial RDF Encryption (PRE) is proposed in which sensitive data in an RDF-graph is encrypted for a set of recipients while all non-sensitive data remain publicly readable. The result is an RDF-compliant self-describing graph containing encrypted data
Theme Identification in RDF Graphs?
"... Abstract. An increasing number of RDF datasets is published on the Web. A user willing to use these datasets will first have to explore them in order to determine which information is relevant for his specific needs. To facilitate this exploration, we present an approach allowing to provide a themat ..."
Abstract
- Add to MetaCart
thematic view of a given RDF dataset, making it easier to target the rel-evant resources and properties. Our approach combines a density-based graph clustering algorithm with semantic criteria in order to identify clusters, each one corresponding to a theme. Prior to clustering, the ini-tial RDF graph
Query-Oriented Summarization of RDF Graphs
"... The Resource Description Framework (RDF) is a graph-based data model promoted by the W3C as the standard for Semantic Web applications. Its associated query language is SPARQL. RDF graphs are often large and varied, produced ..."
Abstract
- Add to MetaCart
The Resource Description Framework (RDF) is a graph-based data model promoted by the W3C as the standard for Semantic Web applications. Its associated query language is SPARQL. RDF graphs are often large and varied, produced
Tracking rdf graph provenance using rdf molecules
, 2005
"... The Semantic Web can be thought of as one large “universal” RDF graph distributed across many Web pages. Since the graph is an unwieldy view, we usually work with online RDF documents. This is natural and appropriate for most tasks ..."
Abstract
-
Cited by 45 (7 self)
- Add to MetaCart
The Semantic Web can be thought of as one large “universal” RDF graph distributed across many Web pages. Since the graph is an unwieldy view, we usually work with online RDF documents. This is natural and appropriate for most tasks
Node-centric RDF Graph Visualization
, 2004
"... This paper describes a node-centric technique for visualizing Resource Description Framework (RDF) graphs. Nodes of interest are discovered by searching over literals. Subgraphs for display are constructed by using the area around selected nodes. Wider views are created by sorting and displaying ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
This paper describes a node-centric technique for visualizing Resource Description Framework (RDF) graphs. Nodes of interest are discovered by searching over literals. Subgraphs for display are constructed by using the area around selected nodes. Wider views are created by sorting
Large-Scale Bisimulation of RDF Graphs
"... RDF datasets with billions of triples are no longer unusual and continue to grow constantly (e.g. LOD cloud) driven by the inherent flexibility of RDF that allows to represent very diverse datasets, ranging from highly structured to un-structured data. Because of their size, understanding and proces ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
and processing RDF graphs is often a difficult task and methods to reduce the size while keeping as much of its structural in-formation become attractive. In this paper we study bisimu-lation as a means to reduce the size of RDF graphs according to structural equivalence. We study two bisimulation algo
Interpreting SWRL Rules in RDF Graphs
, 2006
"... An unresolved issue in SWRL (the Semantic Web Rule Language) is whether the intended semantics of its RDF representation can be described as an extension of the W3C RDF semantics. In this paper we propose to make the model-theoretic semantics of SWRL compatible with RDF by interpreting SWRL rules in ..."
Abstract
- Add to MetaCart
in RDF graphs. For dealing with SWRL/RDF rules, we regard ‘Implies’ as an OWL class, and extract all ‘Implies’ rules from an RDF database that represents a SWRL knowledge base. Each ‘Implies ’ rule is grounded through mappings built into the semantic conditions of the model theory. Based on the fixpoint
Results 1 - 10
of
835
