{"title":"时态组合逻辑","authors":"Guo-Qiang Zhang","doi":"arxiv-2408.14443","DOIUrl":null,"url":null,"abstract":"We introduce Temporal Ensemble Logic (TEL), a monadic, first-order modal\nlogic for linear-time temporal reasoning. TEL includes primitive temporal\nconstructs such as ``always up to $t$ time later'' ($\\Box_t$), ``sometimes\nbefore $t$ time in the future'' ($\\Diamond_t$), and ``$t$-time later''\n$\\varphi_t$. TEL has been motivated from the requirement for rigor and\nreproducibility for cohort specification and discovery in clinical and\npopulation health research, to fill a gap in formalizing temporal reasoning in\nbiomedicine. In this paper, we first introduce TEL in a general set up, with\ndiscrete and dense time as special cases. We then focus on the theoretical\ndevelopment of discrete TEL on the temporal domain of positive integers\n$\\mathbb{N}^+$, denoted as ${\\rm TEL}_{\\mathbb{N}^+}$. ${\\rm\nTEL}_{\\mathbb{N}^+}$ is strictly more expressive than the standard monadic\nsecond order logic, characterized by B\\\"{u}chi automata. We present its formal\nsemantics, a proof system, and provide a proof for the undecidability of the\nsatisfiability of ${\\rm TEL}_{\\mathbb{N}^+}$. We also discuss expressiveness\nand decidability fragments for ${\\rm TEL}_{\\mathbb{N}^+}$, followed by\nillustrative applications.","PeriodicalId":501208,"journal":{"name":"arXiv - CS - Logic in Computer Science","volume":"7 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Temporal Ensemble Logic\",\"authors\":\"Guo-Qiang Zhang\",\"doi\":\"arxiv-2408.14443\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce Temporal Ensemble Logic (TEL), a monadic, first-order modal\\nlogic for linear-time temporal reasoning. TEL includes primitive temporal\\nconstructs such as ``always up to $t$ time later'' ($\\\\Box_t$), ``sometimes\\nbefore $t$ time in the future'' ($\\\\Diamond_t$), and ``$t$-time later''\\n$\\\\varphi_t$. TEL has been motivated from the requirement for rigor and\\nreproducibility for cohort specification and discovery in clinical and\\npopulation health research, to fill a gap in formalizing temporal reasoning in\\nbiomedicine. In this paper, we first introduce TEL in a general set up, with\\ndiscrete and dense time as special cases. We then focus on the theoretical\\ndevelopment of discrete TEL on the temporal domain of positive integers\\n$\\\\mathbb{N}^+$, denoted as ${\\\\rm TEL}_{\\\\mathbb{N}^+}$. ${\\\\rm\\nTEL}_{\\\\mathbb{N}^+}$ is strictly more expressive than the standard monadic\\nsecond order logic, characterized by B\\\\\\\"{u}chi automata. We present its formal\\nsemantics, a proof system, and provide a proof for the undecidability of the\\nsatisfiability of ${\\\\rm TEL}_{\\\\mathbb{N}^+}$. We also discuss expressiveness\\nand decidability fragments for ${\\\\rm TEL}_{\\\\mathbb{N}^+}$, followed by\\nillustrative applications.\",\"PeriodicalId\":501208,\"journal\":{\"name\":\"arXiv - CS - Logic in Computer Science\",\"volume\":\"7 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-08-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Logic in Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2408.14443\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Logic in Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2408.14443","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
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 $t$ time later'' ($\Box_t$), ``sometimes
before $t$ time in the future'' ($\Diamond_t$), and ``$t$-time later''
$\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. 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
$\mathbb{N}^+$, denoted as ${\rm TEL}_{\mathbb{N}^+}$. ${\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 ${\rm TEL}_{\mathbb{N}^+}$. We also discuss expressiveness
and decidability fragments for ${\rm TEL}_{\mathbb{N}^+}$, followed by
illustrative applications.