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: An Axiomatic Basis for Computer Programming | Statement: [Hoare logic, describedIn, An Axiomatic Basis for Computer Programming]

Target entity: An Axiomatic Basis for Computer Programming
Context triple: [Hoare logic, describedIn, An Axiomatic Basis for Computer Programming]

• A. 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.
• B. A Discipline of Programming
  A Discipline of Programming is a seminal 1976 book by Edsger W. Dijkstra that rigorously develops program construction using formal mathematical reasoning and correctness proofs.
• C. "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.
• D. Notes on Structured Programming
  Notes on Structured Programming is a seminal work by Edsger W. Dijkstra that advocates for disciplined, mathematically grounded program design and helped popularize the principles of structured programming.
• E. Böhm–Jacopini theorem
  The Böhm–Jacopini theorem is a foundational result in computer science stating that any computer program can be written using only sequence, selection, and iteration constructs, without requiring goto statements.
• 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: An Axiomatic Basis for Computer Programming
Triple: [Hoare logic, describedIn, 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.

Target entity: An Axiomatic Basis for Computer Programming
Target entity description: "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.

• A. 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.
• B. A Discipline of Programming
  A Discipline of Programming is a seminal 1976 book by Edsger W. Dijkstra that rigorously develops program construction using formal mathematical reasoning and correctness proofs.
• C. "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.
• D. Notes on Structured Programming
  Notes on Structured Programming is a seminal work by Edsger W. Dijkstra that advocates for disciplined, mathematically grounded program design and helped popularize the principles of structured programming.
• E. Böhm–Jacopini theorem
  The Böhm–Jacopini theorem is a foundational result in computer science stating that any computer program can be written using only sequence, selection, and iteration constructs, without requiring goto statements.
• F. None of above. chosen