Can I solve conflict logic by time order in prolog?

Hello, I've a very long trouble with Prolog dealing with a conflict
resolution system.
And I'm a really prolog newbie.

I want to ask "Can Prolog describe a conflict logic caused by time
order and have a way to solve it?", Thanks for help.

Concrete problem: let A, B, C all have F, T(two states), and they
follow rules like below:
A(F) :- B(T), C(T). if T(b) and T(c) then F(a)
C(F) :- B(T), A(T). if T(b) and T(a) then F(c)

Suppose now that C and A has state T, and B has state F. and when I
change state B to T. And I want to ask whether A has F or C has F.
How can I know which will have state F in prolog?

Thanks for help.