Multi-objective maximum satisfiability by single-objective implicit hitting set optimization

DOI10.1007/978-3-032-27242-3_16MaRDI QIDQ7356169zbMATH OpenFDO

Authors Christoph Jabs, Jeremias Berg, Matti Järvisalo

Publication date 23 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-27242-3_16

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Multi-objective and goal programming (90C29)

Cites work

• 2006 and 2007 Max-SAT evaluations: contributed instances
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• Dynamic polynomial watchdog encoding for solving weighted MaxSAT
• Engineering and evaluating multi-objective pseudo-Boolean optimizers
• Exploiting the power of MIP solvers in MAXSAT
• Handbook of constraint programming.
• Handbook of satisfiability. In 2 parts
• LMHS: a SAT-IP hybrid MaxSat solver
• Multicriteria Optimization
• New core-guided and hitting set algorithms for multi-objective combinatorial optimization
• On improving MUS extraction algorithms
• PackUp: tools for package upgradability solving
• QMaxSAT: A partial Max-SAT solver
• Solving weighted maximum satisfiability with branch and bound and clause learning
• Temporal induction by incremental SAT solving

This page was built for publication: Multi-objective maximum satisfiability by single-objective implicit hitting set optimization

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