Ranked programming: Probabilistic programming without probabilities
&gt; Our work is based on the idea that ranking theory can be used as a general tool -- like probability theory -- to build arbitrary models involving uncertainty.<p>Why would I believe that?  What benefit does calculating these &quot;degrees of surprise&quot; give?<p>Compare with probability theory which has done an outstanding job at providing quantitative answers to questions in an uncertain context.