Max-CSP
E1501283
UNEXPLORED
Max-CSP is a general optimization framework in theoretical computer science where the goal is to assign values to variables to satisfy as many given constraints as possible.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Max-CSP canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T21763291 — 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-CSP Context triple: [Max-3-SAT, isSpecialCaseOf, Max-CSP]
-
A.
Max-SAT
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.
-
B.
Max-3-SAT
Max-3-SAT is an optimization variant of the Boolean satisfiability problem where the goal is to maximize the number of satisfied clauses, each containing exactly three literals, and it serves as a central problem in the study of approximation algorithms and hardness of approximation.
-
C.
k-SAT
k-SAT is a canonical NP-complete decision problem in Boolean logic where one asks whether there exists a truth assignment satisfying a formula expressed as a conjunction of clauses, each containing at most k literals.
-
D.
Boolean satisfiability problem
The Boolean satisfiability problem (SAT) is the canonical NP-complete decision problem of determining whether there exists an assignment of truth values to variables that makes a given Boolean formula evaluate to true.
-
E.
Clique problem
The Clique problem is a classic NP-complete decision problem in graph theory that asks whether a graph contains a fully connected subgraph (clique) of at least a given size.
- 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-CSP Target entity description: Max-CSP is a general optimization framework in theoretical computer science where the goal is to assign values to variables to satisfy as many given constraints as possible.
-
A.
Max-SAT
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.
-
B.
Max-3-SAT
Max-3-SAT is an optimization variant of the Boolean satisfiability problem where the goal is to maximize the number of satisfied clauses, each containing exactly three literals, and it serves as a central problem in the study of approximation algorithms and hardness of approximation.
-
C.
k-SAT
k-SAT is a canonical NP-complete decision problem in Boolean logic where one asks whether there exists a truth assignment satisfying a formula expressed as a conjunction of clauses, each containing at most k literals.
-
D.
Boolean satisfiability problem
The Boolean satisfiability problem (SAT) is the canonical NP-complete decision problem of determining whether there exists an assignment of truth values to variables that makes a given Boolean formula evaluate to true.
-
E.
Clique problem
The Clique problem is a classic NP-complete decision problem in graph theory that asks whether a graph contains a fully connected subgraph (clique) of at least a given size.
- F. None of above. chosen
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.