Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
Abstractions for mobile computations
Secure Internet programming
Maude: specification and programming in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
ASA/MA 2000 Proceedings of the Second International Symposium on Agent Systems and Applications and Fourth International Symposium on Mobile Agents
Hi-index | 0.00 |
RDF looks like the first step to build the Semantic Web vision. Our long-term goal is to have a sound way to verify and validate the semantic web interactions that applications and agents may develop in a distributed environment. The first step for reaching this goal is to provide a useful semantic support to RDF itself. Based on this formal support, properties may be analyzed, as well as transformations and verifications can be performed. In this paper we propose an intuitive and formal semantics for RDF by means of a translation of RDF documents into executable object-oriented modules in the formal language Maude. This translation provides a semantics for RDF documents and allows programs managing them to be expressed in the same formalism, since Maude specifications are executable. Moreover, due to the reflective features of Maude, this translation can be implemented in Maude itself. Finally, translated RDF documents are integrated in an agent application written in Mobile Maude, that is, the same framework is used for both translating RDF documents and expressing the programs that manipulate them.