Rule trees an execution mechanism for time-ordered forward deduction evaluating strategy of Starlog

Simple item page
dc.contributor.authorXiao, Zhongeeng
dc.contributor.authorCleary, Johneng
dc.contributor.authorUnger, Brian Weng
dc.date.accessioned2008-02-27T16:58:20Z
dc.date.available2008-02-27T16:58:20Z
dc.date.computerscience1999-05-27eng
dc.date.issued1998-07-01eng
dc.description.abstractThis is the second report on "Time-ordered Forward Deduction" algorithm for Starlog. A \fBRule Tree (R-tree)\fR structure is discussed. The R-tree is used to represent a program rule in the dynamic process of program execution. It serves not only as a structured data storage for program rules and their derivable instances, but also as a control structure in program execution which allows the execution to be carried out in more orderly and formal manner.eng
dc.identifier.department1998-626-17eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30555
dc.identifier.urihttp://hdl.handle.net/1880/45844
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleRule trees an execution mechanism for time-ordered forward deduction evaluating strategy of Starlogeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
1998-626-17.pdf.gz
Size:
60.42 KB
Format:
Unknown data format
Download
No Thumbnail Available
Name:
1998-626-17.ps.gz
Size:
44.52 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