Bounded-variable fixpoint queries are PSPACE-complete

被引：0
|
作者：
Dziembowski, S [1 ]
机构：
[1] Warsaw Univ, Inst Informat, PL-02097 Warszawa, Poland
来源：
COMPUTER SCIENCE LOGIC | 1997年 / 1258卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We study the complexity of the evaluation of bounded-variable fixpoint queries in relational databases. We exhibit a finite database such that the problem of deciding whether a closed fixpoint formula using only 2 individual variables is satisfied in this database is PSPACE-complete. This clarifies the issues raised by Vardi in [Var95]. We study also the complexity of query evaluation for a number of restrictions of fixpoint logic. In particular we exhibit a sublogic for which the upper bound postulated by Vardi holds.
引用
收藏
页码：89 / 105
页数：17
相关论文
共 50 条
  • [1] Bounded-width QBF is PSPACE-complete
    Atserias, Albert
    Oliva, Sergi
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2014, 80 (07) : 1415 - 1429
  • [2] SNOWMAN is PSPACE-complete
    He, Weihua
    Liu, Ziwen
    Yang, Chao
    THEORETICAL COMPUTER SCIENCE, 2017, 677 : 31 - 40
  • [3] Lemmings is PSPACE-complete
    Viglietta, Giovanni
    THEORETICAL COMPUTER SCIENCE, 2015, 586 : 120 - 134
  • [4] Lemmings Is PSPACE-Complete
    Viglietta, Giovanni
    FUN WITH ALGORITHMS, 2014, 8496 : 340 - 351
  • [5] Generalized Amazons is PSPACE-Complete
    Furtak, Timothy
    Kiyomi, Masashi
    Uno, Takeaki
    Buro, Michael
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 132 - 137
  • [6] Robustness of PSPACE-complete sets
    Pavan, A.
    Wang, Fengming
    INFORMATION PROCESSING LETTERS, 2007, 103 (03) : 102 - 104
  • [7] Havannah and TwixT are PSPACE-complete
    Bonnet, Edouard
    Jamain, Florian
    Saffidine, Abdallah
    COMPUTERS AND GAMES, CG 2013, 2014, 8427 : 175 - 186
  • [8] Avoidance games are PSPACE-Complete
    Gledel, Valentin
    Oijid, Nacim
    arXiv, 2022,
  • [9] PULL and PUSHPULL are PSPACE-complete
    Pereira, Andre G.
    Ritt, Marcus
    Buriol, Luciana S.
    THEORETICAL COMPUTER SCIENCE, 2016, 628 : 50 - 61
  • [10] Integer circuit evaluation is PSPACE-complete
    Yang, K
    15TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 204 - 211
12345