4074 search results - page 108 / 815 » Abstract Graph Transformation |
LOPSTR
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. It has often been observed that a point-free style of programvides a more abstract view on programs. We aim to use the gain in abstraction to obtain a denotational semant...
AAAI
2006
14 years 11 months ago
2006
The scalability of graph-search algorithms can be greatly extended by using external memory, such as disk, to store generated nodes. We consider structured duplicate detection, an...
153
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper describes Orchid, a system that converts declarative mapping specifications into data flow specifications s) and vice versa. Orchid provides an abstract operator model t...
93
Voted
SOFTVIS
2006
ACM
15 years 4 months ago
2006
ACM
Visual paradigms such as node-link diagrams are well suited to the representation of Semantic Web data encoded with the Resource Description Framework (RDF), whose data model can ...
GG
2004
Springer
15 years 3 months ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...