Alex Poole

Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract)

Maximum satisfiability (MaxSat) solving is an active area of research motivated by numerous successful applications to solving NP-hard combinatorial optimization problems. One of the most successful approaches for solving MaxSat instances from real world domains are the so called implicit hitt…