On Cooperative Search in Logic Programming

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, we describe an execution model for executing in parallel search programs in logic programming languages and propose three scheduling strategies, namely, full breadth-first, partial breadth-first, and depth-first. This model divides the search space among the participating machines, but requires neither communication nor dynamic copy. All machines start executing the same program independently until branches in the search tree are encountered. In that case, they determine which branches to explore. We investigate the three scheduling strategies and discuss their advantages and disadvantages. We also evaluate the scheduling strategies experimentally for two problems : N-queens and the blocks world problem.

• 一般社団法人電子情報通信学会の論文
• 1995-08-22

著者

• Zhou Neng-fa

  Faculty Of Computer Science And Systems Engineering Kyushu Institute Of Technology

• Zeng Chao

  Department of Electronics and Information Systems Fukuoka Junior College of Technology

関連論文

• An Efficient Finite-Domain Constraint Solver in Beta-Prolog
• On Cooperative Search in Logic Programming

スポンサーリンク