Sciweavers

179 search results - page 4 / 36
» Fixed-Point Query Languages for Linear Constraint Databases
Sort
View
CORR
2010
Springer
173views Education» more  CORR 2010»
13 years 5 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux
SEBD
2001
145views Database» more  SEBD 2001»
13 years 7 months ago
Reasoning over Conceptual Schemas and Queries in Temporal Databases
This paper introduces a new logical formalism, intended for temporal conceptual modelling, as a natural combination of the well-known description logic DLR and point-based linear ...
Alessandro Artale, Enrico Franconi, Milenko Mosuro...
ADBIS
2008
Springer
117views Database» more  ADBIS 2008»
13 years 7 months ago
Reclassification of Linearly Classified Data Using Constraint Databases
In many problems the raw data is already classified according to a variety of features using some linear classification algorithm but needs to be reclassified. We introduce a novel...
Peter Z. Revesz, Thomas Triplet
ICDT
1995
ACM
105views Database» more  ICDT 1995»
13 years 9 months ago
Datalog Queries of Set Constraint Databases
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
Peter Z. Revesz
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
13 years 9 months ago
Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
Peter Z. Revesz