Abstract cores in implicit hitting set MaxSat solving

DOI10.1007/978-3-030-51825-7_20OpenAlexW3035531262MaRDI QIDQ2661355

Alex Poole, Jeremias Berg, Fahiem Bacchus

Publication date: 7 April 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-51825-7_20

zbMATH Keywords

combinatorial optimizationmaximum satisfiabilityMaxSatimplicit hitting setIHS

Mathematics Subject Classification ID

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 (1)

Computing optimal hypertree decompositions with SAT

Uses Software

• MiniSat
• Sat4j
• QMaxSAT
• Open-WBO
• LMHS
• RC2

This page was built for publication: Abstract cores in implicit hitting set MaxSat solving