A Complete Calculus for Max-SAT

DOI10.1007/11814948_24zbMath1124.68104OpenAlexW1951141208MaRDI QIDQ5756577

Maria Luisa Bonet, Jordi Levy, Felip Manyà

Publication date: 4 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11814948_24

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (9)

A logical approach to efficient Max-SAT solving ⋮ Resolution-based lower bounds in MaxSAT ⋮ Modelling Max-CSP as Partial Max-SAT ⋮ A Preprocessor for Max-SAT Solvers ⋮ Boosting branch-and-bound MaxSAT solvers with clause learning ⋮ Exploiting subproblem optimization in SAT-based maxsat algorithms ⋮ Resolution for Max-SAT ⋮ Proofs and Certificates for Max-SAT ⋮ A proof builder for Max-SAT

This page was built for publication: A Complete Calculus for Max-SAT