Sciweavers

1778 search results - page 43 / 356
» The Theory of Probabilistic Databases
Sort
View
ADBIS
2004
Springer
193views Database» more  ADBIS 2004»
14 years 27 days 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
CALCO
2009
Springer
150views Mathematics» more  CALCO 2009»
14 years 3 months ago
Approximating Labelled Markov Processes Again!
Abstract. Labelled Markov processes are continuous-state fully probabilistic labelled transition systems. They can be seen as co-algebras of a suitable monad on the category of mea...
Philippe Chaput, Vincent Danos, Prakash Panangaden...
MSS
2008
IEEE
112views Hardware» more  MSS 2008»
13 years 9 months ago
Axiomatization of stochastic models for choice under uncertainty
: This paper develops a theory of probabilistic models for risky choices. Part of this theory can be viewed as an extension of the expected utility theory to account for bounded ra...
John K. Dagsvik
AIME
2003
Springer
14 years 2 months ago
Multi-relational Data Mining in Medical Databases
Abstract. This paper presents the application of a method for mining data in a multi-relational database that contains some information about patients strucked down by chronic hepa...
Amaury Habrard, Marc Bernard, François Jacq...
FSTTCS
2004
Springer
14 years 2 months ago
Verifying Probabilistic Procedural Programs
Abstract. Monolithic finite-state probabilistic programs have been abstractly modeled by finite Markov chains, and the algorithmic verification problems for them have been inves...
Javier Esparza, Kousha Etessami