Learning shorter redundant clauses in SDCL using MaxSAT

DOI10.4230/LIPICS.SAT.2023.18MaRDI QIDQ6643095zbMATH OpenFDO

Authors Albert Oliveras, Chun-Xiao Li, Darryl Wu, Jonathan Chung, Vijay Ganesh

Publication date 26 November 2024

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

zbMATH Keywords

MaxSATSATSDCL

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

(2)

• Improving and understanding the power of satisfaction-driven clause learning
• Extended resolution clause learning via dual implication points

This page was built for publication: Learning shorter redundant clauses in SDCL using MaxSAT

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