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 条
  • [31] Atropos: A PSPACE-Complete Sperner Triangle Game
    Burke, Kyle W.
    Teng, Shang-Hua
    INTERNET MATHEMATICS, 2008, 5 (04) : 477 - 492
  • [32] Deciding the K-dimension is PSPACE-complete
    Schaefer, M
    15TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 198 - 203
  • [33] ON SEMIGROUPS WITH PSPACE-COMPLETE SUBPOWER MEMBERSHIP PROBLEM
    Steindl, Markus
    JOURNAL OF THE AUSTRALIAN MATHEMATICAL SOCIETY, 2019, 106 (01) : 127 - 142
  • [34] An Automaton Group with PSPACE-Complete Word Problem
    Jan Philipp Wächter
    Armin Weiß
    Theory of Computing Systems, 2023, 67 : 178 - 218
  • [35] FINITE-AUTOMATON APERIODICITY IS PSPACE-COMPLETE
    CHO, S
    HUYNH, DT
    THEORETICAL COMPUTER SCIENCE, 1991, 88 (01) : 99 - 116
  • [36] An Automaton Group with PSPACE-Complete Word Problem
    Waechter, Jan Philipp
    Weiss, Armin
    THEORY OF COMPUTING SYSTEMS, 2023, 67 (01) : 178 - 218
  • [37] Solving a PSPACE-complete problem by gene assembly
    Zerjatke, Thomas
    Sturm, Monika
    JOURNAL OF LOGIC AND COMPUTATION, 2013, 23 (04) : 897 - 908
  • [38] An Automaton Group with PSPACE-Complete Word Problem
    Waechter, Jan Philipp
    Weiss, Armin
    37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 2020, 154
  • [39] Nondeterministic information logic NIL is PSPACE-complete
    Demri, Stephane
    Fundamenta Informaticae, 2000, 42 (03) : 211 - 234
  • [40] Generalized Pete's Pike is PSPACE-complete
    Meyer, Bernd
    THEORETICAL COMPUTER SCIENCE, 2016, 613 : 115 - 125
12345