- From: William Waites <wwaites@inf.ed.ac.uk>
- Date: Thu, 28 Mar 2019 15:55:31 +0000
- To: William Van Woensel <william.vanwoensel@gmail.com>
- Cc: 'Doerthe Arndt' <doerthe.arndt@ugent.be>, 'Gregg Kellogg' <gregg@greggkellogg.net>, public-n3-dev@w3.org
> Does anyone in this group use rules (not necessary N3) to map between > vocabularies? Thinking about it: I think I do it all the time but don't even > realised till it was mentioned in the workshop. Years ago I played with making a (restrited) parse tree of natural language utterances generate "tidy" representations of bibliographic data: https://blog.okfn.org/2010/08/09/cataloguing-bibliographic-data-with-natural-language-and-rdf/ More recently, I used some similar machinery to map between representations, not necessarily RDF: From a parse-tree of kappa-language rules (a non-RDF rule language expressing interaction of agents in a way suitable for molecular biology simulation) to RDF representation of the same, using N3 to fill in the blanks, in particular the bit at the end about generating a contact map: https://academic.oup.com/bioinformatics/article-abstract/32/6/908/1743798 From an RDF representation of a genetic circuit to a representation in a vocabulary designed to generate kappa-language rules via templates: https://pubs.acs.org/doi/abs/10.1021/acssynbio.8b00201 (this second one could perhaps have been done in exactly the inverse direction, generating an AST representation in RDF and then having a generic pretty-printer, and that might have been more elegant) Best wishes, -- William Waites | wwaites@inf.ed.ac.uk Laboratory for Foundations of Computer Science School of Informatics, University of Edinburgh
Received on Thursday, 28 March 2019 15:56:01 UTC