Core-boosted linear search for incomplete MaxSAT

DOI10.1007/978-3-030-19212-9_3MaRDI QIDQ2327238zbMATH OpenOpenAlexFDO

Authors Jeremias Berg, Emir Demirović, Peter J. Stuckey

Publication date 14 October 2019

Full work available at URL https://doi.org/10.1007/978-3-030-19212-9_3

zbMATH Keywords

MaxSATmaximum satisfiabilitylinear algorithmcore-guided MaxSATincomplete solvingSAT-based MaxSAT

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Recommendations

• Improvements to core-guided binary search for MaxSAT
• Generalizing Core-Guided Max-SAT
• Iterative and core-guided maxsat solving: a survey and assessment
• Cores in core based MaxSat algorithms: an analysis
• Abstract cores in implicit hitting set MaxSat solving
• New local search methods for partial MaxSAT
• MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
• MAX-closed semilinear constraint satisfaction
• A taxonomy of exact methods for partial Max-SAT

Cited in

(9)

• Clause redundancy and preprocessing in maximum satisfiability
• Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
• Using merging variables-based local search to solve special variants of MaxSAT problem
• Learning variable activity initialisation for lazy clause generation solvers
• SAT-based optimal classification trees for non-binary data
• An efficient local search algorithm for minimum positive influence dominating set problem
• Efficient local search for pseudo Boolean optimization
• On preprocessing for weighted MaxSAT
• Integrating multi-armed bandit with local search for MaxSAT

This page was built for publication: Core-boosted linear search for incomplete MaxSAT

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