On a Tabling Engine That Can Exploit Or-Parallelism

Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing solutions to goals. Quite a few interesting applications of tabling have been developed in the last few years, and several are by nature non-deterministic. This raises the question of whether parallel search techniques can be used to improve the performance of tabled applications. In this work we demonstrate that the mechanisms proposed to parallelize search in the context of SLD resolution naturally generalize to parallel tabled computations, and that resulting systems can achieve good performance on multi-processors. To do so, we present the OPTYap parallel engine. In our system individual SLG engines communicate data through stack copying. Completion is detected through a novel parallel completion algorithm that builds upon the data structures proposed for or-parallelism. Scheduling is simplified by building on previous research on or-parallelism. We show initial perform...

• Type: Conference
• Year: 2001
• Where: ICLP
• Authors: Ricardo Rocha, Fernando M. A. Silva, Vítor Santos Costa
• Keywords: Automated Reasoning, ICLP 2001, OPTYap Parallel Engine, Parallel Completion Algorithm, Parallel Search Techniques