English

Temporal Ensemble Logic

Logic in Computer Science 2024-09-02 v2 Artificial Intelligence Formal Languages and Automata Theory

Abstract

We introduce Temporal Ensemble Logic (TEL), a monadic, first-order modal logic for linear-time temporal reasoning. TEL includes primitive temporal constructs such as ``always up to tt time later'' (t\Box_t), ``sometimes before tt time in the future'' (t\Diamond_t), and ``tt-time later'' φt\varphi_t. TEL has been motivated from the requirement for rigor and reproducibility for cohort specification and discovery in clinical and population health research, to fill a gap in formalizing temporal reasoning in biomedicine. Existing logical frameworks such as linear temporal logic are too restrictive to express temporal and sequential properties in biomedicine, or too permissive in semantic constructs, such as in Halpern-Shoham logic, to serve this purpose. In this paper, we first introduce TEL in a general set up, with discrete and dense time as special cases. We then focus on the theoretical development of discrete TEL on the temporal domain of positive integers N+\mathbb{N}^+, denoted as TELN+{\rm TEL}_{\mathbb{N}^+}. TELN+{\rm TEL}_{\mathbb{N}^+} is strictly more expressive than the standard monadic second order logic, characterized by B\"{u}chi automata. We present its formal semantics, a proof system, and provide a proof for the undecidability of the satisfiability of TELN+{\rm TEL}_{\mathbb{N}^+}. We also include initial results on expressiveness and decidability fragments for TELN+{\rm TEL}_{\mathbb{N}^+}, followed by application outlook and discussions.

Keywords

Cite

@article{arxiv.2408.14443,
  title  = {Temporal Ensemble Logic},
  author = {Guo-Qiang Zhang},
  journal= {arXiv preprint arXiv:2408.14443},
  year   = {2024}
}

Comments

47 pages, 2 figures