The Semantic Web project started at the World Wide Web Consortium (W3C) is a widely deployed project explained officially with a Set theoretical semantics, which is designed to allow one to turn the web into a distributed database, useful for things like distributed social networks. It comes with various logic stacks, etc (RDFS, OWL,…) At the core of it is the RDF Resource Description Framework which comes with RDF semantics
This group may find the thesis Formal Modelling and Application of Graph Transformations in the Resource Description Framework very interesting as it puts the various RDF semantics directly in terms of category theory. For people coming from RDF that is a great way to learn category theory, for those from category theory this is a great way to learn RDF - and to contribute. It would be useful then to tie this in to other concepts from category theory, so that those coming from the RDF world can explore from this basis the space of category theory. Here is the abstract:
In this thesis, a connection between two areas of research is developed. On the one hand, the Resource Desription Framework (RDF) is the basis of the Semantic Web. On the other hand, algebraic graph transformation has a long history of providing formally well-founded modification concepts for various graph and graph-like structures.
By designing an algebraic transformation approach for RDF, the rich theoretical res- ults of algebraic graph transformation are made available to the RDF world. To achieve this goal, the formal abstract syntax and semantics of RDF is first reformulated in the language of category theory which is used heavily in graph transformation. Then, an abstract, categorical transformation framework is developed which is suitable for being afterwards instantiated by RDF structures. This is necessary since the existing frame- works are not applicable in an unmodified form.
The main theoretical results are a sequential composition operation for transformation rules and theorems showing the possibility to analyse and synthesise transformations for these sequentially composed rules. Moreover, these results are also available for transformation rules with negative application conditions.
The applicability of the resulting concept of RDF graph transformations is shown by two application scenarios. One is a classical Semantic Web application managing bibliographical metadata, while the other uses RDF as an abstract syntax for domain- specific modelling languages.
RDF has very practical uses. For example to see how RDF can be used to build Distributed Secure Social Networks see for example the ReadWriteWeb project. That project is written in Scala, which has libraries such as scalaz that use a lot of Category Theory, which is why I am here :-)
Does it make sense to add this category to the wiki?
]]>Hi,
It seems, that the reference pdf is dead on page Kirchhoff’s laws. Could somebody update it?
Thanks,
Miklós
Clicking on the Markdown+Itex Help button opens a new window with an HTTP 404 message.
]]>