Personal tools
You are here: Home / Events / 2010 / A Symbolic Finite State Approach to Automated Theorem Proving

A Symbolic Finite State Approach to Automated Theorem Proving

Filed under:
Dr. Thotsaporn Thanatipanonda (Bangkok University), 15 December, 2 p.m., RISC seminar room
When Dec 15, 2010
from 02:00 PM to 03:30 PM
Where RISC seminar room
Add event to calendar vCal
iCal

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.