Sciweavers

GG
2008
Springer
14 years 1 months ago
Parallel and Sequential Independence for Borrowed Contexts
Parallel and sequential independence are central concepts in the concurrency theory of the double pushout (dpo) approach to graph rewriting. However, so far those same notions were...
Filippo Bonchi, Fabio Gadducci, Tobias Heindel
ACL
2004
14 years 1 months ago
Enriching the Output of a Parser Using Memory-based Learning
We describe a method for enriching the output of a parser with information available in a corpus. The method is based on graph rewriting using memorybased learning, applied to dep...
Valentin Jijkoun, Maarten de Rijke
FORTE
2010
14 years 1 months ago
Exploiting the Hierarchical Structure of Rule-Based Specifications for Decision Planning
Abstract. Rule-based specifications have been very successful as a declarative approach in many domains, due to the handy yet solid foundations offered by rule-based machineries li...
Artur Boronat, Roberto Bruni, Alberto Lluch-Lafuen...
AISC
2008
Springer
14 years 2 months ago
Extending Graphical Representations for Compact Closed Categories with Applications to Symbolic Quantum Computation
Graph-based formalisms of quantum computation provide an abstract and symbolic way to represent and simulate computations. However, manual manipulation of such graphs is slow and e...
Lucas Dixon, Ross Duncan
RTA
2010
Springer
14 years 4 months ago
Closing the Gap Between Runtime Complexity and Polytime Computability
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
Martin Avanzini, Georg Moser
TAGT
1994
Springer
154views Graph Theory» more  TAGT 1994»
14 years 4 months ago
Issues in the Practical Use of Graph Rewriting
Graphs are a popular data structure, and graph-manipulation programs are common. Graph manipulations can be cleanly, compactly, and explicitly described using graph-rewriting notat...
Dorothea Blostein, Hoda Fahmy, Ann Grbavec
EUROMICRO
1996
IEEE
14 years 4 months ago
A Graph Rewriting Approach for Transformational Design of Digital Systems
Transformational design integrates design and verification. It combines "correctness by construciion" and design creativity by the use ofpre-proven behaviour preserving ...
Corrie Huijs
WADT
1998
Springer
14 years 4 months ago
Parallel Admissible Graph Rewriting
We investigate the rewrite relation over graphs induced by constructor-based weakly orthogonal graph rewriting systems. It is well known that this relation is not confluent in gene...
Rachid Echahed, Jean-Christophe Janodet
MEMBRANE
2004
Springer
14 years 5 months ago
LMNtal: A Language Model with Links and Membranes
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 ...
Kazunori Ueda, Norio Kato
FOSSACS
2004
Springer
14 years 5 months ago
Deriving Bisimulation Congruences in the DPO Approach to Graph Rewriting
Abstract. Motivated by recent work on the derivation of labelled transitions and bisimulation congruences from unlabelled reaction rules, we show how to solve this problem in the D...
Hartmut Ehrig, Barbara König