W3C home > Mailing lists > Public > public-sparql-dev@w3.org > April to June 2006

Implementations using "compositional semantics"

From: Olaf Hartig <OleBowle@gmx.de>
Date: Thu, 22 Jun 2006 11:15:09 +0200
To: public-sparql-dev@w3.org
Message-Id: <200606221115.18477.OleBowle@gmx.de>

In a recent paper about "Semantics and Complexity in 
SPARQL" (http://www.dcc.uchile.cl/~cgutierr/ftp/sparql-ext.pdf) Perez et.al. 
mention two approaches to compute solutions for graph patterns - one using a 
procedural semantics and another using a compositional semantics. As a real 
implementation for the first they name Jena's ARQ. I'm interested in an 
implementation following the second approach. Does someone, familiar with the 
paper, know of any?
GnuPG key: http://www.informatik.hu-berlin.de/~hartig/hartig.asc

Received on Thursday, 22 June 2006 16:16:26 UTC

This archive was generated by hypermail 2.3.1 : Tuesday, 6 January 2015 20:15:49 UTC