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: "Computer-Aided Reasoning: An Approach" | Statement: [Matt Kaufmann, notablePublication, "Computer-Aided Reasoning: An Approach"]

Target entity: "Computer-Aided Reasoning: An Approach"
Context triple: [Matt Kaufmann, notablePublication, "Computer-Aided Reasoning: An Approach"]

• A. Handbook of Automated Reasoning
  The "Handbook of Automated Reasoning" is a comprehensive reference work that surveys the theories, methods, and tools used in the field of automated theorem proving and formal reasoning in computer science and logic.
• B. Journal of Automated Reasoning
  The Journal of Automated Reasoning is a peer-reviewed academic journal focusing on research in automated reasoning, formal methods, and related areas of computer science and logic.
• C. "Logic for Computer Science: Foundations of Automatic Theorem Proving"
  "Logic for Computer Science: Foundations of Automatic Theorem Proving" is a textbook that introduces the logical foundations and practical techniques underlying automated theorem proving and its applications in computer science.
• D. "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.
• E. 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.
• 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: "Computer-Aided Reasoning: An Approach"
Triple: [Matt Kaufmann, notablePublication, "Computer-Aided Reasoning: An Approach"]

"Computer-Aided Reasoning: An Approach" is a foundational book on automated and interactive theorem proving that presents methods and tools for using computers to assist in formal reasoning and proof development.

Target entity: "Computer-Aided Reasoning: An Approach"
Target entity description: "Computer-Aided Reasoning: An Approach" is a foundational book on automated and interactive theorem proving that presents methods and tools for using computers to assist in formal reasoning and proof development.

• A. Handbook of Automated Reasoning
  The "Handbook of Automated Reasoning" is a comprehensive reference work that surveys the theories, methods, and tools used in the field of automated theorem proving and formal reasoning in computer science and logic.
• B. Journal of Automated Reasoning
  The Journal of Automated Reasoning is a peer-reviewed academic journal focusing on research in automated reasoning, formal methods, and related areas of computer science and logic.
• C. "Logic for Computer Science: Foundations of Automatic Theorem Proving"
  "Logic for Computer Science: Foundations of Automatic Theorem Proving" is a textbook that introduces the logical foundations and practical techniques underlying automated theorem proving and its applications in computer science.
• D. "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.
• E. 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.
• F. None of above. chosen