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: "Logic for Computer Science: Foundations of Automatic Theorem Proving" | Statement: [Donald W. Loveland, authorOf, "Logic for Computer Science: Foundations of Automatic Theorem Proving"]

Target entity: "Logic for Computer Science: Foundations of Automatic Theorem Proving"
Context triple: [Donald W. Loveland, authorOf, "Logic for Computer Science: Foundations of Automatic Theorem Proving"]

• A. 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.
• B. "Automated Theorem Proving: A Logical Basis"
  "Automated Theorem Proving: A Logical Basis" is a foundational textbook that presents the logical theory and algorithms underlying automated reasoning and theorem-proving systems in computer science and mathematical logic.
• C. The Logic of Computer Programming
  The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
• 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. 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.
• 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: "Logic for Computer Science: Foundations of Automatic Theorem Proving"
Triple: [Donald W. Loveland, authorOf, "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.

Target entity: "Logic for Computer Science: Foundations of Automatic Theorem Proving"
Target entity description: "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.

• A. 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.
• B. "Automated Theorem Proving: A Logical Basis"
  "Automated Theorem Proving: A Logical Basis" is a foundational textbook that presents the logical theory and algorithms underlying automated reasoning and theorem-proving systems in computer science and mathematical logic.
• C. The Logic of Computer Programming
  The Logic of Computer Programming is a foundational textbook in theoretical computer science that rigorously develops methods for specifying, proving, and reasoning about the correctness of computer programs.
• 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. 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.
• F. None of above. chosen