Skip to search formSkip to main contentSkip to account menu

Maximum satisfiability problem

Known as: MAXSAT, MAX-SAT, MAX-W-SAT 
In computational complexity theory, the maximum satisfiability problem (MAX-SAT) is the problem of determining the maximum number of clauses, of a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

19 relations
2-satisfiabilityAPXApproximation algorithmBoolean satisfiability problem

Broader (2)

Combinatorial optimizationLogic in computer science

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Volt: A Lazy Grounding Framework for Solving Very Large MaxSAT Instances
Very large MaxSAT instances, comprising \(10^{20}\) clauses and beyond, commonly arise in a variety of domains. We present VOLT… 
2012
2012
BACKBONE GUIDED EXTREMAL OPTIMIZATION FOR THE HARD MAXIMUM SATISFIABILITY PROBLEM
The original Extremal Optimization (EO) algorithm and its modified versions have been successfully applied to a variety of NP… 
2011
2011
Modified extremal optimization for the hard maximum satisfiability problem
Based on our recent study on probability distributions for evolution in extremal optimization (EO), we propose a modified… 
2011
2011
Simpler 3/4-Approximation Algorithms for MAX SAT
We consider the recent randomized 3/4-algorithm for MAX SAT of Poloczek and Schnitger. We give a much simpler set of… 
2005
2005
GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem
A GRASP with path-relinking for finding good-quality solutions of the weighted maximum satisfiability problem (MAX-SAT) is… 
1999
1999
Tight Bound on Johnson's Algorithm for Maximum Satisfiability
We present new techniques that give a more thorough analysis on Johnson's classical algorithm for the Maximum Satisfiability… 
1998
1998
K-sat on groups and undecidability
The general Boolean formula can be quickly converted into a normal form, A$, the conjunction of triple disjunctions of literals… 
Review
1996
Review
1996
A branch and cut algorithm for MAX-SAT and weighted MAX-SAT
DIMACS Series in Discrete Mathematicsand Theoretical Computer ScienceVolume00, 19xxA Branch and Cut Algorithm for MAX-SAT and… 
1982
1982
Algorithmic Extremal Problems in Combinatorial Optimization
1981
1981
1231 CORRELATES OF TIME OF UTILIZATION OF NEONATAL TRANSPORT & MORBIDITY OUTCOME
The hypothesis that in time of scarce resources (weekend, after midnight, etc.) ↑ utilization of the service would occur… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)