arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1209.0516cs.LO
收藏

度量时态逻辑何时表达完备?

When is Metric Temporal Logic Expressively Complete?

Paul Hunter, Joël Ouaknine, James Worrell

摘要:

Kamp的一个开创性的结果是,在实数上,线性时态逻辑(LTL)具有与具有二元顺序关系<和一元谓词的一阶逻辑相同的表达能力。一个关键的问题是是否存在一个类似的度量时态逻辑(MTL)的坎普定理-一个推广的LTL中,直到和因为模态注释的区间表示度量约束。Hirshfeld和Rabinovich给出了否定的回答,证明了具有二元序关系<和一元函数+1的一阶逻辑严格地比具有整数常数的MTL更有表达性。然而,Hunter,Ouaknine和Worrell最近的一个结果表明,在合理的定时常数下,MTL具有与一阶逻辑相同的表达能力,给出了肯定的答案。在本文中,我们推广了这些结果,给出了一个精确的表征,MTL和一阶逻辑具有相同的表达能力的常数集。我们还表明,完整的一阶表达可以恢复与计数方式,强烈支持的断言Hirshfeld和Rabinovich的Q2 MLO是最具表达性的可判定的片段FO(<,+1)。

英文摘要:

A seminal result of Kamp is that over the reals Linear Temporal Logic (LTL) has the same expressive power as first-order logic with binary order relation < and monadic predicates. A key question is whether there exists an analogue of Kamp's theorem for Metric Temporal Logic (MTL) -- a generalization of LTL in which the Until and Since modalities are annotated with intervals that express metric constraints. Hirshfeld and Rabinovich gave a negative answer, showing that first-order logic with binary order relation < and unary function +1 is strictly more expressive than MTL with integer constants. However, a recent result of Hunter, Ouaknine and Worrell shows that with rational timing constants, MTL has the same expressive power as first-order logic, giving a positive answer. In this paper we generalize these results by giving a precise characterization of those sets of constants for which MTL and first-order logic have the same expressive power. We also show that full first-order expressiveness can be recovered with the addition of counting modalities, strongly supporting the assertion of Hirshfeld and Rabinovich that Q2MLO is one of the most expressive decidable fragments of FO(<,+1).

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

↑