ESLIM: Circuit minimization with SAT based local improvement

DOI10.4230/LIPICS.SAT.2024.23MaRDI QIDQ6864418zbMATH OpenFDO

Authors Franz-Xaver Reichl, Friedrich Slivovsky, Stefan Szeider

Publication date 3 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.SAT.2024.23

zbMATH Keywords

circuit minimizationexact synthesisQBFSLIM

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of satisfiability (68R07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites work

• A SAT approach to branchwidth
• scientific article; zbMATH DE number 7561750 (Why is no real title available?)
• SAT-based circuit local improvement
• SAT-based local improvement for finding tree decompositions of small width
• SAT-boosted tabu search for coloring massive graphs
• Solving QBF with counterexample guided refinement
• The art of computer programming. Volume 4A. Combinatorial algorithms. Part 1.
• Tools and Algorithms for the Construction and Analysis of Systems
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints

This page was built for publication: ESLIM: Circuit minimization with SAT based local improvement

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6864418)