In my thesis, I present problems and techniques in tabling Transaction Logic (TR). TR is an extension of classical logic programming with backtrackable state updates and it has a top-down evaluation algorithm similar to Prolog's SLD derivation extended with execution paths of states ...
Paul Fodor hasn't uploaded this paper.
Create a free Academia account to let Paul know you want this paper to be uploaded.
