Sciweavers

368 search results - page 5 / 74
» Arithmetic as a Theory Modulo
Sort
View
CAV
2009
Springer
123views Hardware» more  CAV 2009»
15 years 3 months ago
On Using Floating-Point Computations to Help an Exact Linear Arithmetic Decision Procedure
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...
David Monniaux
JCP
2007
104views more  JCP 2007»
14 years 11 months ago
Cyclic Convolution Algorithm Formulations Using Polynomial Transform Theory
— 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...
Abraham H. Diaz-Perez, Domingo Rodríguez
77
Voted
CPC
2000
82views more  CPC 2000»
14 years 11 months ago
On Arithmetic Progressions Of Cycle Lengths In Graphs
A recently posed question of H
Jacques Verstraëte
FROCOS
2009
Springer
15 years 6 months ago
Automating Theories in Intuitionistic Logic
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...
Guillaume Burel
CAV
2012
Springer
227views Hardware» more  CAV 2012»
13 years 2 months ago
Minimum Satisfying Assignments for SMT
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...
Isil Dillig, Thomas Dillig, Kenneth L. McMillan, A...