1300 search results - page 47 / 260 » Probabilistic logic with independence |
136
click to vote
IANDC
2006
15 years 4 months ago
2006
We propose a modular approach to defining notions of simulation, and modal logics which characterise them. We use coalgebras to model state-based systems, relators to define notio...
125
click to vote
SC
2003
ACM
15 years 9 months ago
2003
ACM
We present a new adaptive fast multipole algorithm and its parallel implementation. The algorithm is kernel-independent in the sense that the evaluation of pairwise interactions do...
199
click to vote
MLG
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We revisit an application developed originally using Inductive Logic Programming (ILP) by replacing the underlying Logic Program (LP) description with Stochastic Logic Pr...
163
click to vote
TARK
2007
Springer
15 years 10 months ago
2007
Springer
We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability, introducing discrete conditional probabilistic models for (multi-agent) knowledge...
214
click to vote
CALCO
2011
Springer
14 years 4 months ago
2011
Springer
Fusion is arguably the simplest way to combine modal logics. For normal modal logics with Kripke semantics, many properties such as completeness and decidability are known to trans...