Introducing Intel SAT solver

DOI10.4230/LIPICS.SAT.2022.8MaRDI QIDQ6572019zbMATH OpenFDO

Authors Alexander Nadel

Publication date 12 July 2024

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

zbMATH Keywords

CDCLMaxSATSAT

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)

• Entailing generalization boosts enumeration
• Lazy reimplication in chronological backtracking
• Enhancing MaxSAT local search via a unified soft clause weighting scheme
• Satisfiability modulo user propagators

This page was built for publication: Introducing Intel\(\circledR\) SAT solver

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