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

最大化量化时间约束的可处理性

Tractability of Quantified Temporal Constraints To The Max

Manuel Bodirsky, Hubie Chen, Michał Wrona

摘要:

时态约束语言是一组在(Q;<)上一阶可定义的关系。我们表明,几个时间约束语言的约束满足问题是最大的易处理的表达更量化的约束满足问题也是最大的易处理的。这些约束语言的定义在某些二元多态性下的保存。我们还提出了这些语言的关系的句法特征。

英文摘要:

A temporal constraint language is a set of relations that are first-order definable over (Q;<). We show that several temporal constraint languages whose constraint satisfaction problem is maximally tractable are also maximally tractable for the more expressive quantified constraint satisfaction problem. These constraint languages are defined in terms of preservation under certain binary polymorphisms. We also present syntactic characterizations of the relations in these languages.

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

↑