1791 search results - page 190 / 359 » Semantics and Complexity of SPARQL |
152
Voted
IJCAI
1993
15 years 7 months ago
1993
Many problems can be expressed in terms of a numeric constraint satisfaction problem over finite or continuous domains (numeric CSP). The purpose of this paper is to show that the...
160
click to vote
GG
2008
Springer
15 years 7 months ago
2008
Springer
In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our p...
203
click to vote
APLAS
2010
ACM
15 years 6 months ago
2010
ACM
We consider the problem of specifying data structures with complex sharing in a manner that is both declarative and results in provably correct code. In our approach, abstract data...
193
click to vote
HRI
2010
ACM
15 years 6 months ago
2010
ACM
In this paper a system, which is driven through natural language, that allows operators to select and manipulate objects in the environment using an industrial robot is proposed. I...
159
click to vote
ENTCS
2010
15 years 6 months ago
2010
The cost of deploying a ubiquitous system to enhance a physical environment is likely to be considerable. The success of its deployment is highly dependent on its context: the phy...