Uniform Resource Identifier (URI): Generic Syntax

Berners‐Lee, Tim; Fielding, R.; Masinter, L.

doi:10.17487/rfc3986

Cited by 828 publications

(925 citation statements)

References 5 publications

Supporting

Mentioning

886

Contrasting

Unclassified

Order By: Relevance

“…o uri: the URI as defined in [RFC3986]. In some cases, this will serve as the replacement string, and it will be left to the resolution server to arrive at the final usable URI.…”

Section: Public Identifiermentioning

confidence: 99%

Session Peering Provisioning Framework (SPPF)

Cartwright¹,

Bhatia²,

Ali³

et al. 2016

View full text Add to dashboard Cite

show abstract

“…o uri: the URI as defined in [RFC3986]. In some cases, this will serve as the replacement string, and it will be left to the resolution server to arrive at the final usable URI.…”

Section: Public Identifiermentioning

confidence: 99%

Session Peering Provisioning Framework (SPPF)

Cartwright¹,

Bhatia²,

Ali³

et al. 2016

View full text Add to dashboard Cite

show abstract

“…A URI (Berners- Lee, Fielding, & Masinter, 2005) is commonly defined as a string of characters used to identify or name a single resource. This definition seems odd given the fact that the architecture of the World Wide Web is mainly concerned with representations of information resources.…”

Section: Paradigms Of Identification Location Accessmentioning

confidence: 99%

Metadata for semantic and social applications<br />DC- 2008 Berlin

Greenberg¹,

Klas²

2008

View full text Add to dashboard Cite

“…This graph notation is used in Figure 4 to show how a postal address could be expressed in the Semantic Web. (Technically, we should give full URIs [16] for the labels of the edges and the address1 and uk nodes; we provide shorter labels for brevity.) Semantically, this datatype once again represents a postal address; however, by using subject-predicate-object triples, we have encoded a version of these semantics into the data more directly.…”

Section: Postal Address (Xml)mentioning

confidence: 99%

Towards a Fully Generic Theory of Data

Creager

Simpson

2006

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract. Modern software systems place a large emphasis on heterogeneous communication. For disparate applications to communicate effectively, a generic theory of data is required that works at the interapplication level. The key feature of such a theory is full generality, where the data model of an application is not restricted to any particular modeling formalism. Existing solutions do not have this property: while any data can be encoded in terms of XML or using the Semantic Web, such representations provide only basic generality, whereby to reason about an arbitrary application's data model it must be re-expressed using the formalism in question. In this paper we present a theory of data which is fully generic and utilizes an extensible design to allow the underlying formalisms to be incorporated into a specification only when necessary. We then show how this theory can be used to investigate two common data equivalence problems -canonicalization and transformation -independently of the datatypes involved.

show abstract

Uniform Resource Identifier (URI): Generic Syntax

Cited by 828 publications

References 5 publications

Session Peering Provisioning Framework (SPPF)

Session Peering Provisioning Framework (SPPF)

Metadata for semantic and social applications<br />DC- 2008 Berlin

Towards a Fully Generic Theory of Data

Contact Info

Product

Resources

About