检索结果-内蒙古大学图书馆

PATH FOR AND-parallel EXECUTION OF logic programs

INFORMATION PROCESSING LETTERS 1994年第4期52卷 191-199页

作者： LEE, SH KIM, DH CHOE, KM SUNGSHIN WOMENS UNIV DEPT COMP SCISEOUL 136742SOUTH KOREA

An efficient backward execution method for AND-parallelism in logic programs is proposed. It is devised through a close examination of some relation over literals, which can be represented by paths in the data dependency graphs. The scheme is more efficient than other works in the sense that it performs less unfruitful resetting (and consequently, canceling) operations. Its rationale is also intuitively clear and natural. Furthermore, the relevant analyses needed for the proposal are largely achieved at compile time, which alludes to actual efficiency.

关键词： APPLICATIVE (logic) PROGRAMMING parallel evaluation of logic programs AND/OR PROCESS MODEL AND parallelISM DATA DEPENDENCY GRAPH PATH

来源：评论

学校读者我要写书评

暂无评论

YET ANOTHER EFFICIENT BACKWARD EXECUTION ALGORITHM IN THE AND OR PROCESS MODEL

引用

INFORMATION PROCESSING LETTERS 1991年第4期40卷 201-211页

作者： KIM, DH CHOE, KM Programming Languages Laboratory Department of Computer Science Korea Advanced Institute of Science and Technology 371-1 Kusong-Dong Yusang-Gu Taejon 305-701 South Korea

An efficient backward execution algorithm in the AND/OR Process Model for parallel evaluation of logic programs is proposed. The efficiency of the algorithm is achieved by means of information acquired during execution of clauses. The algorithm is considered to be efficient in the sense that it issues fewer number of cancel messages and avoids unnecessary resetting operations. Furthermore, it performs independent redoing and resetting more concurrently than other related works.

关键词： APPLICATIVE (logic) PROGRAMMING parallel evaluation of logic programs AND OR PROCESS MODEL AND parallelISM BACKWARD EXECUTION ALGORITHM MULTIPLE FAILURE SELECTIVE RESETTING

来源：评论

学校读者我要写书评

暂无评论

REFINED MARK(S)-SET-BASED BACKTRACK LITERAL SELECTION FOR AND parallelISM IN logic programs

引用

parallel Processing Letters 1992年第1期2卷 71-79页

作者： DO-HYUNG KIM KWANG-MOO CHOE TAISOOK HAN Department of Computer Science Korea Advanced Institute of Science and Technology 373-1 Kusung-Dong Yusung-Gu Taejon 305-701 Republic of Korea

Recently Conery proposed a backward execution algorithm for AND-parallel execution of logic programs, and Ng and Leung extended it. They adopt the same data structure called mark(s) set to store information about failure history during AND-parallel evaluation of clauses. Both of the two algorithms essentially have the same rationale with minor differences and have been considered correct, largely due to their intuitive persuasiveness. We closely re-examine those algorithms and find out that they are incorrect. Their incorrectness comes from oversimplification of failure situations. Our analyses focused on the mark(s)-set-based backtrack literal selection are presented. We also propose another backtrack literal selection method based on the mark(s) set, and prove its correctness.

关键词： parallel evaluation of logic programs AND parallelism AND/OR Process Model Competition Model backward execution algorithm mark(s) set

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：