An overview of the PRISM project

Kohli, Madhur; Giuliano, Mark; Minker, Jack

doi:10.1145/25372.25376

Cited by 5 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Parallel processing of logic programming language Pro log has recently received considerable attention for its application to the field of artificial intelligence [1, 3,4,7,13,15,16,17,20,21,22].…”

Section: Introductionmentioning

confidence: 99%

Pipelined OR-parallelism architecture for parallel execution of Prolog

Sarma

1990

Proceedings of the Third International Conference on Industrial and Engineering Applications of Artificial Intelligence and Exp

View full text Add to dashboard Cite

This paper describes a parallel architecture to implement PROLOG. The architecture considered here takes advantage of the OR-parallelism inherent in the language. In usual OR-parallelism architecture, multiprocessors are used to work on a relation of the database at the same time. In the pipeline OR-parallelism, a relation of the database is processed by only one of the multiprocessors at one time. As soon as a solution is found, the resolution goes forward and works on the goal down the goal tree. A hardware model is derived based on the concept and simulation studies were carried out for different numbers of processor configurations.It has been found that from the results of the simulation optimum processor configurations can be derived to meet the cost performance requirements.

show abstract

Section: Introductionmentioning

confidence: 99%

Pipelined OR-parallelism architecture for parallel execution of Prolog

Sarma

1990

Proceedings of the Third International Conference on Industrial and Engineering Applications of Artificial Intelligence and Exp

View full text Add to dashboard Cite

show abstract

“…This differs from most F'rolog implementations, usually there is no distinction. However, the PRISM system [7], separates the fact database from the rule database. The execution of a program consists of rules operating on a database of facts.…”

Section: : a Set Based Execution Schemementioning

confidence: 99%

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

Rodohan¹,

Glover²,

Jalowiecki³

Proceedings. Second Euromicro Workshop on Parallel and Distributed Processing

View full text Add to dashboard Cite

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.

show abstract