Sciweavers

SAT
2010
Springer
194views Hardware» more  SAT 2010»
13 years 9 months ago
Integrating Dependency Schemes in Search-Based QBF Solvers
Florian Lonsing, Armin Biere
SAT
2010
Springer
178views Hardware» more  SAT 2010»
13 years 9 months ago
Proof Complexity of Propositional Default Logic
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...
Olaf Beyersdorff, Arne Meier, Sebastian Mülle...
SAT
2010
Springer
174views Hardware» more  SAT 2010»
13 years 3 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
SAT
2010
Springer
172views Hardware» more  SAT 2010»
13 years 3 months ago
On the Relative Merits of Simple Local Search Methods for the MAX-SAT Problem
Algorithms based on local search are popular for solving many optimization problems including the maximum satisfiability problem (MAXSAT). With regard to MAXSAT, the state of the ...
Denis Pankratov, Allan Borodin
SAT
2010
Springer
170views Hardware» more  SAT 2010»
13 years 9 months ago
Assignment Stack Shrinking
Assignment stack shrinking is a technique that is intended to speed up the performance of modern complete SAT solvers. Shrinking was shown to be efficient in SAT’04 competition w...
Alexander Nadel, Vadim Ryvchin
Hardware
Top of PageReset Settings