Sciweavers

33 search results - page 5 / 7
» Algorithms for Propositional KB Approximation
Sort
View
IJCAI
1989
13 years 10 months ago
Maximum Entropy in Nilsson's Probabilistic Logic
Nilsson's Probabilistic Logic is a set theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the fram...
Thomas B. Kane
SDM
2008
SIAM
147views Data Mining» more  SDM 2008»
13 years 10 months ago
The Asymmetric Approximate Anytime Join: A New Primitive with Applications to Data Mining
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
Lexiang Ye, Xiaoyue Wang, Dragomir Yankov, Eamonn ...
ICDCS
2010
IEEE
14 years 1 months ago
Adam2: Reliable Distribution Estimation in Decentralised Environments
Abstract—To enable decentralised actions in very large distributed systems, it is often important to provide the nodes with global knowledge about the values of attributes across...
Jan Sacha, Jeff Napper, Corina Stratan, Guillaume ...
ICCAD
2002
IEEE
142views Hardware» more  ICCAD 2002»
14 years 6 months ago
SAT and ATPG: Boolean engines for formal hardware verification
In this survey, we outline basic SAT- and ATPGprocedures as well as their applications in formal hardware verification. We attempt to give the reader a trace trough literature and...
Armin Biere, Wolfgang Kunz
KSEM
2009
Springer
14 years 3 months ago
An Anytime Algorithm for Computing Inconsistency Measurement
Measuring the inconsistency degree of an inconsistent knowledge base is an important problem as it provides context information for facilitating inconsistency handling. Many method...
Yue Ma, Guilin Qi, Guohui Xiao, Pascal Hitzler, Zu...