188
click to vote
AISC
15 years 9 months ago
2004 Springer 
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. We show how polynomial interpretations with negative coefficients, like x - 1 for...
185
click to vote
AISC
15 years 11 months ago
2004 Springer 
Nonlinear constraint systems can be solved by combining consistency techniques and search. In this approach, the search space is reduced using local reasoning on constraints. Howev...
184
click to vote
AISC
15 years 11 months ago
2004 Springer 
ion Within Partial Deduction for Linear Logic . . . . . . . . . . . . . . . . . 52 P. K¨ungas A Decision Procedure for Equality Logic with Uninterpreted Functions . . . 66 O. Tver...
164
click to vote
AISC
15 years 9 months ago
2004 Springer 
We present a new method for generic quantifier elimination that uses an extension of Hermitian quantifier elimination. By means of sample computations we show that this generic Her...
162
click to vote
AISC
15 years 11 months ago
2004 Springer 
The equality logic with uninterpreted functions (EUF) has been proposed for processor verification. A procedure for proving satisfiability of formulas in this logic is introduced...
|
Artificial Intelligence