Core-boosted linear search for incomplete MaxSAT
From MaRDI portal
Publication:2327238
DOI10.1007/978-3-030-19212-9_3OpenAlexW2945627032MaRDI QIDQ2327238
Jeremias Berg, Peter J. Stuckey, Emir Demirović
Publication date: 14 October 2019
Full work available at URL: https://doi.org/10.1007/978-3-030-19212-9_3
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (8)
SAT-based optimal classification trees for non-binary data ⋮ An efficient local search algorithm for minimum positive influence dominating set problem ⋮ On preprocessing for weighted MaxSAT ⋮ Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions ⋮ Using Merging Variables-Based Local Search to Solve Special Variants of MaxSAT Problem ⋮ Clause redundancy and preprocessing in maximum satisfiability ⋮ Learning variable activity initialisation for lazy clause generation solvers ⋮ Efficient local search for pseudo Boolean optimization
This page was built for publication: Core-boosted linear search for incomplete MaxSAT
