1385 search results - page 110 / 277 » Natural Rewriting for General Term Rewriting Systems |
181
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. In this paper we present our formalization of two important termination techniques for term rewrite systems: the subterm criterion and the reduction pair processor in com...
171
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
143
click to vote
JACM
2007
15 years 6 months ago
2007
onal Numbers as an Abstract Data Type1 J A Bergstra2 University of Amsterdam, Informatics Institute, Kruislaan 403, 1098 SJ Amsterdam, The Netherlands J V Tucker3 Department of Com...
172
click to vote
MM
2005
ACM
15 years 12 months ago
2005
ACM
In this demonstration, we show a novel system, Video Booklet, which enables nature personal video browsing and searching. Firstly representative thumbnails of video segments are s...
168
click to vote
FOSSACS
2009
Springer
16 years 1 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...