209 search results - page 35 / 42 » Termination of Priority Rewriting |
130
click to vote
CADE
2005
Springer
15 years 12 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
105
click to vote
BIRTHDAY
2007
Springer
15 years 5 months ago
2007
Springer
Showing termination of the Battle of Hercules and Hydra is a challenge. We present the battle both as a rewrite system and as an arithmetic while program, provide proofs of their t...
ISSAC
2007
Springer
15 years 5 months ago
2007
Springer
The parallelization of two applications in symmetric cryptography is considered: block ciphering and a new method based on random sampling for the selection of basic substitution ...
100
click to vote
CORR
2006
Springer
14 years 11 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...
111
click to vote
ENTCS
2008
14 years 11 months ago
2008
Orc is a language for orchestration of web services developed by J. Misra that offers simple, yet powerful and elegant, constructs to program sophisticated web orchestration appli...