Equivalency reasoning to solve a class of hard SAT problems
Information Processing Letters
CL '00 Proceedings of the First International Conference on Computational Logic
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
Equivalent literal propagation in the DLL procedure
Discrete Applied Mathematics - The renesse issue on satisfiability
Extending SAT Solvers to Cryptographic Problems
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Extending Clause Learning DPLL with Parity Reasoning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Equivalence Class Based Parity Reasoning with DPLL(XOR)
ICTAI '11 Proceedings of the 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence
Aligning CNF- and equivalence-reasoning
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
March_eq: implementing additional reasoning into an efficient look-ahead SAT solver
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Conflict-driven XOR-clause learning
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Generalising Unit-Refutation Completeness and SLUR via Nested Input Resolution
Journal of Automated Reasoning
| Hi-index | 0.00 |
Parity constraints, common in application domains such as circuit verification, bounded model checking, and logical cryptanalysis, are not necessarily most efficiently solved if translated into conjunctive normal form. Thus, specialized parity reasoning techniques have been developed in the past for propagating parity constraints. This paper studies the questions of deciding whether unit propagation or equivalence reasoning is enough to achieve full propagation in a given parity constraint set. Efficient approximating tests for answering these questions are developed. It is also shown that equivalence reasoning can be simulated by unit propagation by adding a polynomial amount of redundant parity constraints to the problem. It is proven that without using additional variables, an exponential number of new parity constraints would be needed in the worst case. The presented classification and propagation methods are evaluated experimentally.