Max-SAT
E537213
Boolean optimization problem
computational problem
constraint optimization problem
optimization problem
Max-SAT is the optimization variant of the Boolean satisfiability problem in which the goal is to find an assignment that satisfies the maximum possible number of clauses, making it a central problem in approximation algorithms and complexity theory.
All labels observed (2)
How this entity was disambiguated
This entity first appeared as the object of triple T5642216 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Max-SAT Context triple: [Inapproximability results for SAT and other problems, relatedConcept, Max-SAT]
-
A.
TNTSAT
TNTSAT is a French free-to-air satellite television platform that broadcasts the national digital terrestrial TV channels via satellite.
-
B.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
-
C.
SCIP
SCIP is the ICAO airport code for Mataveri International Airport, the main air gateway to Easter Island in Chile.
-
D.
GSAT
GSAT is a series of Indian communications satellites operated by ISRO to provide services such as telecommunication, broadcasting, and broadband connectivity.
-
E.
“Inapproximability results for SAT and other problems”
“Inapproximability results for SAT and other problems” is a seminal theoretical computer science paper by Johan Håstad that establishes tight hardness-of-approximation bounds for satisfiability and related optimization problems using probabilistically checkable proofs.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Max-SAT Target entity description: Max-SAT is the optimization variant of the Boolean satisfiability problem in which the goal is to find an assignment that satisfies the maximum possible number of clauses, making it a central problem in approximation algorithms and complexity theory.
-
A.
TNTSAT
TNTSAT is a French free-to-air satellite television platform that broadcasts the national digital terrestrial TV channels via satellite.
-
B.
Satisfiability Modulo Theories (SMT)
Satisfiability Modulo Theories (SMT) is a framework in computer science and mathematical logic for deciding the satisfiability of logical formulas with respect to background theories such as arithmetic, bit-vectors, arrays, and data types, widely used in verification, synthesis, and automated reasoning.
-
C.
SCIP
SCIP is the ICAO airport code for Mataveri International Airport, the main air gateway to Easter Island in Chile.
-
D.
GSAT
GSAT is a series of Indian communications satellites operated by ISRO to provide services such as telecommunication, broadcasting, and broadband connectivity.
-
E.
“Inapproximability results for SAT and other problems”
“Inapproximability results for SAT and other problems” is a seminal theoretical computer science paper by Johan Håstad that establishes tight hardness-of-approximation bounds for satisfiability and related optimization problems using probabilistically checkable proofs.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
Boolean optimization problem
ⓘ
computational problem ⓘ constraint optimization problem ⓘ optimization problem ⓘ |
| alternativeGoal | minimize number of unsatisfied clauses ⓘ |
| approximability |
admits constant-factor approximation algorithms
ⓘ
admits polynomial-time approximation schemes for some restricted cases ⓘ |
| basedOn | Boolean satisfiability problem ⓘ |
| belongsTo |
computational complexity theory
NERFINISHED
ⓘ
theory of approximation algorithms ⓘ |
| decisionVersion | asks if there exists an assignment satisfying at least K clauses ⓘ |
| decisionVersionComplexity | NP-complete ⓘ |
| definedOver |
Boolean variables
ⓘ
clauses in conjunctive normal form ⓘ |
| generalizes | SAT ⓘ |
| goal | maximize number of satisfied clauses ⓘ |
| hasBenchmarkInstances | Max-SAT Evaluation competitions ⓘ |
| hasRandomizedApproximation | true ⓘ |
| hasVariant |
k-Max-SAT
NERFINISHED
ⓘ
partial Max-SAT ⓘ weighted Max-SAT ⓘ weighted partial Max-SAT ⓘ |
| input | CNF formula ⓘ |
| isCentralProblemIn |
approximation algorithms
ⓘ
automated reasoning ⓘ constraint programming ⓘ proof complexity ⓘ |
| isGeneralizationOf | maximum satisfiable subset problem ⓘ |
| isMaximizationProblem | true ⓘ |
| isNPComplete | false ⓘ |
| isNPHard | true ⓘ |
| output |
maximum number of satisfiable clauses
ⓘ
truth assignment to variables ⓘ |
| relatedProblem |
Max-CSP
ⓘ
Max-CUT ⓘ Min-SAT ⓘ |
| restrictionOf | Max-k-SAT when clause size is bounded by k ⓘ |
| solvedBy |
SAT-based Max-SAT solvers
ⓘ
branch-and-bound algorithms ⓘ integer linear programming formulations ⓘ local search algorithms ⓘ |
| usedIn |
bioinformatics
ⓘ
configuration problems ⓘ hardware verification ⓘ planning ⓘ preference reasoning ⓘ scheduling ⓘ software verification ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Max-SAT Description of subject: Max-SAT is the optimization variant of the Boolean satisfiability problem in which the goal is to find an assignment that satisfies the maximum possible number of clauses, making it a central problem in approximation algorithms and complexity theory.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject surface form:
Inapproximability results for SAT and other problems
subject surface form:
Z3
this entity surface form:
MaxSMT