That's an axiom.

So here's one example of a successor state axiom.

I'll show you the possibility axiom for the Fly action.

For example, I'll show you the successor state axiom for the In predicate.

One choice is the possibility axiom that says if C equals X, then it's possible to dial C in situation S.

So next, the scientific method an axiom of physics, of all science says you cannot prove a hypothesis through observation, you can only disprove it.

Instead of writing 1 action or 1 schema or 1 axiom for each action, we do 1 for each fluent, for each predicate that can change.

The other possible axiom is for all C if C is greater than or equal to 0 and less than or equal to 9999, then it's possible to dial C in any situation S.

I don't want you to look at any combinations of axioms but just go through each one and check the box if you think that the axiom on that line alone is a correct representation of the problem.

And in general, a successor state axiom will have the form of saying for all actions and states, if it's possible to execute action A in state S, then and I'll show in general what they look like here the fluent is true if and only if action A made it true or action A didn't undo it.