Sciweavers

4767 search results - page 20 / 954
» Structures for Abstract Rewriting
Sort
View
COLING
2000
13 years 8 months ago
Context-Free Grammar Rewriting and the Transfer of Packed Linguistic Representations
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 ...
Marc Dymetman, Frédéric Tendeau
ENTCS
2002
141views more  ENTCS 2002»
13 years 7 months ago
Graph Based Debugging with Fujaba
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...
Leif Geiger, Albert Zündorf
RTA
2009
Springer
14 years 2 months ago
Dependency Pairs and Polynomial Path Orders
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...
Martin Avanzini, Georg Moser
MM
1996
ACM
168views Multimedia» more  MM 1996»
13 years 11 months ago
Do Story Agents Use Rocking Chairs? The Theory and Implementation of One Model for Computational Narrative
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...
Kevin M. Brooks
IASTEDSEA
2004
13 years 9 months ago
Higher-order strategic programming: A road to software assurance
Program transformation through the repeated application of simple rewrite rules is conducive to formal verification. In practice, program transformation oftentimes requires data t...
Victor L. Winter, Steve Roach, Fares Fraij