Exploiting the power of MIP solvers in MAXSAT

DOI10.1007/978-3-642-39071-5_13MaRDI QIDQ5326460zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(27)

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

Describes a project that uses

Uses Software

• Sat4j
• MiniMaxSat
• CPLEX

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)