123
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...
100
Voted
AISC
15 years 4 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...
128
Voted
AISC
15 years 4 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...
96
Voted
AISC
15 years 5 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...
AISC
15 years 5 months ago
2004 Springer
Term equations involving individual and sequence variables and sequence function symbols are studied. Function symbols can have either fixed or flexible arity. A sequence variabl...
|
Artificial Intelligence