Sciweavers

1300 search results - page 169 / 260
» Probabilistic logic with independence
Sort
View
DEBU
2008
156views more  DEBU 2008»
13 years 7 months ago
Towards Automatic Test Database Generation
Testing is one of the most expensive and time consuming activities in the software development cycle. In order to reduce the cost and the time to market, many approaches to automa...
Carsten Binnig, Donald Kossmann, Eric Lo
AML
2006
83views more  AML 2006»
13 years 7 months ago
The Medvedev lattice of computably closed sets
Simpson introduced the lattice P of 0 1 classes under Medvedev reducibility. Questions regarding completeness in P are related to questions about measure and randomness. We presen...
Sebastiaan Terwijn
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 7 months ago
Conflict Free Rule for Combining Evidences
: Recent works have investigated the problem of the conflict redistribution in the fusion rules of evidence theories. As a consequence of these works, many new rules have been prop...
Frédéric Dambreville
IPL
2010
95views more  IPL 2010»
13 years 6 months ago
Resource bisimilarity and graded bisimilarity coincide
Resource bisimilarity has been proposed in the literature on concurrency theory as a notion of bisimilarity over labeled transition systems that takes into account the number of c...
Luca Aceto, Anna Ingólfsdóttir, Josh...
SLOGICA
2010
138views more  SLOGICA 2010»
13 years 6 months ago
Extensionality and Restriction in Naive Set Theory
Abstract. The naive set theory problem is to begin with a full comprehension axiom, and to find a logic strong enough to prove theorems, but weak enough not to prove everything. T...
Zach Weber