Clause size reduction with all-UIP learning
From MaRDI portal
Publication:2661332
DOI10.1007/978-3-030-51825-7_3OpenAlexW3040594194MaRDI QIDQ2661332
Publication date: 7 April 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-51825-7_3
Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational aspects of satisfiability (68R07)
Related Items (2)
Boosting branch-and-bound MaxSAT solvers with clause learning ⋮ Efficient all-UIP learned clause minimization
This page was built for publication: Clause size reduction with all-UIP learning