- From: Peter F. Patel-Schneider <pfpschneider@gmail.com>
- Date: Fri, 20 Mar 2015 09:05:50 -0700
- To: Iovka Boneva <iovka.boneva@univ-lille1.fr>
- CC: RDF Data Shapes Working Group <public-data-shapes-wg@w3.org>
-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 On 03/20/2015 08:42 AM, Iovka Boneva wrote: > We do have 3 implementations of recursive shapes with bag semantics, for > 2 different algorithms - one for validating against deterministic schemas > w/o repetitions, with a set of pre-typed root nodes. It is written in > Java using jena, and works both with in-memory RDF-graphs, and using the > Jena RDF-database API. Written by myself; So this implementation is only for part of Shape Expressions? > - one for the same algorithm written in Python also using RDF API, > written by Slawek Staworko and Samuel Hym; And this implementation is also only for part of Shape Expressions? > - one for validation of a whole graph w/o pre-typed root nodes, using > our greatest fixed point algorithm. Also written in Python by Slawek and > Samuel. Does this implementation handle all of Shape Expressions? Is there an on-line demo? How can I get a copy of the system? > Our implementations were written for "proof of concept" prior to our > publication. We also have an algorithms for generating large graphs on > which we tested our implementations, and they indeed ran in linear time > in the size of the graph, as they were supposed to from theoretical point > of view. > > Iovka peter -----BEGIN PGP SIGNATURE----- Version: GnuPG v1 iQEcBAEBAgAGBQJVDEVeAAoJECjN6+QThfjzS04H/3fibb1SUdlucX2MkTQ4iBFi kLMNHhJbYyLBWBMiVWAumRBynisyvRnLvUEe++ivqlajg+JzNQ+QZCjh5DgxxV1z GBA0vxdVYUcu81+Q91gn/OHtLgpcdS0kUX5yRkRpNBd9sYdcL7Qgp6jlWGaYULJU PWhjqGpDT9/XKCylRdetOWj8l24QQW5YGX9qYFacYwSxORl4WsDfeS54EhgzFDdM ik+BVeGy8rDXwT6l5HhApMcCbXPCiXlJ58FWbg5GzS+IjH34IoBHRFNp03vlNTcY tvrCHjhABHO6aKNR0VKhIz4n5Zft5i5kBUTxXTy+wtShBjfukknikzsTibbWuMY= =PUvz -----END PGP SIGNATURE-----
Received on Friday, 20 March 2015 16:06:20 UTC