1778 search results - page 94 / 356 » The Theory of Probabilistic Databases |
162
click to vote
UAI
2003
15 years 7 months ago
2003
Abstract. In Datalog, missing values are represented by Skolem constants. More generally, in logic programming missing values, or existentially quantified variables, are represent...
183
click to vote
INFORMATICALT
2008
15 years 6 months ago
2008
Abstract. The study of databases began with the design of efficient storage and data sharing techniques for large amount of data. This paper concerns the processing of imprecision ...
159
click to vote
HICSS
2008
IEEE
16 years 18 days ago
2008
IEEE
Architecting security solutions for today’s diverse computer systems is a challenge. The modern business environment is comprised of many different applications, e-mail, databas...
159
click to vote
ICAIL
2003
ACM
15 years 11 months ago
2003
ACM
Defeasible Logic is a promising representation for legal knowledge that appears to overcome many of the deficiencies of previous approaches to representing legal knowledge. Unfor...
157
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...