Sciweavers

16 search results - page 1 / 4
» The first-order theory of subtyping constraints
Sort
View
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
13 years 8 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
CORR
2004
Springer
176views Education» more  CORR 2004»
13 years 4 months ago
The First-Order Theory of Sets with Cardinality Constraints is Decidable
Data structures often use an integer variable to keep track of the number of elements they store. An invariant of such data structure is that the value of the integer variable is ...
Viktor Kuncak, Martin C. Rinard
LICS
1998
IEEE
13 years 8 months ago
The First-Order Theory of Ordering Constraints over Feature Trees
Martin Müller, Joachim Niehren, Ralf Treinen
MP
2008
137views more  MP 2008»
13 years 4 months ago
Valid inequalities and restrictions for stochastic programming problems with first order stochastic dominance constraints
Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into...
Nilay Noyan, Andrzej Ruszczynski