Finite satisfiability for guarded fixpoint logic
Finite satisfiability for guarded fixpoint logic
复制标题
受保护的定点逻辑的有限可满足性
DOI:
10.1016/j.ipl.2012.02.005
复制
发表时间:
2011
期刊:
影响因子:
--
通讯作者:
Mikolaj Bojanczyk
中科院分区:
文献类型:
--
作者:
V. Bárány;Mikolaj Bojanczyk
The finite satisfiability problem for guarded fixpoint logic is decidable and complete for 2ExpTime (resp. ExpTime for formulas of bounded width).
DOI:
10.1145/2108242.2108247
发表时间:
2012
期刊:
2010 25th Annual IEEE Symposium on Logic in Computer Science
影响因子:
--
作者:
M. Otto
通讯作者:
M. Otto
DOI:
10.2168/lmcs-10(2:3)2014
发表时间:
2014
期刊:
2010 25th Annual IEEE Symposium on Logic in Computer Science
影响因子:
--
作者:
V. Barany;G. Gottlob;M. Otto
通讯作者:
M. Otto