AllSAT for combinational circuits

DOI10.4230/LIPICS.SAT.2023.9MaRDI QIDQ6643082zbMATH OpenFDO

Authors Dror Fried, Alexander Nadel, Yogev Shalmon

Publication date 26 November 2024

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

zbMATH Keywords

AllSATcircuitsSAT

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)

Cited in

(4)

• Exploiting partial-assignment enumeration in optimization modulo theories
• Entailing generalization boosts enumeration
• Entailment vs. verification for partial-assignment satisfiability and enumeration
• On CNF conversion for SAT and SMT enumeration

This page was built for publication: AllSAT for combinational circuits

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