Time-ordered forward deduction a bottom-up evaluation strategy for Starlog

Simple item page
dc.contributor.authorXiao, Zhongeeng
dc.contributor.authorCleary, Johneng
dc.contributor.authorUnger, Brian Weng
dc.date.accessioned2008-02-27T16:58:16Z
dc.date.available2008-02-27T16:58:16Z
dc.date.computerscience1999-05-27eng
dc.date.issued1998-07-01eng
dc.description.abstractStarlog, a Horn clause logic programming language, allows for time stamps, interval arithmetic, and negations. A bottom-up evaluation strategy, called "Time-ordered Forward Deduction", for the language is described. The algorithm heavily relies on time stratification as its basic execution control mechanism. A conservative approach has been adopted to handle negations, which defers the evaluation of negations until it is safe to do so. Various techniques to deal with subtle cases of inter-clause relations in negation evaluation are discussed. To illustrate the algorithm, some simple but non-trivial example programs are presented.eng
dc.identifier.department1998-625-16eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/30559
dc.identifier.urihttp://hdl.handle.net/1880/45843
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleTime-ordered forward deduction a bottom-up evaluation strategy for Starlogeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 2 of 2
No Thumbnail Available
Name:
1998-625-16.pdf.gz
Size:
95.37 KB
Format:
Unknown data format
Download
No Thumbnail Available
Name:
1998-625-16.ps.gz
Size:
68.19 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