Incomplete Information in Relational Databases
Journal of the ACM (JACM)
Relational queries computable in polynomial time
Information and Control
Complexity measures for public-key cryptosystems
SIAM Journal on Computing - Special issue on cryptography
The complexity of facets resolved
Journal of Computer and System Sciences - 26th IEEE Conference on Foundations of Computer Science, October 21-23, 1985
Complexity classes without machines: on complete languages for UP
Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Fixpoint extensions of first-order logic and datalog-like languages
Proceedings of the Fourth Annual Symposium on Logic in computer science
Generic Computation and its complexity
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Machine models and simulations
Handbook of theoretical computer science (vol. A)
A catalog of complexity classes
Handbook of theoretical computer science (vol. A)
Parallel algorithms for shared-memory machines
Handbook of theoretical computer science (vol. A)
Elements of relational database theory
Handbook of theoretical computer science (vol. B)
Finite-model theory—a personal perspective
ICDT Selected papers of the 4th international conference on Database theory
A taxonomy of complexity classes of functions
Journal of Computer and System Sciences
Stable models and non-determinism in logic programs with negation
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Non-deterministic languages to express deterministic transformations
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
DATALOG Queries with Stratified Negation and Choice: from P to DP
ICDT '95 Proceedings of the 5th International Conference on Database Theory
Implicit Definability and Infinitary Logic in Finite Model Theory
ICALP '95 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming
Generalized Implicit Definitions on Finite Structures
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The complexity of facets (and some facets of complexity)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
Non-deterministic computation is not really computation, but the difference with real computation is blurred. We study in detail various levels of non-determinism in computations on non-deterministic Turing machines with polynomial bounds on the resources. Meanwhile, we consider numerous query languages, implicit logic, choice logic, order invariant logic, and restrictions of second-order logic, and establish correspondences between all these formalisms for both deterministic and non-deterministic queries. To the degrees of non-determinism in the computations, correspond levels of non-determinism in the logical definitions. Our main contribution is to characterize various complexity classes between PTIME and PSPACE, by several logical means, thus translating open questions in complexity theory to open questions in logic related to the use of the non-determinism.