Definability over Linear Constraints

Authors:
Michael Benedikt;H. Jerome Keisler
Affiliations:
-;-
Venue:
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Year:
2000

Citing 7
Cited 0

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 Topological Elementary Equivalence of Spatial Databases

ICDT '97 Proceedings of the 6th International Conference on Database Theory
Linear vs Polynomial Constraints in Database Query Languages

PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
Expressive Power of Unary Counters

Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
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
Constraint Databases

Constraint Databases

Quantified Score

Hi-index	0.01

Visualization

Abstract

We settle a number of questions concerning definability in first order logics with an extra predicate symbol ranging over semilinear sets. These questions are motivated by the constraint database model for representing spatial data. We give new results both on the positive and negative side: we show that in first-order logic one cannot query a semi-linear set as to whether or not it contains a line, or whether or not it contains the line segment between two given points. However, we show that some ofthese queries become definable if one makes small restrictions on the semi-linear sets considered.