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: A Computing Procedure for Quantification Theory | Statement: [Davis–Putnam algorithm, describedIn, A Computing Procedure for Quantification Theory]

Target entity: A Computing Procedure for Quantification Theory
Context triple: [Davis–Putnam algorithm, describedIn, A Computing Procedure for Quantification Theory]

• A. "The Complexity of Theorem-Proving Procedures"
  "The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
• B. the Logic Theorist program
  The Logic Theorist program was an early artificial intelligence system developed in the 1950s that automatically proved theorems in symbolic logic and is often regarded as the first AI program.
• C. On a Problem of Formal Logic
  "On a Problem of Formal Logic" is a seminal philosophical and mathematical paper by F. P. Ramsey that contributed to the foundations of logic and helped inspire what is now known as Ramsey theory.
• D. First-Order Logic and Automated Theorem Proving
  "First-Order Logic and Automated Theorem Proving" is a foundational textbook that systematically introduces first-order logic while presenting key methods and algorithms used in automated theorem proving.
• E. An Axiomatic Basis for Computer Programming
  "An Axiomatic Basis for Computer Programming" is a seminal 1969 paper by C.A.R. Hoare that introduced the formal logical system now known as Hoare logic for reasoning about program correctness.
• F. None of above. chosen
• G. Unsure - the case is ambiguous/there is not enough information to decide.

Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"

Entity: A Computing Procedure for Quantification Theory
Triple: [Davis–Putnam algorithm, describedIn, A Computing Procedure for Quantification Theory]

"A Computing Procedure for Quantification Theory" is a seminal 1960 paper by Martin Davis and Hilary Putnam that introduced the Davis–Putnam algorithm, laying foundational work for automated theorem proving and propositional satisfiability.

Target entity: A Computing Procedure for Quantification Theory
Target entity description: "A Computing Procedure for Quantification Theory" is a seminal 1960 paper by Martin Davis and Hilary Putnam that introduced the Davis–Putnam algorithm, laying foundational work for automated theorem proving and propositional satisfiability.

• A. "The Complexity of Theorem-Proving Procedures"
  "The Complexity of Theorem-Proving Procedures" is Stephen Cook’s landmark 1971 paper that introduced the concept of NP-completeness and proved the Boolean satisfiability problem (SAT) to be NP-complete, laying the foundation for modern computational complexity theory.
• B. the Logic Theorist program
  The Logic Theorist program was an early artificial intelligence system developed in the 1950s that automatically proved theorems in symbolic logic and is often regarded as the first AI program.
• C. On a Problem of Formal Logic
  "On a Problem of Formal Logic" is a seminal philosophical and mathematical paper by F. P. Ramsey that contributed to the foundations of logic and helped inspire what is now known as Ramsey theory.
• D. First-Order Logic and Automated Theorem Proving
  "First-Order Logic and Automated Theorem Proving" is a foundational textbook that systematically introduces first-order logic while presenting key methods and algorithms used in automated theorem proving.
• E. An Axiomatic Basis for Computer Programming
  "An Axiomatic Basis for Computer Programming" is a seminal 1969 paper by C.A.R. Hoare that introduced the formal logical system now known as Hoare logic for reasoning about program correctness.
• F. None of above. chosen