I think you misunderstood. The robot has a real number p(v) for every v. Let’s grant an absolute min and max of 0 and 1. My point was simply that when p(v)=0 or p(v)=1, v can be simplified out of propositions using it.
I understand why computing the probability of a proposition implies answering whether it’s satisfiable.
I think you misunderstood. The robot has a real number p(v) for every v. Let’s grant an absolute min and max of 0 and 1. My point was simply that when p(v)=0 or p(v)=1, v can be simplified out of propositions using it.
I understand why computing the probability of a proposition implies answering whether it’s satisfiable.
Sorry for the confusion. I was very superficial. Of course, your are correct about being able to simplify out those values.