Exploiting the power of MIP solvers in MAXSAT

DOI10.1007/978-3-642-39071-5_13zbMATH Open1390.68592OpenAlexW116541839MaRDI QIDQ5326460FDOQ5326460

Authors: Jessica Davies, Fahiem Bacchus 

Publication date: 5 August 2013

Published in: Theory and Applications of Satisfiability Testing – SAT 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39071-5_13

Recommendations

• Minimaxsat: an efficient weighted Max-SAT solver
• Exploiting subproblem optimization in SAT-based maxsat algorithms
• LMHS: a SAT-IP hybrid MaxSat solver
• MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
• Solving Max-SAT as weighted CSP

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mixed integer programming (90C11)

Cited In (22)

• Clause redundancy and preprocessing in maximum satisfiability
• Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach
• \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT
• Propositional proof systems based on maximum satisfiability
• Pakota: a system for enforcement in abstract argumentation
• Resizing cardinality constraints for MaxSAT
• Computing generating sets of minimal size in finite algebras
• Solving graph problems via potential maximal cliques: an experimental evaluation of the Bouchitté-Todinca algorithm
• Improved WPM encoding for coalition structure generation under MC-nets
• MaxSAT-based cutting planes for learning graphical models
• Efficiently explaining CSPs with unsatisfiable subset optimization
• A constraint optimization approach to causal discovery from subsampled time series data
• Boosting branch-and-bound MaxSAT solvers with clause learning
• LMHS: a SAT-IP hybrid MaxSat solver
• Certified Core-Guided MaxSAT Solving
• Multi-language evaluation of exact solvers in graphical model discrete optimization
• \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
• Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability
• Computational protein design as an optimization problem
• Hinge-loss Markov random fields and probabilistic soft logic
• WPM3: an (in)complete algorithm for weighted partial MaxSAT
• Exploiting subproblem optimization in SAT-based maxsat algorithms

Uses Software

• CPLEX
• Sat4j
• MiniMaxSat

This page was built for publication: Exploiting the power of MIP solvers in MAXSAT

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