3 research outputs found
Modelling the Semantic Web using a Type System
We present an approach for modeling the Semantic Web as a type system. By
using a type system, we can use symbolic representation for representing linked
data. Objects with only data properties and references to external resources
are represented as terms in the type system. Triples are represented
symbolically using type constructors as the predicates. In our type system, we
allow users to add analytics that utilize machine learning or knowledge
discovery to perform inductive reasoning over data. These analytics can be used
by the inference engine when performing reasoning to answer a query.
Furthermore, our type system defines a means to resolve semantic heterogeneity
on-the-fly
A descriptive type foundation for RDF Schema
This paper provides a type theoretic foundation for descriptive types that appear in Linked Data. Linked Data is data published on the Web according to principles and standards supported by the W3C. Such Linked Data is inherently messy: this is due to the fact that instead of being assigned a strict a priori schema, the schema is inferred a posteriori. Moreover, such a posteriori schema consists of opaque names that guide programmers, without prescribing structure. We employ what we call a descriptive type system for Linked Data. This descriptive type system differs from a traditional type system in that it provides hints or warnings rather than errors and evolves to describe the data while Linked Data is discovered at runtime. We explain how our descriptive type system allows RDF Schema inference mechanisms to be tightly coupled with domain specific scripting languages for Linked Data, enabling interactive feedback to Web developers.MOE (Min. of Education, S’pore)Accepted versio