The expressivity of constraint query languages with boolean algebra linear cardinality constraints

Authors:
Peter Revesz
Affiliations:
Department of Computer Science and Engineering, University of Nebraska-Lincoln, Lincoln, NE
Venue:
ADBIS'05 Proceedings of the 9th East European conference on Advances in Databases and Information Systems
Year:
2005

Citing 21
Cited 1

Constraint logic programming

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the computational complexity and geometry of the first-order theory of the reals. Par I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals

Journal of Symbolic Computation
Constraint query languages

Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Relational expressive power of constraint query languages

Journal of the ACM (JACM)
On indexing mobile objects

PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
DOMINO: databases fOr MovINg Objects tracking

SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
New results on quantifier elimination over real closed fields and applications to constraint databases

Journal of the ACM (JACM)
Indexing the positions of continuously moving objects

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A foundation for representing and querying moving objects

ACM Transactions on Database Systems (TODS)
Introduction to constraint databases

Introduction to constraint databases
Efficient Querying and Animation of Periodic Spatio-Temporal Databases

Annals of Mathematics and Artificial Intelligence
Constraint-based Interoperability of Spatiotemporal Databases*

Geoinformatica
Parametric Rectangles: A Model for Querying and Animation of Spatiotemporal Databases

EDBT '00 Proceedings of the 7th International Conference on Extending Database Technology: Advances in Database Technology
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
On Expressing Topological Connectivity in Spatial Datalog

CDB '97 Second International Workshop on Constraint Database Systems, Constraint Databases and Their Applications
On the Expressiveness of Query Languages with Linear Constraints; Capturing Desirable Spatial Properties

CDB '97 Second International Workshop on Constraint Database Systems, Constraint Databases and Their Applications
Presburger arithmetic with bounded quantifier alternation

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
A Geometric Framework for Specifying Spatiotemporal Objects

TIME '99 Proceedings of the Sixth International Workshop on Temporal Representation and Reasoning
Classes of Spatio-Temporal Objects and their Closure Properties

Annals of Mathematics and Artificial Intelligence
Constraint Databases

Constraint Databases
An algorithm for deciding BAPA: boolean algebra with presburger arithmetic

CADE' 20 Proceedings of the 20th international conference on Automated Deduction

Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic

CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constraint query languages with Boolean algebra linear cardinality constraints were introduced recently and shown to be evaluable using a quantifier elimination method in [22]. However, the expressive power of constraint query languages with linear cardinality constraints is still poorly understood in comparison with other cases of constraint query languages. This paper makes several contributions to the analysis of their expressive power. Several problems that were previously provably impossible to express even in FO+POLY are shown to be expressible using first-order query languages with linear cardinality constraints FO+BALC. We also show that all monadic Datalog queries are expressible in FO+BALC. Finally, we also show a new results for FO+LINEAR by expressing in it the problem of finding the time when two linearly moving point objects are closest to each other.