Cores in Core Based MaxSat Algorithms: An Analysis

DOI10.1007/978-3-319-09284-3_2zbMath1423.68432OpenAlexW2126182348MaRDI QIDQ3192051

Nina Narodytska, Fahiem Bacchus

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09284-3_2

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances ⋮ New local search methods for partial MaxSAT ⋮ An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem ⋮ Model enumeration in propositional circumscription via unsatisfiable core analysis ⋮ Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search ⋮ Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints ⋮ On Using Incremental Encodings in Unsatisfiability-based MaxSAT Solving ⋮ MiFuMax—a Literate MaxSAT Solver ⋮ ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver

This page was built for publication: Cores in Core Based MaxSat Algorithms: An Analysis