133
Voted
SAT
15 years 7 months ago
2010 Springer 116
Voted
SAT
15 years 7 months ago
2010 Springer
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...
133
Voted
SAT
15 years 2 months ago
2010 Springer
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...
161
Voted
SAT
15 years 2 months ago
2010 Springer
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 ...
105
Voted
SAT
15 years 7 months ago
2010 Springer
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...
|