412 search results - page 1 / 83 » Completion for Multiple Reduction Orderings |
RTA
1995
Springer
13 years 11 months ago
1995
Springer
We present a completion procedure (called MKB) that works for multiple reduction orderings. Given equations and a set of reduction orderings, the procedure simulates a computation ...
LFCS
2007
Springer
14 years 1 months ago
2007
Springer
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in firstorder hypersequent calculi....
CADE
2001
Springer
14 years 7 months ago
2001
Springer
In this paper, we present a syntax-directed termination and reduction checker for higher-order logic programs. The reduction checker verifies parametric higher-order subterm orderi...
AHS
2006
IEEE
13 years 9 months ago
2006
IEEE
This paper presents a multi-objective algorithm for on-line adaptation of a multi-carrier code-division multiple access (MC-CDMA) receiver. A specially tailored Genetic Algorithm ...
FSTTCS
2001
Springer
13 years 11 months ago
2001
Springer
For any class C und closed under NC1 reductions, it is shown that all sets complete for C under first-order (equivalently, Dlogtimeuniform AC0 ) reductions are isomorphic under ...