Relational queries computable in polynomial time
Information and Control
Languages that capture complexity classes
SIAM Journal on Computing
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Some relationships between logics of programs and complexity theory
Theoretical Computer Science
Descriptive characterizations of computational complexity
Journal of Computer and System Sciences
Fixpoint extensions of first-order logic and datalog-like languages
Proceedings of the Fourth Annual Symposium on Logic in computer science
Characterizing complexity classes by higher type primitive recursive definitions
Proceedings of the Fourth Annual Symposium on Logic in computer science
Inductive definitions over finite structures
Information and Computation
Generic Computation and its complexity
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Datalog extensions for database queries and updates
Journal of Computer and System Sciences
An analysis of fixed-point queries on binary trees
Theoretical Computer Science
Stable networks and product graphs
Stable networks and product graphs
Infinitary logics and 0–1 laws
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
A foundational delineation of poly-time
Papers presented at the IEEE symposium on Logic in computer science
Infinitary logic and inductive definability over finite structures
Information and Computation
Computing with first-order logic
Selected papers of the 23rd annual ACM symposium on Theory of computing
Computing with infinitary logic
ICDT '92 Selected papers of the fourth international conference on Database theory
On the expressive power of Datalog: tools and a case study
Selected papers of the 9th annual 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
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
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Logical Approach to the Problem "P=NP?"
MFCS '80 Proceedings of the 9th Symposium on Mathematical Foundations of Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Uniform definability on finite structures with successor
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Equivalence in finite-variable logics is complete for polynomial time
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Δ: Set-theoretic query language capturing LOGSPACE
Annals of Mathematics and Artificial Intelligence
A study of homogeneity in relational databases
Annals of Mathematics and Artificial Intelligence
Program Schemes, Queues, the Recursive Spectrum and Zero-One Laws
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Partial Fixed-Point Logic on Infinite Structures
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
A survey of semantic description frameworks for programming languages
ACM SIGPLAN Notices
On the computation of approximations of database queries
ADC '04 Proceedings of the 15th Australasian database conference - Volume 27
Relational databases and homogeneity in logics with counting
Acta Cybernetica
The Descriptive Complexity of Parity Games
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
The Relational Polynomial-Time Hierarchy and Second-Order Logic
Semantics in Data and Knowledge Bases
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Fixed-Point Quantifiers in Higher Order Logics
Proceedings of the 2006 conference on Information Modelling and Knowledge Bases XVII
Program Schemes, Queues, the Recursive Spectrum and Zero-one Laws
Fundamenta Informaticae - Machines, Computations and Universality, Part II
Hi-index | 0.00 |
We establish a general connection between fixpoint logic and complexity. On one side, we have fixpoint logic, parameterized by the choices of 1st-order operators (inflationary or noninflationary) and iteration constructs (deterministic, nondeterministic, or alternating). On the other side, we have the complexity classes between P and EXPTIME. Our parameterized fixpoint logics capture the complexity classes P, NP, PSPACE, and EXPTIME, but equally is achieved only over ordered structures.There is, however, an inherent mismatch between complexity and logic—while computational devices work on encodings of problems, logic is applied directly to the underlying mathematical structures. To overcome this mismatch, we use a theory of relational complexity, which bridges the gap between standard complexity and fixpoint logic. On one hand, we show that questions about containments among standard complexity classes can be translated to questions about containments among relational complexity classes. On the other hand, the expressive power of fixpoint logic can be precisely characterized in terms of relational complexity classes. This tight, three-way relationship among fixpoint logics, relational complexity and standard complexity yields in a uniform way logical analogs to all containments among the complexity classes P, NP, PSPACE, and EXPTIME. The logical formulation shows that some of the most tantalizing questions in complexity theory boil down to a single question: the relative power of inflationary vs. noninflationary 1st-order operators.