Journal of the ACM (JACM)
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Symmetric Space-Bounded Computation (Extended Abstract)
Proceedings of the 7th Colloquium on Automata, Languages and Programming
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Relational queries computable in polynomial time (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
The decision problem for the probabilities of higher-order properties
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Binding performance at language design time
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Nondeterministic polynomial-time computations and models of arithmetic
Journal of the ACM (JACM)
IDLOG: extending the expressive power of deductive database languages
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Probabilistic complex actions in GOLOG
Fundamenta Informaticae
Threshold circuits of bounded depth
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Many Facets of Complexity in Logic
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
A framework for formalizing set theories based on the use of static set terms
Pillars of computer science
Complete problems for higher order logics
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Probabilistic Complex Actions in GOLOG
Fundamenta Informaticae - The 1st International Workshop on Knowledge Representation and Approximate Reasoning (KR&AR)
| Hi-index | 0.00 |
We present in this paper a series of languages adequate for expressing exactly those properties checkable in a series of computational complexity classes. For example, we show that a graph property is in polynomial time if and only if it is expressible in the language of first order graph theory together with a least fixed point operator. As another example, a group theoretic property is in the logspace hierarchy if and only if it is expressible in the language of first order group theory together with a transitive closure operator. In this paper we also introduce a reduction between problems that is new to complexity theory. First order translations, as the name implies, are fixed first order sentences which translate one kind of structure into another. We present problems which are complete for logspace, nondeterministic logspace, polynomial time, etc., via first order translations.