Results 21 to 30 of about 2,334 (179)
The CDCL algorithm is the leading solution adopted by state-of-the-art solvers for SAT, SMT, ASP, and others. Experiments show that the performance of CDCL solvers can be significantly boosted by embedding domain-specific heuristics, especially on large real-world problems.
Carmine Dodaro +5 more
openaire +2 more sources
CDCL(Crypto) SAT Solvers for Cryptanalysis
Over the last two decades, we have seen a dramatic improvement in the efficiency of conflict-driven clause-learning Boolean satisfiability (CDCL SAT) solvers on industrial problems from a variety of domains. The availability of such powerful general-purpose search tools as SAT solvers has led many researchers to propose SAT-based methods for ...
Saeed Nejati, Vijay Ganesh 0001
openaire +3 more sources
Boosting Local Search Thanks to cdcl [PDF]
In this paper, a novel hybrid and complete approach for propositional satisfiability, called SAT HYS (Sat Hybrid Solver), is introduced. It efficiently combines the strength of both local search and CDCL based SAT solvers. Considering the consistent partial assignment under construction by the CDCL SAT solver, local search is used to extend it to a ...
Audemard, Gilles +3 more
openaire +2 more sources
Background: As isolated ruptures of the caudal cruciate ligament (CdCL) are rare in dogs, there is no consensus on the indications and the gold-standard surgical technique for treatment.
Francois Fauqueux +6 more
doaj +1 more source
Evaluating CDCL Restart Schemes
Modern CDCL (conflict-driven clause learning) SAT solvers are used for many practical applications. One of the key ingredients of state-of-the-art CDCL solvers are efficient restart schemes. The main contribution of this work is an extensive empirical evaluation of various restart strategies.
Armin Biere, Andreas Fröhlich
openaire +2 more sources
Taif rose (Rosa damascena Mill) is one of the most important economic products of the Taif Governorate, Saudi Arabia. Cadmium chloride (CdCl2) is a common environmental pollutant that is widely used in industries and essentially induces many toxicities ...
Reham Z. Hamza +5 more
doaj +1 more source
Clause vivification by unit propagation in CDCL SAT solvers [PDF]
Original and learnt clauses in Conflict-Driven Clause Learning (CDCL) SAT solvers often contain redundant literals. This may have a negative impact on performance because redundant literals may deteriorate both the effectiveness of Boolean constraint propagation and the quality of subsequent learnt clauses.
Chu-Min Li 0001 +5 more
openaire +4 more sources
Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution [PDF]
QBF solvers implementing the QCDCL paradigm are powerful algorithms that successfully tackle many computationally complex applications. However, our theoretical understanding of the strength and limitations of these QCDCL solvers is very limited.
Olaf Beyersdorff, Benjamin Böhm
doaj +1 more source
Limits of CDCL Learning via Merge Resolution
In their seminal work, Atserias et al. and independently Pipatsrisawat and Darwiche in 2009 showed that CDCL solvers can simulate resolution proofs with polynomial overhead. However, previous work does not address the tightness of the simulation, i.e., the question of how large this overhead needs to be.
Marc Vinyals +4 more
openaire +5 more sources
On CDCL-Based Proof Systems with the Ordered Decision Strategy [PDF]
We prove that conflict-driven clause learning SAT-solvers with the ordered decision strategy and the DECISION learning scheme are equivalent to ordered resolution. We also prove that, by replacing this learning scheme with its opposite that stops after the first new clause when backtracking, they become equivalent to general resolution.
Nathan Mull +2 more
openaire +3 more sources

