Zero-suppressed BDDs for set manipulation in combinatorial problems
DAC '93 Proceedings of the 30th international Design Automation Conference
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Logic Synthesis and Verification Algorithms
Logic Synthesis and Verification Algorithms
Towards a Symmetric Treatment of Satisfaction and Conflicts in Quantified Boolean Formula Evaluation
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
SAT-based unbounded symbolic model checking
Proceedings of the 40th annual Design Automation Conference
Multi-resolution on compressed sets of clauses
ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence
An improved incremental algorithm for generating prime implicates
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
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
Alembic: an efficient algorithm for CNF preprocessing
Proceedings of the 44th annual Design Automation Conference
Preprocessing for controlled query evaluation with availability policy
Journal of Computer Security - 20th Annual IFIP WG 11.3 Working Conference on Data and Applications Security (DBSec'06)
LCF-Style Propositional Simplification with BDDs and SAT Solvers
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Present and Future of Practical SAT Solving
Complexity of Constraints
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
c-sat: A Parallel SAT Solver for Clusters
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
GUNSAT: a greedy local search algorithm for unsatisfiability
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Boosting a complete technique to find MSS and MUS thanks to a local search oracle
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
The effect of restarts on the efficiency of clause learning
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Making deduction more effective in SAT solvers
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
On finding an inference-proof complete database for controlled query evaluation
DBSEC'06 Proceedings of the 20th IFIP WG 11.3 working conference on Data and Applications Security
sQueezeBF: an effective preprocessor for QBFs based on equivalence reasoning
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
An overview of parallel SAT solving
Constraints
Efficient synthesis of feature models
Proceedings of the 16th International Software Product Line Conference - Volume 1
| Hi-index | 0.00 |
CNF Boolean formulas generated from resolution or solution enumeration often have much redundancy. Efficient algorithms are needed to simplify and compact such CNF formulas. In this paper, we present a novel algorithm to maintain a subsumption-free CNF clause database by efficiently detecting and removing subsumption as the clauses are being added. We then present an algorithm that compact CNF formula further by applying resolutions to make it Decremental Resolution Free. Our experimental evaluations show that these algorithms are efficient and effective in practice.