368 search results - page 5 / 74 » Arithmetic as a Theory Modulo |
CAV
2009
Springer
14 years 23 days ago
2009
Springer
We consider the decision problem for quantifier-free formulas whose atoms are linear inequalities interpreted over the reals or rationals. This problem may be decided using satisf...
JCP
2007
13 years 8 months ago
2007
— This work presents a mathematical framework for the development of efficient algorithms for cyclic convolution computations. The framework is based on the Chinese Reminder Theo...
CPC
2000
13 years 8 months ago
2000
A recently posed question of H
FROCOS
2009
Springer
14 years 3 months ago
2009
Springer
Deduction modulo consists in applying the inference rules of a deductive system modulo a rewrite system over terms and formulæ. This is equivalent to proving within a so-called co...
CAV
2012
Springer
11 years 11 months ago
2012
Springer
Abstract. A minimum satisfying assignment of a formula is a minimumcost partial assignment of values to the variables in the formula that guarantees the formula is true. Minimum sa...