75 search results - page 5 / 15 » Jeffrey's rule of conditioning generalized to belief functio... |
ISIPTA
2005
IEEE
15 years 5 months ago
2005
IEEE
This paper addresses the following question: how should we update our beliefs after observing some incomplete data, in order to make credible predictions about new, and possibly i...
100
click to vote
NIPS
1998
15 years 28 days ago
1998
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
AAAI
2000
15 years 28 days ago
2000
We present a general, consistency-based framework for belief change. Informally, in revising K by , we begin with and incorporate as much of K as consistently possible. Formally, ...
77
Voted
ECAI
1992
Springer
15 years 3 months ago
1992
Springer
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
101
click to vote
ATAL
2011
Springer
13 years 11 months ago
2011
Springer
Proper scoring rules, particularly when used as the basis for a prediction market, are powerful tools for eliciting and aggregating beliefs about events such as the likely outcome...