A Symbolic Finite State Approach to Automated Theorem Proving
Filed under:
TALK
Dr. Thotsaporn Thanatipanonda (Bangkok University), 15 December, 2 p.m., RISC seminar room
A Symbolic Finite State Approach to Automated Theorem Proving
Sometimes it is easier to prove more theorems than just one. This turns out to be the case here. We will use a Finite-State Approach to show values of positions in some examples of combinatorial games.