Bounded-Variable Fixpoint Queries are PSPACE-complete

Stefan Dziembowski. Bounded-Variable Fixpoint Queries are PSPACE-complete. In Dirk van Dalen, Marc Bezem, editors, Computer Science Logic, 10th International Workshop, CSL 96, Annual Conference of the EACSL, Utrecht, The Netherlands, September 21-27, 1996, Selected Papers. Volume 1258 of Lecture Notes in Computer Science, pages 89-105, Springer, 1996.

Abstract

Abstract is missing.