Dynamic polynomial watchdog encoding for solving weighted MaxSAT

DOI10.1007/978-3-319-94144-8_3OpenAlexW2809690215MaRDI QIDQ1656559

Sven Reimer, Tobias Paxian, Bernd Becker

Publication date: 10 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94144-8_3

Mathematics Subject Classification ID

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

Related Items (5)

Go-MOCE: greedy order method of conditional expectations for Max Sat ⋮ On preprocessing for weighted MaxSAT ⋮ \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT ⋮ Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT ⋮ Clause redundancy and preprocessing in maximum satisfiability

This page was built for publication: Dynamic polynomial watchdog encoding for solving weighted MaxSAT