Approximate model counting
Abstract Model counting, or counting solutions of a set of constraints, is a fundamental
problem in Computer Science with diverse applications. Since exact counting is …
problem in Computer Science with diverse applications. Since exact counting is …
When Boolean satisfiability meets Gaussian elimination in a simplex way
CS Han, JHR Jiang - … : 24th International Conference, CAV 2012, Berkeley …, 2012 - Springer
Recent research on Boolean satisfiability (SAT) reveals modern solvers' inability to handle
formulae in the abundance of parity (xor) constraints. Although xor-handling in SAT solving …
formulae in the abundance of parity (xor) constraints. Although xor-handling in SAT solving …
Hard satisfiable clause sets for benchmarking equivalence reasoning techniques
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The
instances are constructed by transforming a random regular graph into a system of linear …
instances are constructed by transforming a random regular graph into a system of linear …
Variable dependency in local search: Prevention is better than cure
S Prestwich - International conference on theory and applications of …, 2007 - Springer
Local search achieves good results on a variety of SAT problems and often scales up better
than backtrack search. But despite recent advances in local search heuristics it has failed to …
than backtrack search. But despite recent advances in local search heuristics it has failed to …
[图书][B] Automating pseudo-boolean inference within a DPLL framework
H Dixon - 2004 - search.proquest.com
State of the art satisfiability solvers provide important tools for problem solving in a number
of real world problem domains [44, 10, 18, 60, 42]. These methods are all based on the …
of real world problem domains [44, 10, 18, 60, 42]. These methods are all based on the …
[HTML][HTML] How to fake an RSA signature by encoding modular root finding as a SAT problem
C Fiorini, E Martinelli, F Massacci - Discrete Applied Mathematics, 2003 - Elsevier
Logical cryptanalysis has been introduced by Massacci and Marraro as a general framework
for encoding properties of crypto-algorithms into SAT problems, with the aim of generating …
for encoding properties of crypto-algorithms into SAT problems, with the aim of generating …
Parallel resolution of the satisfiability problem: A survey
D Singer - Parallel combinatorial optimization, 2006 - Wiley Online Library
The propositional Satisfiability problem (SAT) is one of the most studied in computer science
since it was the first problem proven to be NP-complete by Cook in 1971. Nowadays, the …
since it was the first problem proven to be NP-complete by Cook in 1971. Nowadays, the …
On SAT representations of XOR constraints
M Gwynne, O Kullmann - … Conference on Language and Automata Theory …, 2014 - Springer
We consider the problem of finding good representations, via boolean conjunctive normal
forms F (clause-sets), of systems S of XOR-constraints x 1⊕…⊕ xn= ε, ε∈ 0, 1 (also called …
forms F (clause-sets), of systems S of XOR-constraints x 1⊕…⊕ xn= ε, ε∈ 0, 1 (also called …
Extending clause learning SAT solvers with complete parity reasoning
T Laitinen, T Junttila, I Niemelä - 2012 IEEE 24th International …, 2012 - ieeexplore.ieee.org
Instances of logical cryptanalysis, circuit verification, and bounded model checking can often
be succinctly represented as a combined satisfiability (SAT) problem where an instance is a …
be succinctly represented as a combined satisfiability (SAT) problem where an instance is a …
Conflict-driven XOR-clause learning
T Laitinen, T Junttila, I Niemelä - International Conference on Theory and …, 2012 - Springer
Modern conflict-driven clause learning (CDCL) SAT solvers are very good in solving
conjunctive normal form (CNF) formulas. However, some application problems involve lots …
conjunctive normal form (CNF) formulas. However, some application problems involve lots …