Show simple item record  

dc.contributor.authorCleary, John G.
dc.contributor.authorOlthof, Ian
dc.date.accessioned2016-02-24T23:51:49Z
dc.date.available2016-02-24T23:51:49Z
dc.date.issued1993-10
dc.identifier.citationCleary, J.G. & Olthof, I. (1993). The design of an optimistic AND-parallel Prolog (Working paper 93/6). Hamilton, New Zealand: University of Waikato, Department of Computer Science.en_NZ
dc.identifier.issn1170-487X
dc.identifier.urihttps://hdl.handle.net/10289/9962
dc.description.abstractA distributed AND-parallel Prolog implementation is described. The system can correctly handle all pure Prolog programs. In particular, it deals with the problem of distributed backtracking. Conflicts in variable bindings are resolved by assigning a time value to every unification. Bindings with smaller time values are given precedence over those with larger time values. The algorithm is based on the optimistic Time Warp system, with Prolog-specific optimizations. The optimizations include two new unification algorithms that permit unification and backtracking in any order. The result is a system which can fully exploit the parallelism available in both dependent and independent AND-parallelism.en_NZ
dc.format.mimetypeapplication/pdf
dc.language.isoenen_NZ
dc.publisherUniversity of Waikato, Department of Computer Scienceen_NZ
dc.relation.ispartofseriesComputer Science Working Papersen_NZ
dc.rights©1993 John G. Cleary and Ian Olthof.en_NZ
dc.subjectComputer Scienceen_NZ
dc.titleThe design of an optimistic AND-parallel Prologen_NZ
dc.typeWorking Paperen_NZ
uow.relation.series93/6en_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record