1791 search results - page 38 / 359 » Semantics and Complexity of SPARQL |
118
click to vote
ESSLLI
2009
Springer
14 years 9 months ago
2009
Springer
The polynomial path order (POP for short) is a termination method that induces polynomial bounds on the innermost runtime complexity of term rewrite systems (TRSs for short). Seman...
APAL
2006
14 years 12 months ago
2006
This paper studies the complexity of behavior of multi-agent systems. Behavior properties are formulated using classical temporal logic languages and are checked with respect to t...
ICCAD
2004
IEEE
15 years 8 months ago
2004
IEEE
It is common wisdom that synthesizing hardware from higher-level descriptions than Verilog will incur a performance penalty. The case study here shows that this need not be the ca...
EURODAC
1995
IEEE
15 years 3 months ago
1995
IEEE
With VHDL models increasing their size, it becomes more important to assure the quality of these descriptions in order to improve simulation performances, to make project maintain...
117
click to vote
DMKD
2004
ACM
15 years 5 months ago
2004
ACM
To enable information integration, schema matching is a critical step for discovering semantic correspondences of attributes across heterogeneous sources. As a new attempt, this p...