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 条
  • [21] Friends-and-strangers is PSPACE-complete
    Yang, Chao
    Zhang, Zhujun
    INFORMATION PROCESSING LETTERS, 2025, 190
  • [22] Everything is PSPACE-complete in interaction systems
    Majster-Cederbaum, Mila
    Minnameier, Christoph
    THEORETICAL ASPECTS OF COMPUTING - ICTAC 2008, PROCEEDINGS, 2008, 5160 : 216 - 227
  • [23] Optimizing the Region Algebra is PSPACE-complete
    Gelade, Wouter
    Neven, Frank
    INFORMATION PROCESSING LETTERS, 2010, 110 (16) : 639 - 643
  • [24] Convergence of Opinion Diffusion is PSPACE-Complete
    Chistikov, Dmitry
    Lisowski, Grzegorz
    Paterson, Mike
    Turrini, Paolo
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 7103 - 7110
  • [25] A PSPACE-complete sperner triangle game
    Burke, Kyle W.
    Teng, Shang-Hua
    INTERNET AND NETWORK ECONOMICS, PROCEEDINGS, 2007, 4858 : 445 - 456
  • [26] Task and Motion Planning Is PSPACE-Complete
    Vega-Brown, William
    Roy, Nicholas
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 10385 - 10392
  • [27] Online Chromatic Number is PSPACE-Complete
    Martin Böhm
    Pavel Veselý
    Theory of Computing Systems, 2018, 62 : 1366 - 1391
  • [28] PROOF EQUIVALENCE IN MLL IS PSPACE-COMPLETE
    Heijltjes, Willem
    Houston, Robin
    LOGICAL METHODS IN COMPUTER SCIENCE, 2016, 12 (01)
  • [29] Solving a PSPACE-complete problem with cP systems
    Henderson, Alec
    Nicolescu, Radu
    Dinneen, Michael J.
    JOURNAL OF MEMBRANE COMPUTING, 2020, 2 (04) : 311 - 322
  • [30] Solving a PSPACE-complete problem with cP systems
    Alec Henderson
    Radu Nicolescu
    Michael J. Dinneen
    Journal of Membrane Computing, 2020, 2 : 311 - 322
12345