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 条
  • [41] Parameterized Verification under TSO is PSPACE-Complete
    Abdulla, Parosh Aziz
    Atig, Mohamed Faouzi
    Rezvan, Rojin
    PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2020, 4 (POPL):
  • [42] Universal Generation for Optimality Theory Is PSPACE-Complete
    Hao, Sophie
    COMPUTATIONAL LINGUISTICS, 2023, 50 (01) : 83 - 117
  • [43] Dynamic Point Labeling is Strongly PSPACE-Complete
    Buchin, Kevin
    Gerrits, Dirk H. P.
    ALGORITHMS AND COMPUTATION, 2013, 8283 : 262 - 272
  • [44] Reachability in Cooperating Systems with Architectural Constraints is PSPACE-Complete
    Majster-Cederbaum, Mila
    Semmelrock, Nils
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2013, (138): : 1 - 11
  • [45] Strong bisimilarity on basic parallel processes is PSPACE-complete
    Jancar, P
    18TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2003, : 218 - 227
  • [46] Bisimilarity of One-Counter Processes Is PSPACE-Complete
    Bohm, Stanislav
    Goller, Stefan
    Jancar, Petr
    CONCUR 2010 - CONCURRENCY THEORY, 2010, 6269 : 177 - +
  • [47] Bounded-variable fragments of hybrid logics
    Schwentick, Thomas
    Weber, Volker
    STACS 2007, PROCEEDINGS, 2007, 4393 : 561 - +
  • [48] Parameterized Verification under Release Acquire is PSPACE-complete
    Krishna, Shankaranarayanan
    Godbole, Adwait
    Meyer, Roland
    Chakraborty, Soham
    PROCEEDINGS OF THE 2022 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, PODC 2022, 2022, : 482 - 492
  • [49] The Cyclic-Routing UAV Problem is PSPACE-Complete
    Ho, Hsi-Ming
    Ouaknine, Joel
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATION STRUCTURES (FOSSACS 2015), 2015, 9034 : 328 - 342
  • [50] Unary Coded PSPACE-Complete Languages in ASPACE(loglog n)
    Geffert, Viliam
    COMPUTER SCIENCE - THEORY AND APPLICATIONS (CSR 2017), 2017, 10304 : 141 - 153
12345