The Fixpoint Bounded-Variable Queries are PSPACE-Complete (1996)

by S. Dziembowski , Stefan Dziembowski
Venue:Presented at the 10th Annual International Conference of the European Association for Computer Science Logic, CSL '96
Citations:7 - 0 self

Documents Related by Co-Citation

527 The complexity of relational query languages – M Y Vardi - 1982
497 Finite Model Theory – H-D Ebbinghaus, J Flum - 1995
442 Extending Modal Logic – M De Rijke - 1993
92 Deciding the winner in parity games – M Jurdziński
76 On the complexity of bounded-variable queries – M Y Vardi - 1995
212 Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) – E. A. Emerson, C. S. Jutla - 1991
299 An Automata-Theoretic Approach to Branching-Time Model Checking – Orna Kupferman, Moshe Y. Vardi, Pierre Wolper - 1998
128 The Art of Computer Programming, Volume III: Sorting and Searching. Second edition – D E Knuth - 1997
213 Modal Languages And Bounded Fragments Of Predicate Logic – Hajnal Andréka, Johan Van Benthem, István Németi - 1996