778 search results - page 100 / 156 » Expressiveness and complexity of graph logic |
MMNS
2004
15 years 1 months ago
2004
Due to the significant development of network services in the past few years, their validation has become increasingly difficult. The advent of novel approaches to the issue of val...
101
Voted
RE
2008
Springer
14 years 12 months ago
2008
Springer
NASA spends millions designing and building spacecraft for its missions. The dependence on software is growing as spacecraft become more complex. With the increasing dependence on...
129
Voted
RR
2010
Springer
14 years 10 months ago
2010
Springer
The Accountability In RDF (AIR) language is an N3-based, Semantic Web production rule language that supports nested activation of rules, negation, closed world reasoning, scoped co...
104
click to vote
PLDI
2004
ACM
15 years 5 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
68
Voted
ICCD
2000
IEEE
15 years 9 months ago
2000
IEEE
In this paper, we present a fast and eficient compilation methodology for pipeline reconfigurable architectures. Our compiler back-end is much faster than conventional CAD tools, ...