Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
On a generalization of extended resolution
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Enhancing Davis Putnam with extended binary clause reasoning
Eighteenth national conference on Artificial intelligence
Toward Leaner Binary-Clause Reasoning in a Satisfiability Solver
Annals of Mathematics and Artificial Intelligence
Alembic: an efficient algorithm for CNF preprocessing
Proceedings of the 44th annual Design Automation Conference
An Incremental Algorithm to Check Satisfiability for Bounded Model Checking
Electronic Notes in Theoretical Computer Science (ENTCS)
NiVER: non-increasing variable elimination resolution for preprocessing SAT instances
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
Cost-effective hyper-resolution for preprocessing CNF formulas
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Reconstructing solutions after blocked clause elimination
SAT'10 Proceedings of the 13th 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
Efficient CNF simplification based on binary implication graphs
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Blocked clause elimination for QBF
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Projection and scope-determined circumscription
Journal of Symbolic Computation
Coprocessor 2.0: a flexible CNF simplifier
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Formula preprocessing in MUS extraction
TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Hi-index | 0.00 |
We develop and analyze clause elimination procedures, a specific family of simplification techniques for conjunctive normal form (CNF) formulas. Extending known procedures such as tautology, subsumption, and blocked clause elimination, we introduce novel elimination procedures based on hidden and asymmetric variants of these techniques. We analyze the resulting nine (including five new) clause elimination procedures from various perspectives: size reduction, BCP-preservance, confluence, and logical equivalence. For the variants not preserving logical equivalence, we show how to reconstruct solutions to original CNFs from satisfying assignments to simplified CNFs. We also identify a clause elimination procedure that does a transitive reduction of the binary implication graph underlying any CNF formula purely on the CNF level.