SAT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. This paper shows that idempotents in finite rings of integers can act as Generalized Boolean Assignments (GBA’s) by providing a completeness theorem. We introduce the ...
SAT
2007
Springer
13 years 11 months ago
2007
Springer
In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as ...
SAT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. A promising approach for model counting was recently introduced, which in theory requires the use of large random xor or parity constraints to obtain near-exact counts of...
SAT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Polynomial interpretations are one of the most popular techniques for automated termination analysis and the search for such interpretations is a main bottleneck in most ...
SAT
2007
Springer
13 years 11 months ago
2007
Springer
SAT
2007
Springer
13 years 11 months ago
2007
Springer
SAT
2007
Springer
13 years 11 months ago
2007
Springer
In this paper a new circuit sat based encoding of boolean formula is proposed. It makes an original use of the concept of restrictive models introduced by Boufkhad to polynomially ...
SAT
2007
Springer
13 years 11 months ago
2007
Springer
We first define a mapping from CSP to many-valued SAT which allows to solve CSP instances with many-valued SAT solvers. Second, we define a new many-valued resolution rule and p...
SAT
2007
Springer
13 years 11 months ago
2007
Springer
Unmanned aerial vehicles (UAVs) represent an important class of networked robotic applications that must be both highly dependable and autonomous. This paper addresses sensor deplo...
SAT
2007
Springer
13 years 11 months ago
2007
Springer
We present an algorithm for finding a smallest Resolution refutation of any 2CNF in polynomial time.