arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2206.05973cs.LOcs.CL
收藏

线性时间时序逻辑的Sahlqvist型对应定理

A Sahlqvist-style Correspondence Theorem for Linear-time Temporal Logic

Sorbonne Université(索邦大学);Imperial College London(帝国理工学院)

Rui Li, Francesco Belardinelli

摘要:

模态逻辑的语言能够在克里普克框架上表达一阶条件。Henrik Sahlqvist的经典结果确定了一类重要的模态公式,对于这些模态公式,可以用有效的算法找到一阶条件或Sahlqvist对应条件。最近的工作已经成功地将这一经典结果扩展到更复杂的模态语言。在本文中,我们追求一个类似的路线,并制定了Sahlqvist风格的对应定理的线性时间时序逻辑(LTL),这是一个最广泛使用的形式语言的时间规格说明。LTL扩展了基本模态逻辑的语法,使用专用的时态运算符Next X和Until U。因此,具有一阶对应项的公式类的复杂性也相应地增加。在本文中,我们确定了一类重要的LTL Sahlqvist公式建立使用模态算子F,G,X,和U。本文的主要结果是证明了LTL Sahlqvist公式与一阶语言可定义的框架条件的对应性。

英文摘要:

The language of modal logic is capable of expressing first-order conditions on Kripke frames. The classic result by Henrik Sahlqvist identifies a significant class of modal formulas for which first-order conditions -- or Sahlqvist correspondents -- can be find in an effective, algorithmic way. Recent works have successfully extended this classic result to more complex modal languages. In this paper, we pursue a similar line and develop a Sahlqvist-style correspondence theorem for Linear-time Temporal Logic (LTL), which is one of the most widely used formal languages for temporal specification. LTL extends the syntax of basic modal logic with dedicated temporal operators Next X and Until U . As a result, the complexity of the class of formulas that have first-order correspondents also increases accordingly. In this paper, we identify a significant class of LTL Sahlqvist formulas built by using modal operators F , G, X, and U . The main result of this paper is to prove the correspondence of LTL Sahlqvist formulas to frame conditions that are definable in first-order language.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑