The complexity of elementary algebra and geometry
Journal of Computer and System Sciences
Relational queries computable in polynomial time
Information and Control
On conjunctive queries containing inequalities
Journal of the ACM (JACM)
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Parallel computation with threshold functions
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
0-1 laws and decision problems for fragments of second-order logic
Information and Computation - Selections from 1988 IEEE symposium on logic in computer science
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Datalog extensions for database queries and updates
Journal of Computer and System Sciences
On the expressive power of database queries with intermediate types
Journal of Computer and System Sciences
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Safety and translation of calculus queries with scalar functions
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Infinitary logics and 0–1 laws
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Domain independence and the relational calculus
Acta Informatica
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Linear vs. order constraint queries over rational databases (extended abstract)
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
First-order queries on databases embedded in an infinite structure
Information Processing Letters
Queries with arithmetical constraints
Theoretical Computer Science - Special issue: principles and practice of constraint programming
The complexity of querying indefinite data about linearly ordered domains
Journal of Computer and System Sciences - Special issue: dedicated to the memory of Paris Kanellakis
Counting quantifiers, successor relations, and logarithmic space
Journal of Computer and System Sciences - special issue on complexity theory
Uniform quantifier elimination and constraint query processing
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
Languages for relational databases over interpreted structures
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query languages for bags and aggregate functions
Journal of Computer and System Sciences - Special issue on principles of database systems
Finitely representable databases
Journal of Computer and System Sciences - Special issue on principles of database systems
Relational expressive power of constraint query languages
Journal of the ACM (JACM)
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Information and Computation - Special issue: logic and computational complexity
First-Order Queries on Finite Structures Over the Reals
SIAM Journal on Computing
Journal of the ACM (JACM)
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
First Order Logic, Fixed Point Logic and Linear Order
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
Linear Constraint Query Languages: Expressive Power and Complexity
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
On the Power of Aggregation in Relational Query Languages
DBLP-6 Proceedings of the 6th International Workshop on Database Programming Languages
On the Structure of Queries in Constraint Query Languages
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Embedded Finite Models, Stability Theory and the Impact of Order
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Reachability and connectivity queries in constraint databases
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
String operations in query languages
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Quantifier Rank for Parity of Embedded Finite Models
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Applications of Alfred Tarski's Ideas in Database Theory
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Quantifier rank for parity of embedded finite models
Theoretical Computer Science - Mathematical foundations of computer science
Reachability and connectivity queries in constraint databases
Journal of Computer and System Sciences - Special issue on PODS 2000
Definable relations and first-order query languages over strings
Journal of the ACM (JACM)
Variable independence for first-order definable constraints
ACM Transactions on Computational Logic (TOCL)
An expressive language for linear spatial database queries
Journal of Computer and System Sciences
Uniform generation in spatial constraint databases and applications
Journal of Computer and System Sciences
An Ehrenfeucht-Fraïssé game approach to collapse results in database theory
Information and Computation
Logical definability and query languages over ranked and unranked trees
ACM Transactions on Computational Logic (TOCL)
Expressive power of query languages for constraint complex value databases
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications: Part II
Definability of languages by generalized first-order formulas over (N,+)
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Non-definability of Languages by Generalized First-order Formulas over (N,+)
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Hi-index | 0.01 |
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the classical theory that go through 'as before' when interpreted structure is present, parts that go through only for classes of nicely behaved structures, and parts that only arise in the interpreted case. The first category include a number of results on language equivalence and expressive power characterizations for the active-domain semantics for a variety of logics. Under this semantics, quantifiers range over elements of a relational database. The main kind of results we prove here are generic collapse results: for generic queries, adding operations beyond order, does not give us extra power. The second category includes results on the natural semantics, under which quantifiers range over the entire interpreted structure. We prove, for a variety of structures, natural-active collapse results, showing that using unrestricted quantification does not give us any extra power. Moreover, for a variety of structures, including the real field, we give a set of algorithms for eliminating unbounded quantifications in favor of bounded ones. Furthermore, we extend these collapse results to a new class of higher-order logics that mix unbounded and bounded quantification. We give a set of normal forms for these logics, under special conditions on the interpreted structures. As a by-product, we obtain an elementary proof of the fact that parity test is not definable in the relational calculus with polynomial inequality constraints. We also give examples of structures with nice model-theoretic properties over which the natural-active collapse fails.