Sciweavers

1791 search results - page 32 / 359
» Semantics and Complexity of SPARQL
Sort
View
CORR
2006
Springer
122views Education» more  CORR 2006»
14 years 12 months ago
On the complexity of XPath containment in the presence of disjunction, DTDs, and variables
XPath is a simple language for navigating an XML-tree and returning a set of answer nodes. The focus in this paper is on the complexity of the containment problem for various frag...
Frank Neven, Thomas Schwentick
DIAGRAMS
2006
Springer
15 years 3 months ago
Topological Relations of Arrow Symbols in Complex Diagrams
Illustrating a dynamic process with an arrow-containing diagram is a widespread convention in people's daily communications. In order to build a basis for capturing the struct...
Yohei Kurata, Max J. Egenhofer
INLG
2010
Springer
14 years 9 months ago
Using Semantic Web Technology to Support NLG. Case Study: OWL finds RAGS
The semantic web is a general vision for supporting knowledge-based processing across the WWW and its successors. As such, semantic web technology has potential to support the exc...
Chris Mellish
TCS
2008
14 years 11 months ago
On the decidability and complexity of the structural congruence for beta-binders
Beta-binders is a recent process calculus developed for modelling and simulating biological systems. As usual for process calculi, the semantic definition heavily relies on a stru...
Alessandro Romanel, Corrado Priami
KGC
1997
Springer
15 years 4 months ago
Looking for an Analogue of Rice's Theorem in Circuit Complexity Theory
Rice’s Theorem says that every nontrivial semantic property of programs is undecidable. In this spirit we show the following: Every nontrivial absolute (gap, relative) counting p...
Bernd Borchert, Frank Stephan