New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Redundancy in Random SAT Formulas
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Algebraic Simplification Techniques for Propositional Satisfiability
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Tuning SAT Checkers for Bounded Model Checking
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Evaluating Search Heuristics and Optimization Techniques in Propositional Satisfiability
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Integrating Equivalency Reasoning into Davis-Putnam Procedure
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Ten challenges in propositional reasoning and search
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
A backbone-search heuristic for efficient solving of hard 3-SAT formulae
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A simplifier for propositional formulas with many binary clauses
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Proceedings of the conference on Design, automation and test in Europe - Volume 1
Annals of Mathematics and Artificial Intelligence
Comparison of schemes for encoding unobservability in translation to SAT
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Discrete Applied Mathematics
Exploiting weak dependencies in tree-based search
Proceedings of the 2009 ACM symposium on Applied Computing
SAT-based versus CSP-based constraint weighting for satisfiability
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Efficiently exploiting dependencies in local search for SAT
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
Building structure into local search for SAT
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Extending Clause Learning DPLL with Parity Reasoning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Exploiting structure in an AIG based QBF solver
Proceedings of the Conference on Design, Automation and Test in Europe
Propelling SAT and SAT-based BMC using careset
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
Blocked clause elimination for QBF
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Automatic extraction of functional dependencies
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Aligning CNF- and equivalence-reasoning
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Fifty-five solvers in vancouver: the SAT 2004 competition
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Conflict-driven XOR-clause learning
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Learning polynomials over GF(2) in a SAT solver
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Recovering and utilizing partial duality in QBF
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
In this paper, a new pre-processing step is proposed in the resolution of SAT instances, that recovers and exploits structural knowledge that is hidden in the CNF. It delivers an hybrid formula made of clauses together with a set of equations of the form y = f(x1, ..., xn) where f is a standard connective operator among (驴, 驴, 驴) and where y and xi are boolean variables of the initial SAT instance. This set of equations is then exploited to eliminate clauses and variables, while preserving satisfiability. These extraction and simplification techniques allowed us to implement a new SAT solver that proves to be the most efficient current one w.r.t. several important classes of instances.