Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

EDA-Driven Preprocessing for SAT Solving (2403.19446v1)

Published 28 Mar 2024 in cs.LO

Abstract: Effective formulation of problems into Conjunctive Normal Form (CNF) is critical in modern Boolean Satisfiability (SAT) solving for optimizing solver performance. Addressing the limitations of existing methods, our Electronic Design Automation (EDA)-driven preprocessing framework introduces a novel methodology for preparing SAT instances, leveraging both circuit and CNF formats for enhanced flexibility and efficiency. Central to our approach is the integration of a new logic synthesis technique, guided by a reinforcement learning agent, and a novel cost-customized LUT mapping strategy, enabling efficient handling of diverse SAT challenges. By transforming the SAT competition benchmarks into circuit instances, our framework demonstrates substantial performance improvements, as evidenced by a 52.42% reduction on average compared to solving directly. Moreover, our framework achieves a remarkable 96.14% runtime reduction on average for a set of logic equivalence checking problems that exhibit inherent circuit structures. These results highlight the effectiveness and versatility of our approach in handling both CNF and circuit instances. The code is available at https://github.com/cure-lab/EDA4SAT.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (42)
  1. Predicting learnt clauses quality in modern sat solvers. In International joint conference on artificial intelligence, 2009.
  2. Sat competition 2022, 2022.
  3. Solving the round robin problem using propositional logic. In AAAI/IAAI, pages 262–266, 2000.
  4. Technology mapping for standard-cell generators. In ICCAD, pages 470–473, 1988.
  5. Armin Biere. Aiger (aiger is a format, library and set of utilities for and-inverter graphs (aigs)). https://fmv.jku.at/aiger/, 2006.
  6. Dag-aware circuit compression for formal verification. In IEEE/ACM International Conference on Computer Aided Design, 2004. ICCAD-2004., pages 42–49. IEEE, 2004.
  7. Abc: An academic industrial-strength verification tool. In Computer Aided Verification, pages 24–40. Springer, 2010.
  8. Robert K Brayton. The decomposition and factorization of boolean expressions. ISCA-82, pages 49–54, 1982.
  9. A gröbner basis approach to cnf-formulae preprocessing. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pages 618–631. Springer, 2007.
  10. Stephen A Cook. The complexity of theorem-proving procedures. In Proceedings of the 3rd ACM symposium on Theory of computing, pages 151–158, 1971.
  11. Jordi Cortadella. Timing-driven logic bi-decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 22(6):675–685, 2003.
  12. A scalable approach to exact resource-constrained scheduling based on a joint sdc and sat formulation. In Proceedings of 2018 FPGA, pages 137–146, 2018.
  13. The hard problems are almost everywhere for random cnf-xor formulas. In Proceedings of the 26th International Joint Conference on Artificial Intelligence, pages 600–606, 2017.
  14. Effective preprocessing in sat through variable and clause elimination. In International conference on theory and applications of satisfiability testing, pages 61–75. Springer, 2005.
  15. Applying logic synthesis for speeding up sat. In Theory and Applications of Satisfiability Testing, pages 272–286. Springer, 2007.
  16. Cadical, kissat, paracooba, plingeling and treengeling entering the sat competition 2020. SAT COMPETITION, 2020:50, 2020.
  17. Chortle: A technology mapping program for lookup table-based field programmable gate arrays. In Proceedings of the 27th ACM/IEEE Design Automation Conference, pages 613–619, 1991.
  18. Hard satisfiable clause sets for benchmarking equivalence reasoning techniques. Journal on Satisfiability, Boolean Modeling and Computation, 2(1-4):27–46, 2006.
  19. Drills: Deep reinforcement learning for logic synthesis. In ASP-DAC, pages 581–586. IEEE, 2020.
  20. Deepseq: Deep sequential circuit learning. arXiv preprint arXiv:2302.13608, 2023.
  21. Deepgate: Learning neural representations of logic gates. In Proceedings of the 59th ACM/IEEE Design Automation Conference, pages 667–672, 2022.
  22. On eda-driven learning for sat solving. In 2023 60th ACM/IEEE Design Automation Conference (DAC), pages 1–6. IEEE, 2023.
  23. Learning rate based branching heuristic for sat solvers. In Theory and Applications of Satisfiability Testing, pages 123–140. Springer, 2016.
  24. Fpga technology mapping: a study of optimality. In Proceedings of the 42nd annual Design Automation Conference, pages 427–432, 2005.
  25. Conflict-driven clause learning sat solvers. In Handbook of satisfiability, pages 133–182. IOS press, 2021.
  26. Dag-aware aig rewriting a fresh look at combinational logic synthesis. In Proceedings of the 43rd annual Design Automation Conference, pages 532–535, 2006.
  27. Improvements to combinational equivalence checking. In Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design, pages 836–843, 2006.
  28. Human-level control through deep reinforcement learning. nature, 518(7540):529–533, 2015.
  29. Chaff: Engineering an efficient sat solver. In Proceedings of the 38th annual Design Automation Conference, pages 530–535, 2001.
  30. Recovering and exploiting structural knowledge from cnf formulas. In Principles and Practice of Constraint Programming, pages 185–199. Springer, 2002.
  31. Harald Seltner. Extracting hardware circuits from cnf formulas. Master’s thesis, 2014.
  32. Deeptpi: Test point insertion with deep reinforcement learning. In 2022 IEEE International Test Conference (ITC), pages 194–203. IEEE, 2022.
  33. Satformer: Transformers for sat solving. In Proceedings of the 2023 IEEE/ACM international conference on Computer-aided design, 2023.
  34. Deepgate2: Functionality-aware circuit representation learning. In Proceedings of the 2023 IEEE/ACM international conference on Computer-aided design, 2023.
  35. The epfl logic synthesis libraries. arXiv preprint arXiv:1805.05121, 2018.
  36. Minisat v1. 13-a sat solver with conflict-clause minimization. SAT, 2005(53):1–2, 2005.
  37. Niver: Non-increasing variable elimination resolution for preprocessing sat instances. In Theory and Applications of Satisfiability Testing, pages 276–291. Springer, 2005.
  38. Solving non-clausal formulas with dpll search. In International Conference on Principles and Practice of Constraint Programming, pages 663–678. Springer, 2004.
  39. Effective use of boolean satisfiability procedures in the formal verification of superscalar and vliw. In Proceedings of the 38th annual design automation conference, pages 226–231, 2001.
  40. Yosys-a free verilog synthesis suite. In Proceedings of the 21st Austrian Workshop on Microelectronics (Austrochip), page 97, 2013.
  41. sub-sat: a formulation for relaxed boolean satisfiability with applications in routing. In Proceedings of the 2002 international symposium on Physical design, pages 182–187, 2002.
  42. Exploring logic optimizations with reinforcement learning and graph convolutional network. In ACM/IEEE Workshop on Machine Learning for CAD, pages 145–150, 2020.
User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (7)
  1. Zhengyuan Shi (18 papers)
  2. Tiebing Tang (1 paper)
  3. Sadaf Khan (11 papers)
  4. Hui-Ling Zhen (33 papers)
  5. Mingxuan Yuan (81 papers)
  6. Zhufei Chu (10 papers)
  7. Qiang Xu (129 papers)
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now