Triple

Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).

Phrase: Boolean satisfiability problem | Statement: [SAT problem, alsoKnownAs, Boolean satisfiability problem]

Target entity: Boolean satisfiability problem
Context triple: [SAT problem, alsoKnownAs, Boolean satisfiability problem]

• A. Boolean satisfiability problem chosen
  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.
• B. 3-SAT
  3-SAT is a classic Boolean satisfiability problem where each clause has exactly three literals and which serves as a fundamental NP-complete benchmark in computational complexity theory.
• 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. Davis–Putnam algorithm
  The Davis–Putnam algorithm is a pioneering procedure in automated theorem proving and propositional logic satisfiability that laid foundational groundwork for modern SAT solvers.
• E. 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.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.