Sciweavers

1791 search results - page 30 / 359
» Semantics and Complexity of SPARQL
Sort
View
JSS
2010
75views more  JSS 2010»
14 years 10 months ago
Measuring design complexity of semantic web ontologies
Hongyu Zhang, Yuan-Fang Li, Hee Beng Kuan Tan
SEMWEB
2009
Springer
15 years 4 months ago
DOGMA: A Disk-Oriented Graph Matching Algorithm for RDF Databases
RDF is an increasingly important paradigm for the representation of information on the Web. As RDF databases increase in size to approach tens of millions of triples, and as sophis...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...
LREC
2008
95views Education» more  LREC 2008»
15 years 1 months ago
In Contrast - A Complex Discourse Connective
This paper presents a corpus-based study of the discourse connective in contrast. The corpus data are drawn from the British National Corpus (BNC) and are analyzed at the levels o...
Erhard W. Hinrichs, Monica Lau
TCS
2011
14 years 6 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
OTM
2010
Springer
14 years 10 months ago
SMILE - A Framework for Semantic Applications
Abstract. Even though the semantic web become actual topic of research recently, there are no complex solutions for building semantic applications yet to our best knowledge. We des...
Jakub Galgonek, Tomas Knap, Martin Krulis, Martin ...