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: Computation Tree Logic | Statement: [linear temporal logic, isRelatedTo, Computation Tree Logic]

Target entity: Computation Tree Logic
Context triple: [linear temporal logic, isRelatedTo, Computation Tree Logic]

• A. branching-time temporal logic CTL* chosen
  Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
• B. linear temporal logic
  Linear temporal logic is a modal temporal logic used in computer science and formal methods to specify and reason about the behavior of systems over linear sequences of time, using operators that describe how properties evolve in the future.
• C. The Temporal Logic of Programs
  The Temporal Logic of Programs is a landmark 1977 paper by Amir Pnueli that introduced temporal logic as a formal framework for specifying and verifying the behavior of concurrent and reactive computer programs.
• D. mu-calculus
  The mu-calculus is a powerful modal logic with fixed-point operators used to express and verify properties of recursive and infinite-state systems in computer science.
• E. Compositional model checking
  Compositional model checking is a formal verification technique that proves system correctness by analyzing components separately and then combining the results, enabling scalable verification of complex systems.
• F. None of above.
• G. Unsure - the case is ambiguous/there is not enough information to decide.