The Expressiveness of a Family of Finite Set Languages (1991)

by Neil Immerman , Sushant Patnaik , David Stemple
Venue:IN PROCEEDINGS OF 10TH ACM SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS
Citations:26 - 3 self

Active Bibliography

17 A Query Language for NC – Dan Suciu, Val Tannen - 1994
2424 Compositional Model Checking – E. M. Clarke, D. E. Long, K. L. Mcmillan - 1999
845 The Well-Founded Semantics for General Logic Programs – Kenneth A. Ross - 1991
12 Functional Database Query Languages as Typed Lambda Calculi of Fixed Order (Extended Abstract) – Gerd G. Hillebrand, Paris C. Kanellakis - 1994
20 Finite-Model Theory - A Personal Perspective – Ronald Fagin - 1993
335 Constraint Query Languages – Paris C. Kanellakis , Gabriel M. Kuper, Peter Z. Revesz - 1992
766 Logical foundations of object-oriented and frame-based languages – Michael Kifer, Georg Lausen, James Wu - 1995
777 The complexity of theorem-proving procedures – Stephen A. Cook - 1971
2347 Monotone Complexity – Michelangelo Grigni , Michael Sipser - 1990