79 search results - page 4 / 16 » Graph Rewriting in Computational Origami |
MEMBRANE
2004
Springer
13 years 11 months ago
2004
Springer
LMNtal (pronounced “elemental”) is a simple language model based on graph rewriting that uses logical variables to represent links and membranes to represent hierarchies. The ...
CONCUR
2006
Springer
13 years 9 months ago
2006
Springer
Several applications of graph rewriting systems (notably, some encodings of calculi with name passing) require rules which, besides deleting and generating graph items, are able to...
SIGMOD
2011
ACM
12 years 8 months ago
2011
ACM
In this paper we consider the problem of answering queries using views, which is important for data integration, query optimization, and data warehouses. We consider its simplest ...
CSR
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. We survey classical and selected recent work on the reachability problem over finitely presented infinite graphs. The problem has a history of 100 years, and it is centra...
PDP
1996
IEEE
13 years 10 months ago
1996
IEEE
