Sciweavers

80 search results - page 2 / 16
» On the Representation and Management of Finite Sets in CLP L...
Sort
View
ICDT
2007
ACM
74views Database» more  ICDT 2007»
13 years 9 months ago
World-Set Decompositions: Expressiveness and Efficient Algorithms
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage ...
Lyublena Antova, Christoph Koch, Dan Olteanu
JSYML
2008
74views more  JSYML 2008»
13 years 5 months ago
Omitting types for finite variable fragments and complete representations of algebras
. We give a novel application of algebraic logic to first order logic. A new, flexible construction is presented for representable but not completely representable atomic relation ...
Tarek Sayed Ahmed, Hajnal Andréka, Istv&aac...
CORR
2008
Springer
103views Education» more  CORR 2008»
13 years 5 months ago
Executable Set Theory and Arithmetic Encodings in Prolog
The paper is organized as a self-contained literate Prolog program that implements elements of an executable finite set theory with focus on combinatorial generation and arithmetic...
Paul Tarau
AAAI
2000
13 years 6 months ago
Semantics and Inference for Recursive Probability Models
In recent years, there have been several proposals that extend the expressive power of Bayesian networks with that of relational models. These languages open the possibility for t...
Avi Pfeffer, Daphne Koller
CORR
2006
Springer
125views Education» more  CORR 2006»
13 years 5 months ago
10^(10^6) Worlds and Beyond: Efficient Representation and Processing of Incomplete Information
We present a decomposition-based approach to managing probabilistic information. We introduce world-set decompositions (WSDs), a space-efficient and complete representation system ...
Lyublena Antova, Christoph Koch, Dan Olteanu