125
click to vote
AISC
15 years 3 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...
120
click to vote
AISC
15 years 5 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...
119
click to vote
AISC
15 years 5 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...
AISC
15 years 3 months ago
2004 Springer 
While implementing a proof for the Basic Perturbation Lemma (a central result in Homological Algebra) in the theorem prover Isabelle one faces problems such as the implementation o...
AISC
15 years 3 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...
|
Artificial Intelligence