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 条
  • [41] Universal covers, color refinement, and two-variable counting logic: Lower bounds for the depth
    Krebs, Andreas
    Verbitsky, Oleg
    [J]. 2015 30TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2015, : 689 - 700
  • [42] A Two-Variable Interlace Polynomial
    Richard Arratia
    Béla Bollobás†
    Gregory B. Sorkin
    [J]. Combinatorica, 2004, 24 : 567 - 584
  • [43] A two-variable Artin conjecture
    Moree, P
    Stevenhagen, P
    [J]. JOURNAL OF NUMBER THEORY, 2000, 85 (02) : 291 - 304
  • [44] The Two-Variable Situation Calculus
    Gu, Yilan
    Soutchanski, Mikhail
    [J]. STAIRS 2006, 2006, 142 : 144 - +
  • [45] A two-variable interlace polynomial
    Arratia, R
    Bollobás, B
    Sorkin, GB
    [J]. COMBINATORICA, 2004, 24 (04) : 567 - 584
  • [46] On two-variable rational interpolation
    Antoulas, A. C.
    Ionita, A. C.
    Lefteriu, S.
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2012, 436 (08) : 2889 - 2915
  • [47] TWO-VARIABLE LOGIC WITH TWO ORDER RELATIONS
    Schwentick, Thomas
    Zeume, Thomas
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2012, 8 (01)
  • [48] Undecidability results on two-variable logics
    Erich Grädel
    Martin Otto
    Eric Rosen
    [J]. Archive for Mathematical Logic, 1999, 38 : 313 - 354
  • [49] Cliquishness and Quasicontinuity of Two-Variable Maps
    Bouziad, A.
    [J]. CANADIAN MATHEMATICAL BULLETIN-BULLETIN CANADIEN DE MATHEMATIQUES, 2013, 56 (01): : 55 - 64
  • [50] A two-variable linear programming problem
    Tran, D
    Alex, R
    [J]. CSC '05: Proceedings of the 2005 International Conference on Scientific Computing, 2005, : 205 - 216