281 search results - page 32 / 57 » Querying the Guarded Fragment |
101
click to vote
SEMWEB
2009
Springer
15 years 4 months ago
2009
Springer
In this paper a novel approach is presented for generating RDF graphs of arbitrary complexity from various spreadsheet layouts. Currently, none of the available spreadsheet-to-RDF ...
DOCENG
2009
ACM
15 years 4 months ago
2009
ACM
We study the analysis problem of XPath expressions with counting constraints. Such expressions are commonly used in document transformations or programs in which they select porti...
173
Voted
ICDE
2002
IEEE
15 years 11 months ago
2002
IEEE
Difference, intersection, semi-join and anti-semi-join may be considered binary subset operators, in that they all return a subset of their left-hand argument. These operators are...
91
Voted
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
SEMWEB
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. This paper presents a decidable fragment for combining ontologies and rules in order-sorted logic programming. We describe ordersorted logic programming with sort, predic...