Journal of the ACM (JACM)
Introduction to algorithms
Zero-suppressed BDDs for set manipulation in combinatorial problems
DAC '93 Proceedings of the 30th international Design Automation Conference
Combinational equivalence checking using satisfiability and recursive learning
DATE '99 Proceedings of the conference on Design, automation and test in Europe
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
The Propositional Formula Checker HeerHugo
Journal of Automated Reasoning
Using Walk-SAT and Rel-Sat for Cryptographic Key Search
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
SATO: An Efficient Propositional Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
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
ZRES: The Old Davis-Putman Procedure Meets ZBDD
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Conflict Analysis in Search Algorithms for Satisfiability
ICTAI '96 Proceedings of the 8th International Conference on Tools with Artificial Intelligence
Topics in the complexity of combinatorial algorithms.
Topics in the complexity of combinatorial algorithms.
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 simplifier for propositional formulas with many binary clauses
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Using CSP look-back techniques to solve real-world SAT instances
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
SAT graph-based representation: A new perspective
Journal of Algorithms
Efficiently exploiting dependencies in local search for SAT
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Generalizing Boolean satisfiability III: implementation
Journal of Artificial Intelligence Research
Boolean equi-propagation for optimized SAT encoding
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
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
Classifying and propagating parity constraints
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
Journal of Artificial Intelligence Research
Knowledge compilation for model counting: affine decision trees
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
We propose a simple data structure to represent all equivalent literals such as l1 ↔ l2 in a CNF formula F, and implement a special look-ahead technique, called equivalency reasoning, to propagate these equivalent literals in F in order to get other equivalent literals and to simplify F. Equivalent literal propagation remedies the ineffectiveness of unit propagation on equivalent literals and makes easy many SAT problems containing both usual CNF clauses and the so-called equivalency clauses (Ex-OR or modulo 2 arithmetics). Our approach is also compared with general CSP look-back techniques on these problems.