New inference rules for Max-SAT

MaRDI QIDQ3624095zbMATH OpenFDO

Authors Chu-Min Li, Felip Manya, Jordi Planes

Publication date 28 April 2009

Full work available at URL https://arxiv.org/abs/1111.0040

zbMATH Keywords

SAT inference rulesSAT solvers

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Resolution for Max-SAT
• MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
• Minimaxsat: an efficient weighted Max-SAT solver
• A logical approach to efficient Max-SAT solving
• A Complete Calculus for Max-SAT

Cited in

(43)

• An iterative path-breaking approach with mutation and restart strategies for the MAX-SAT problem
• Optimizing with minimum satisfiability
• Incomplete inference for graph problems
• Understanding the power of Max-SAT resolution through up-resilience
• Using the method of conditional expectations to supply an improved starting point for CCLS
• A proof builder for Max-SAT
• A refined branching algorithm for the maximum satisfiability problem
• A novel algorithm for Max Sat calling MOCE to order
• DRMaxSAT with MaxHS: first contact
• Propositional proof systems based on maximum satisfiability
• Iterative and core-guided maxsat solving: a survey and assessment
• A logical approach to efficient Max-SAT solving
• Model-lite planning: case-based vs. model-based approaches
• Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
• Learning hierarchical task network domains from partially observed plan traces
• CHAMP: a multipass algorithm for Max Sat based on saver variables
• Go-MOCE: greedy order method of conditional expectations for Max Sat
• New local search methods for partial MaxSAT
• A Max-SAT Inference-Based Pre-processing for Max-Clique
• On Inconsistent Clause-Subsets for Max-SAT Solving
• Local Consistency in Weighted CSPs and Inference in Max-SAT
• Solving (Weighted) Partial MaxSAT through Satisfiability Testing
• Exploiting Cycle Structures in Max-SAT
• Algorithms for Weighted Boolean Optimization
• Boolean lexicographic optimization: algorithms \& applications
• Breaking cycle structure to improve lower bound for Max-SAT
• \textsc{ahmaxsat}: description and evaluation of a branch and bound Max-SAT solver
• On the performance of MaxSAT and MinSAT solvers on 2SAT-MaxOnes
• Boosting branch-and-bound MaxSAT solvers with clause learning
• About some UP-based polynomial fragments of SAT
• Resizing cardinality constraints for MaxSAT
• Exploiting subproblem optimization in SAT-based maxsat algorithms
• Iterated local search with Trellis-neighborhood for the partial Latin square extension problem
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT
• Proofs and Certificates for Max-SAT
• MaxSAT resolution for regular propositional logic
• Solving satisfiability problems with preferences
• Resolution-based lower bounds in MaxSAT
• A new upper bound for Max-2-SAT: A graph-theoretic approach
• Integrating multi-armed bandit with local search for MaxSAT
• Enhancing MaxSAT local search via a unified soft clause weighting scheme
• Solving weighted maximum satisfiability with branch and bound and clause learning
• A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem

This page was built for publication: New inference rules for Max-SAT

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