



/5 (minimum 1)
on 13 Nov 2007
This paper pushes the boundaries of adding role negation in DLs, e.g. earlier results on ALC (http://citeseer.ist.psu.edu/lutz00mary.html). It is the typical DL approach, add some feature to DLs which still stays decidable, show some tableau algorithm extension to compute it. Fair enough. On the one hand, such work is important to push the DL boundaries and maybe inspiring the nwe OWL WG in W3C (see http://www.w3.org/2007/OWL/), however, he missies some fetures which are planned in SROIQ, the likely basis for the next version of OWL. On the other hand, one couls say, yet another Delta extension to DLs, what does this contribute to make the Semantic Web real? - Admittedly the latter is a purely subjective and arguable comment. Seems to be clean and sound work at a glance.




/5 (minimum 1)
on 13 Nov 2007
This paper sugests an extension of SPARQL to add customized similraity functions. The system has implemented as an extension of ARQ. Actually, the work is more than only similarity functions, the syntax and notion of "virtual triples" the authors propose may be viewed as a generic extension mechanism for SPARQL by external function calls. I had some personal discussions with them about whether tis is inline with the declarative semantics of SPARQL, i.e. whether the idea can be de-coupled from the deep implementation details within ARQ (since virtual triples might require a special evaluation order of patterns depending on the necessary binding patterns of virtual triples). Nevertheless a very intesting approach!




/5 (minimum 1)
on 13 Nov 2007
The paper presents an infrastructure and preprocessor for latex to annotate Latex documents with "claims", by marking up the document depending on its sturcutre. Honestly, when hearing "semantic annotations for Latex" first, I had expected something different (maybe much more simplistic), like maybe picking certain Latex environments for auto-extracting metadata, where the paper rather suggests something like a bibtex-style "claim library and claim references". Nonetheless, this is very interesting work, and people might further evolve on the idea of easily adding and extrcting RDF metadata from Latex.




/5 (minimum 1)
on 13 Nov 2007
THis paper (nominee for best student paper award at ISWC2007) describes the YARS RDF store infrastructure which is based on a clever index structure for RDF storage that enables fast lookups and scalable distribution of huge ammounts of RDF data. It is the basis of the SWSE Semantic Web search engine. The fanfare announcement of YARS2 raised some controversy (see e.g. http://morenews.blogspot.com/2007/05/yars2.html), but it is with no doubt, one of the most competitive recent RDF store infrastructures.




/5 (minimum 1)
on 13 Nov 2007
Nice idea, synchronizing RDF graphs by MSG graphs.
MSG graphs are a way to canonically decompose RDF graphs in a bnode-agnostic way.