1791 search results - page 275 / 359 » Semantics and Complexity of SPARQL |
119
click to vote
LFCS
2007
Springer
15 years 10 months ago
2007
Springer
LP can be seen as a logic of knowledge with justifications. Artemov’s Realization Theorem says justifications can be extracted from validities in the more conventional Hintikk...
127
click to vote
OTM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Growing abundance of information on the Internet, especially the Next Generation Internet, poses even more challenges on more efficient information management; hence it h...
174
click to vote
CCECE
2006
IEEE
15 years 10 months ago
2006
IEEE
To help programmers of high-performance computing (HPC) systems avoid communication-related errors, we employ a formal process algebra, Communicating Sequential Processes (CSP), w...
103
click to vote
ICSEA
2006
IEEE
15 years 10 months ago
2006
IEEE
ey operate with computer abstractions not with AD ions they cannot fully bridge the semantic gap between IT and AD. Therefore, we can safely conclude that the research on computer ...
157
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
— This paper presents work-in-progress towards a C++ source-to-source translator that automatically seeks parallelisable code fragments and replaces them with code for a graphics...