Please use this identifier to cite or link to this item:
Authors: Olthof, Ian
Cleary, John G.
Keywords: Computer Science
Issue Date: 1-Jul-1992
Abstract: Two algorithms for order-independent unification are presented. Both assume that unifications are timestamped, giving a natural ordering on unifications from lowest timestamp to highest. The first algorithm permits lower-timestamped unifications to be performed after higher-timestamped unifications have already been done, without requiring previous unifications to be backtracked and later redone. The binding state that results is indistinguishable from that produced by a lowest-to-highest execution. The second algorithm extends the first by allowing intermediate unifications to be undone, again avoiding work in undoing and redoing unifications with higher timestamps. These algorithms are designed for distributed, fully AND-parallel Prolog execution; asynchronous events occurring on different CPSs can be reconciled without too much overhead.
Appears in Collections:Cleary, John

Files in This Item:
File Description SizeFormat 
1992-472-10.pdf2.19 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.