1300 search results - page 125 / 260 » Probabilistic logic with independence |
CC
2007
Springer
13 years 9 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
ICCAD
2005
IEEE
14 years 5 months ago
2005
IEEE
: Double-Gate (DG) transistors have emerged as promising devices for nano-scale circuits due to their better scalability compared to bulk CMOS. Among the various types of DG device...
AAAI
2007
13 years 11 months ago
2007
Agents’ pro attitudes such as goals, intentions, desires, wishes, and judgements of satisfactoriness play an important role in how agents act rationally. To provide a natural an...
ICTAI
2007
IEEE
14 years 3 months ago
2007
IEEE
We review a method of generating logical rules, or axioms, from empirical data. This method, using closed set properties of formal concept analysis, has been previously described ...
SEMWEB
2007
Springer
14 years 3 months ago
2007
Springer
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. As a solution we will combine fuzzy Description Logics with a possibilistic layer....