Full Idea
We can think of an 'ordinal ranking function' κ([φ)] as the level of surprise we would face were φ to hold, up to maximal surprise.
Gist of Idea
We can rank a formula by the level of surprise if it were to hold
Source
G. Aldo Antonelli (Non-Monotonic Logic [2014], 3.5.2)
Book Reference
'Stanford Online Encyclopaedia of Philosophy', ed/tr. Stanford University [plato.stanford.edu], p.19
A Reaction
This suggests that Bayes's Theorem might be relevant to non-monotonic logic. This suggests that registering surprise would need to be an important feature of robot behaviour.