Time-ordered forward deduction with negation evaluation strategy revised

Simple item page
dc.contributor.authorXiao, Zhongeeng
dc.contributor.authorCleary, Johneng
dc.contributor.authorUnger, Brian Weng
dc.date.accessioned2008-02-27T16:58:25Z
dc.date.available2008-02-27T16:58:25Z
dc.date.computerscience1999-05-27eng
dc.date.issued1998-07-01eng
dc.description.abstractThis 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.eng
dc.identifier.department1998-627-18eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30560
dc.identifier.urihttp://hdl.handle.net/1880/45845
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleTime-ordered forward deduction with negation evaluation strategy revisedeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
1998-627-18.pdf.gz
Size:
63.17 KB
Format:
Unknown data format
Download
No Thumbnail Available
Name:
1998-627-18.ps.gz
Size:
45.97 KB
Format:
Unknown data format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications