Exploiting the Power of mip Solvers in maxsat

DOI10.1007/978-3-642-39071-5_13zbMath1390.68592OpenAlexW116541839MaRDI QIDQ5326460

Fahiem Bacchus, Jessica Davies

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

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

Related Items

Multi-language evaluation of exact solvers in graphical model discrete optimization, A constraint optimization approach to causal discovery from subsampled time series data, WPM3: an (in)complete algorithm for weighted partial MaxSAT, Boosting branch-and-bound MaxSAT solvers with clause learning, Computing generating sets of minimal size in finite algebras, Solving Graph Problems via Potential Maximal Cliques, Computational protein design as an optimization problem, Resizing cardinality constraints for MaxSAT, Propositional proof systems based on maximum satisfiability, Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability, Exploiting subproblem optimization in SAT-based maxsat algorithms, \(N\)-level modulo-based CNF encodings of pseudo-Boolean constraints for MaxSAT, Discovering causal graphs with cycles and latent confounders: an exact branch-and-bound approach, LMHS: A SAT-IP Hybrid MaxSAT Solver, Pakota: A System for Enforcement in Abstract Argumentation, Improved WPM encoding for coalition structure generation under MC-nets, Unnamed Item, ahmaxsat: Description and Evaluation of a Branch and Bound Max-SAT Solver, Clause redundancy and preprocessing in maximum satisfiability

Uses Software

• CPLEX
• Sat4j
• MiniMaxSat