We propose an algorithm for the trausfer of packed linguistic structures, that is, finite collections of labelled graphs which share certain subparts. A labelled graph is seen as ...
This work is part of the Fujaba project. The Fujaba project aims to use the Unified Modeling Language UML as a programmed graph rewriting language. This paper describes the new gr...
Abstract. We show how polynomial path orders can be employed efficiently in conjunction with weak innermost dependency pairs to automatically certify the polynomial runtime comple...
Narrative structure models are useful tools for understanding how and why narratives of any medium affect an audience's level of participation in their role of story reconstr...
Program transformation through the repeated application of simple rewrite rules is conducive to formal verification. In practice, program transformation oftentimes requires data t...