Sciweavers

2 search results - page 1 / 1
» A Simplex-Based Extension of Fourier-Motzkin for Solving Lin...
Sort
View
CADE
2012
Springer
12 years 1 months ago
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
Abstract. This paper describes a novel decision procedure for quantifierfree linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domai...
François Bobot, Sylvain Conchon, Evelyne Co...
SAT
2010
Springer
174views Hardware» more  SAT 2010»
13 years 9 months ago
A System for Solving Constraint Satisfaction Problems with SMT
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
Miquel Bofill, Josep Suy, Mateu Villaret