Complexity of the guarded two-variable fragment with counting quantifiers

被引:0
|
作者
Pratt-Hartmann, Ian [1 ]
机构
[1] Univ Manchester, Sch Comp Sci, Manchester M13 9PL, Lancs, England
关键词
two-variable fragment; guarded fragment; counting quantifiers; logic; complexity;
D O I
10.1093/logcom/exl034
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The finite satisfiability problem for the guarded two-variable fragment with counting quantifiers is in EXPTIME.
引用
收藏
页码:133 / 155
页数:23
相关论文
共 50 条