On the complexity of bounded-variable queries (extended abstract)
- 22 May 1995
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 266-276
- https://doi.org/10.1145/212433.212474
Abstract
No abstract availableThis publication has 28 references indexed in Scilit:
- A linear-time model-checking algorithm for the alternation-free modal mu-calculusFormal Methods in System Design, 1993
- Local model checking in the modal mu-calculusTheoretical Computer Science, 1991
- On uniformity within NC1Journal of Computer and System Sciences, 1990
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- Fixed-point extensions of first-order logicAnnals of Pure and Applied Logic, 1986
- On the Desirability of Acyclic Database SchemesJournal of the ACM, 1983
- Results on the propositional μ-calculusTheoretical Computer Science, 1983
- Structure and complexity of relational queriesJournal of Computer and System Sciences, 1982
- Log Space Recognition and Translation of Parenthesis LanguagesJournal of the ACM, 1977
- A lattice-theoretical fixpoint theorem and its applicationsPacific Journal of Mathematics, 1955