Sciweavers

58 search results - page 3 / 12
» Abstract DPLL and Abstract DPLL Modulo Theories
Sort
View
CADE
2011
Springer
12 years 7 months ago
Cutting to the Chase Solving Linear Integer Arithmetic
Abstract. We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut...
Dejan Jovanovic, Leonardo Mendonça de Moura
LPAR
2012
Springer
12 years 2 months ago
Lazy Abstraction with Interpolants for Arrays
traction with Interpolants for Arrays Francesco Alberti1 , Roberto Bruttomesso2 , Silvio Ghilardi2 , Silvio Ranise3 , Natasha Sharygina1 1 Universit`a della Svizzera Italiana, Luga...
Francesco Alberti, Roberto Bruttomesso, Silvio Ghi...
AUSAI
2004
Springer
14 years 15 days ago
Embedding Memoization to the Semantic Tree Search for Deciding QBFs
Abstract. Quantified Boolean formulas (QBFs) play an important role in artificial intelligence subjects, specially in planning, knowledge representation and reasoning [20]. In th...
Mohammad GhasemZadeh, Volker Klotz, Christoph Mein...
CL
2000
Springer
13 years 11 months ago
The Taming of the (X)OR
Abstract. Many key verification problems such as boundedmodel-checking,circuit verification and logical cryptanalysis are formalized with combined clausal and affine logic (i.e....
Peter Baumgartner, Fabio Massacci
IANDC
2010
141views more  IANDC 2010»
13 years 5 months ago
Regaining cut admissibility in deduction modulo using abstract completion
stract Completion Guillaume Burel a,c,∗ Claude Kirchner b,c aNancy-Universit´e, Universit´e Henri Poincar´e bINRIA Bordeaux - Sud-Ouest cLORIA, ´Equipe Pareo, Bˆatiment B, C...
Guillaume Burel, Claude Kirchner