Two-variable logic on data words

Mikolaj Bojanczyk,Claire David,Anca Muscholl,Thomas Schwentick,Luc Segoufin

ACM Trans. Comput. Log.（2011）

引用 322|浏览31

暂无评分

摘要

In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. This model has been already considered in the realm of semistructured data, timed automata, and extended temporal logics. This article shows that satisfiability for the two-variable fragment FO2(∼,

查看译文

关键词

first order logic,satisfiability,temporal logic,petri net,equivalence relation

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要