A resolution calculus for MinSAT

DOI10.1093/JIGPAL/JZZ028MaRDI QIDQ5018765zbMATH OpenOpenAlexWikidataFDO

Authors Chu-Min Li, Fan Xiao, Felip Manya

Publication date 22 December 2021

Published in Logic Journal of the IGPL (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/jigpal/jzz028

zbMATH Keywords

Boolean optimizationcalculuscompletenessMinSATresolutionsigned MinSAT

Mathematics Subject Classification ID

Logic in computer science (03B70) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Resolution for Max-SAT
• A Complete Calculus for Max-SAT
• A non-clausal tableau calculus for \textsc{MinSat}
• Clause tableaux for maximum and minimum satisfiability
• MaxSAT resolution for regular propositional logic

Cited in

(4)

• A primal-dual approximation algorithm for \textsc{minsat}
• A non-clausal tableau calculus for \textsc{MinSat}
• MaxSAT resolution for regular propositional logic
• New tableau characterizations for non-clausal regular MinSAT and MaxSAT problems

This page was built for publication: A resolution calculus for MinSAT

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