scientific article; zbMATH DE number 1395614
From MaRDI portal
Publication:4935250
zbMath0935.00022MaRDI QIDQ4935250
No author found.
Publication date: 31 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to computer science (68-06)
Related Items
Database querying under changing preferences, A representation independent language for planar spatial databases with Euclidean distance, Database query languages and functional logic programming, An Ehrenfeucht-Fraïssé game approach to collapse results in database theory, On the Expressive Power of Query Languages for Matrices, Reachability and connectivity queries in constraint databases, Inputs, Outputs, and Composition in the Logic of Information Flows, Quantifier rank for parity of embedded finite models., Topological elementary equivalence of regular semi‐algebraic sets in three‐dimensional space, Efficient evaluation of specific queries in constraint databases, An extended constraint deductive database: theory and implementation, Deciding the point-to-fixed-point problem for skew tent maps on an interval, Unnamed Item, Evaluating geometric queries using few arithmetic operations, An expressive language for linear spatial database queries, Database Theory, Yuri, and Me, Counting complexity classes for numeric computations. II: Algebraic and semialgebraic sets, On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases, Cardinal directions between spatial objects: the pairwise-consistency problem, First-order expressibility of languages with neutral letters or: The Crane Beach conjecture, Trajectory databases: data models, uncertainty and complete query languages, Unnamed Item, A collapse result for constraint queries over structures of small degree, Definability with a predicate for a semi-linear set, \(N\)-dimensional versus \((N-1)\)-dimensional connectivity testing of first-order queries to semi-algebraic sets, On the orthographic dimension of definable sets, First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries, Quantifier elimination for elementary geometry and elementary affine geometry, Logic programming with infinite sets
