An Implementation Of A Set Mode For Prolog On A Parallell Associative Processor

Abstract

This paper investigates the implementation of a set mode for Prolog on an associative computer. The main data type in Prolog is the list, which is processed sequentially. However, sets provide a programming paradigm more suited for an associative machine. Current attempts to incorporate sets into the Prolog language are first examined. An execution scheme for associative processors is then introduced. A possible implementation on the Associative String Processor (ASP) is then described.Results for the Nqueens problem are then presented and compared to those of other implementations of Prolo,p.