Sciweavers

280 search results - page 4 / 56
» Termination Tools in Ordered Completion
Sort
View
BMCBI
2011
13 years 2 months ago
Taxon ordering in phylogenetic trees: a workbench test
Background: Phylogenetic trees are an important tool for representing evolutionary relationships among organisms. In a phylogram or chronogram, the ordering of taxa is not conside...
Francesco Cerutti, Luigi Bertolotti, Tony L. Goldb...
IPL
2006
109views more  IPL 2006»
13 years 7 months ago
Knuth-Bendix completion of theories of commuting group endomorphisms
Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...
Aaron Stump, Bernd Löchner
RTA
2011
Springer
12 years 10 months ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
ICIP
2000
IEEE
14 years 9 months ago
Complete Parametrization of Piecewise Polynomial Interpolators According to Degree, Support, Regularity, and Order
The most essential ingredient of interpolation is its basis function. We have shown in previous papers that this basis need not be necessarily interpolating to achieve good result...
Michael Unser, Philippe Thévenaz, Thierry B...
ENTCS
2008
97views more  ENTCS 2008»
13 years 7 months ago
Termination of Lazy Rewriting Revisited
Lazy rewriting is a proper restriction of term rewriting that dynamically restricts the reduction of certain arguments of functions in order to obtain termination. In contrast to ...
Felix Schernhammer, Bernhard Gramlich