Xiao, ZhongeCleary, JohnUnger, Brian W2008-02-272008-02-271998-07-01http://hdl.handle.net/1880/45845This is the third report on "Time-ordered Forward Deduction" algorithm for Starlog. The negation evaluation part of the algorithm has been modified extensively based on experiments with previous implementations and further study. The new algorithm is optimistic in terms of its negation evaluation strategy. The notion of \fBOpen Tuple\fR and related \fBNegation Failure Bound Splitting (NFBS)\fR method are introduced. A complete definition of the new algorithm is given, it treats the execution of a program in a more consistent and uniform manner and does not involve any semantic aspects of a program. It is our belief that a formal proof of the algorithm is not too difficult.EngComputer Scienceunknown1998-627-1810.11575/PRISM/30560