Sciweavers

4767 search results - page 52 / 954
» Structures for Abstract Rewriting
Sort
View
ANLP
2000
126views more  ANLP 2000»
13 years 10 months ago
The Automatic Translation of Discourse Structures
We empirically show that there are significant differences between the discourse structure of Japanese texts and the discourse structure of their corresponding English translation...
Daniel Marcu, Lynn Carlson, Maki Watanabe
CADE
2007
Springer
14 years 3 months ago
Proving Termination by Bounded Increase
Abstract. Most methods for termination analysis of term rewrite systems (TRSs) essentially try to find arguments of functions that decrease in recursive calls. However, they fail ...
Jürgen Giesl, René Thiemann, Stephan S...
RTA
2010
Springer
14 years 20 days ago
Modular Complexity Analysis via Relative Complexity
Abstract. In this paper we introduce a modular framework which allows to infer (feasible) upper bounds on the (derivational) complexity of term rewrite systems by combining differ...
Harald Zankl, Martin Korp
LICS
1991
IEEE
14 years 9 days ago
Higher-Order Critical Pairs
Abstract. We extend the termination proof methods based on reduction orderings to higher-order rewriting systems `a la Nipkow using higher-order pattern matching for firing rules,...
Tobias Nipkow
CORR
2006
Springer
112views Education» more  CORR 2006»
13 years 8 months ago
Satisfying KBO Constraints
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
Harald Zankl, Aart Middeldorp