A constraint-based approach to narrow search trees for satisfiability
Information Processing Letters
Probing-Based Preprocessing Techniques for Propositional Satisfiability
ICTAI '03 Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence
Toward Leaner Binary-Clause Reasoning in a Satisfiability Solver
Annals of Mathematics and Artificial Intelligence
Vivifying Propositional Clausal Formulae
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Fuzzing and delta-debugging SMT solvers
Proceedings of the 7th International Workshop on Satisfiability Modulo Theories
Clause elimination procedures for CNF formulas
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Efficient CNF simplification based on binary implication graphs
SAT'11 Proceedings of the 14th international conference on Theory and application 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
Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems
Journal of Artificial Intelligence Research
Verifying refutations with extended resolution
CADE'13 Proceedings of the 24th international conference on Automated Deduction
Soundness of inprocessing in clause sharing SAT solvers
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
SAT-Based analysis and quantification of information flow in programs
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
| Hi-index | 0.00 |
This paper presents the CNF simplifier Coprocessor 2.0, an extension of Coprocessor [1]. It implements almost all currently known simplification techniques in a modular way and provides access to each single technique to execute them independently. Disabling preprocessing for a set of variables is also possible and enables to apply simplifications also for incremental SAT solving. Experiments show that Coprocessor 2.0 performs better than its predecessor or SatElite[2].