Presentation 1995/8/22
On Cooperative Search in Logic Programming
Neng-Fa Zhou, Chao Zeng,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) 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.
Keyword(in Japanese) (See Japanese page)
Keyword(in English)
Paper #
Date of Issue

Conference Information
Committee AI
Conference Date 1995/8/22(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Artificial Intelligence and Knowledge-Based Processing (AI)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On Cooperative Search in Logic Programming
Sub Title (in English)
Keyword(1)
1st Author's Name Neng-Fa Zhou
1st Author's Affiliation Faculty of Computer Science and Systems Engineering Kyushu Institute of Technology()
2nd Author's Name Chao Zeng
2nd Author's Affiliation Department of Electronics and Information Systems Fukuoka Junior College of Technology
Date 1995/8/22
Paper #
Volume (vol) vol.95
Number (no) 211
Page pp.pp.-
#Pages 7
Date of Issue