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

dc.contributor.author	Xiao, Zhonge	eng
dc.contributor.author	Cleary, John	eng
dc.contributor.author	Unger, Brian W	eng
dc.date.accessioned	2008-02-27T16:58:16Z
dc.date.available	2008-02-27T16:58:16Z
dc.date.computerscience	1999-05-27	eng
dc.date.issued	1998-07-01	eng
dc.description.abstract	Starlog, 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.department	1998-625-16	eng
dc.identifier.doi	http://dx.doi.org/10.11575/PRISM/30559
dc.identifier.uri	http://hdl.handle.net/1880/45843
dc.language.iso	Eng	eng
dc.publisher.corporate	University of Calgary	eng
dc.publisher.faculty	Science	eng
dc.subject	Computer Science	eng
dc.title	Time-ordered forward deduction a bottom-up evaluation strategy for Starlog	eng
dc.type	unknown
thesis.degree.discipline	Computer Science	eng