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

An experiment for truly parallel logic programming

JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS 1996年第2期16卷 169-184页

作者： Efthivoulidis, G Vlassis, N Tsanakas, P Papakonstantinou, G Department of Electrical and Computer Engineering National Technical University of Athens Zografou Campus GR-15773 Athens Greece

A truly parallel logic programming system is proposed. The system is based on the commercially available parallel logic programming language STRAND, which has been extended in order to overcome the inherent limitations of such systems, like AND-type of parallelism, lack of backtracking, limited unification, etc. The system has been tested using an example from the area of natural language processing.

关键词： parallel logic programming STRAND language natural language processing

来源：评论

学校读者我要写书评

暂无评论

Proving termination of GHC programs

引用

NEW GENERATION COMPUTING 1997年第3期15卷 293-338页

作者： Rao, MRKK Kapur, D Shyamasundar, RK TATA INST FUNDAMENTAL RES COMP SCI GRPBOMBAY 400005MAHARASHTRAINDIA SUNY ALBANY DEPT COMP SCIALBANYNY 12222

A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation from GHC programs to term rewriting systems is developed;it exploits the fact that unifications in GHC-resolution correspond to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite system. This approach facilitates the applicability of a wide range of termination techniques developed for rewrite systems in proving termination of GHC programs. The method consists of three steps: (a) deriving moding information from a given GHC program, (b) transforming the GHC program into a term rewriting system using the moding information, and finally (c) proving termination of the resulting rewrite system. Using this method, the termination of many benchmark GHC programs such as quick-sort, merge-sort, merge, split, fair-split and append, etc., can be proved.

关键词： parallel logic programming verification termination

来源：评论

学校读者我要写书评

暂无评论

Relating data-parallelism and (and-) parallelism in logic programs

引用

COMPUTER LANGUAGES 1996年第2-3期22卷 143-163页

作者： Hermenegildo, MV Carro, M UNIV POLITECN MADRID FAC INFORMAT BOADILLA DEL MONTE 28660 MADRID SPAIN

Much work has been done in the areas of and-parallelism and data-parallelism in logic Programs. Such work has proceeded to a certain extent in an independent fashion. Both types of parallelism offer advantages and disadvantages. Traditional (and-) parallel models offer generality, being able to exploit parallelism in a large class of programs (including that exploited by data-parallelism techniques). Data-parallelism techniques on the other hand offer increased performance for a restricted class of programs. The thesis of this paper is that these two forms of parallelism are not fundamentally different and that relating them opens the possibility of obtaining the advantages of both within the same system. Some relevant issues are discussed and solutions proposed. The discussion is illustrated through visualizations of actual parallel executions implementing the ideas proposed. Copyright (C) 1996 Elsevier Science Ltd

关键词： parallel logic programming and-parallelism data-parallelism fast task startup scheduling

来源：评论

学校读者我要写书评

暂无评论

Nested parallel call optimization

Nested parallel call optimization

引用

10th International parallel Processing Symposium (IPPS 96)

作者： Pontelli, E Gupta, G NEW MEXICO STATE UNIV LAB LOG DATABASES & ADV PROGRAMMINGLAS CRUCESNM 88003

ISBN: (纸本)0818672552

We present a novel optimization called Last parallel Call Optimization (LPCO) for parallel systems. The last parallel call optimization can be regarded as a parallel extension of last call optimization found in sequential systems. While the LPCO is fairly general, we use and-parallel logic programming systems to illustrate it and to report its performance on multiprocessor systems. The last parallel call optimization leads to improved time and space performance for a majority of and-parallel programs. We also present a generalization of the Last parallel Call Optimization called Nested parallel Call Optimization (NPCO). A major advantage of LPCO and NPCO is that parallel systems designed for exploiting control parallelism can automatically exploit data parallelism efficiently.

关键词： implementation optimizations parallel logic programming and-parallelism

来源：评论

学校读者我要写书评

暂无评论

OPTIMAL IMPLEMENTATION OF AND-OR-parallel-PROLOG

引用

FUTURE GENERATION COMPUTER SYSTEMS 1994年第1期10卷 71-92页

作者： GUPTA, G COSTA, VS UNIV BRISTOL DEPT COMP SCIBRISTOL BS8 1TRAVONENGLAND

Most models that have been proposed, or implemented, so far for exploiting both or-parallelism and independent and-parallelism have only considered pure logic programs (pure Prolog). We present an abstract model, called the Composition-Tree, for representing and-or parallelism in full Prolog. The Composition-Tree recomputes independent goals to ensure that Prolog semantics is preserved. We combine the idea of Composition-Tree with ideas developed earlier, to develop an abstract execution model that supports full Prolog semantics while at the same time avoiding redundant inferences when computing solutions to (purely) independent and-parallel goals. This is accomplished by sharing solutions of independent goals when they are pure (i.e. have no side-effects or cuts in them). The Binding Array scheme is extended for and-or parallel execution based on this abstract execution model. This extension enables the Binding Array scheme to support or-parallelism in the presence of independent and-parallelism, both when solutions to independent goals are recomputed as well as when they are shared. We show how extra-logical predicates, such as cuts and side-effects, are supported in this model.

关键词： parallel logic programming OR-parallelISM AND-parallelISM GOAL RECOMPUTATION GOAL REUSE ENVIRONMENT REPRESENTATION PAGED BINDING ARRAYS

来源：评论

学校读者我要写书评

暂无评论

NEGATION IN CONCLOG 1st

NEGATION IN CONCLOG

引用

1ST INTERNATIONAL CONF ON parallel COMPUTATION

作者： JACQUET, JM CTR MATH & COMP SCI 1009 AB AMSTERDAMNETHERLANDS

ISBN: (纸本)9783540554370

This paper presents a new constructive form of the negation-as-failure rule dedicated to concurrent executions and, based on it, a parallel execution model of general Horn clauses. Referring to the completion understanding of the programs, this model has been proved sound and as complete as possible when the resolution rule and the negation-as-failure rule are used. Furthermore, it does not suffer from the floundering problem : in contrast, negative literals can be used to produce computed answers as the positive literals can. This new form of negation is based on an equational framework. It introduces generalizations of substitutions, terms and related concepts of instantiation and unification. A theory of such concepts is also presented in the paper.

关键词： CONSTRUCTIVE NEGATION parallel logic programming parallel LANGUAGE THEORY OF SUBSTITUTIONS AND TERMS

来源：评论

学校读者我要写书评

暂无评论

A TECHNIQUE FOR RECURSIVE INVARIANCE DETECTION AND SELECTIVE PROGRAM SPECIALIZATION 3rd

A TECHNIQUE FOR RECURSIVE INVARIANCE DETECTION AND SELECTIVE...

引用

3RD INTERNATIONAL SYMP ON programming LANGUAGE IMPLEMENTATION AND logic programming ( PLILP 91 )

作者： GIANNOTTI, F HERMENEGILDO, M CNUCE-CNR Via Santa Maria 36 Pisa 56100 Italy Univ. Politécnica de Madrid (UPM) Facultad de Informática Boadilla del Monte 28660 Madrid Spain

ISBN: (纸本)3540544445

This paper presents a technique for achieving a class of optimizations related to the reduction of checks within cycles. The technique uses both Program Transformation and Abstract Interpretation. After a first pass of an abstract interpreter which detects simple invariants, program transformation is used to build a hypothetical situation that simplifies some predicates that should be executed within the cycle. This transformation implements the heuristic hypothesis that once conditional tests hold they may continue doing so recursively. Specialized versions of predicates are generated to detect and exploit those cases in which the invariance may hold. Abstract interpretation is then used again to verify the truth of such hypotheses and confirm the proposed simplification. This allows optimizations that go beyond those possible with only one pass of the abstract interpreter over the original program, as is normally the case. It also allows selective program specialization using a standard abstract interpreter not specifically designed for this purpose, thus simplifying the design of this already complex module of the compiler. In the paper, a class of programs amenable to such optimization is presented, along with some examples and an evaluation of the proposed techniques in some application areas such as floundering detection and reducing run-time tests in automatic logic program parallelization. The analysis of the examples presented has been performed automatically by an implementation of the technique using existing abstract interpretation and program transformation tools. © Springer-Verlag Berlin Heidelberg 1991.

关键词： logic programming ABSTRACT INTERPRETATION PROGRAM TRANSFORMATION PROGRAM SPECIALIZATION parallel logic programming CYCLE INVARIANT DETECTION COMPILE-TIME OPTIMIZATION

来源：评论

学校读者我要写书评

暂无评论

CARMEL-2 - A 2ND GENERATION VLSI ARCHITECTURE FOR FLAT CONCURRENT PROLOG

引用

NEW GENERATION COMPUTING 1990年第2-3期7卷 197-218页

作者： HARSAT, A GINOSAR, R TECHNION ISRAEL INST TECHNOL DEPT COMP SCIIL-32000 HAIFAISRAEL

CARMEL-2 is a high performance VLSI uniprocessor, tuned forFlat Concurrent Prolog (FCP). CARMEL-2 shows almost 5-fold speedup over its predecessor, CARMEL-1, and it achieves 2,400 KLIPS executingappend. This high execution rate was gained as a result of an optimized design, based on an extensive architecture-oriented execution analysis of FCP, and the lessons learned with CARMEL-1. CARMEL-2 is a RISC processor in its character and performance. The instruction set includes only 29 carefully selected instructions. The 10 special instructions, the prudent implementation and pipeline scheme, as well as sophisticated mechanisms such as intelligent dereference, distinguish CARMEL-2 as a RISC processor for FCP.

关键词： Architecture-Oriented Execution Analysis Flat Concurrent Prolog Intelligent Dereference Modified Memory Interleaving parallel logic programming RISC Single-Cycle Execution Tagged Architecture VLSI

来源：评论

学校读者我要写书评

暂无评论

AN ABSTRACT MACHINE FOR THE IMPLEMENTATION OF PARLOG ON UNIPROCESSORS

引用

NEW GENERATION COMPUTING 1989年第4期6卷 389-420页

作者： GREGORY, S FOSTER, IT BURT, AD RINGWOOD, GA 1. PARLOG Group Department of Computing Imperial College 180 Queen’s Gate SW7 2BZ London England

An abstract machine that supports the parallel logic programming language PARLOG is presented. This abstract machine is designed for the efficient execution of PARLOG on conventional uniprocessors and is thus named the Sequential PARLOG Machine (SPM). The machine’s architecture and instruction set are described and the principles of compilation of PARLOG programs to sequences of abstract machine instructions explained. The machine supports systems programming in PARLOG and in particular PARLOG’s powerful control metacall, which permits programs to initiate, monitor and control subcomputations.

关键词： PARLOG parallel logic programming Implementation Abstract Machines

来源：评论

学校读者我要写书评

暂无评论

A DATA-DRIVEN MODEL FOR A SUBSET OF logic programming

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 1987年第4期9卷 618-645页

作者： BIC, L LEE, C Univ. of California Irvine Univ. of California Irvine

There is a direct correspondence between semantic networks and a subset of logic programs, restricted only to binary predicates. The advantage of the latter is that it can describe not only the nodes and arcs comprising a semantic net, but also the data-retrieval operations applied to such nets. The main objective of this paper is to present a data-driven model of computation that permits this subset of logic programs to be executed on a highly parallel computer architecture. We demonstrate how logic programs may be converted into collections of data-flow graphs in which resolution is viewed as a process of finding matches between certain graph templates and portions of the data-flow graphs. This graph fitting process is carried out by messages propagating asynchronously through the data-flow graph; thus computation is entirely data driven, without the need for any centralized control and centralized memory. This permits a potentially large number of independent processing elements to cooperate in solving a given query.

关键词： Data-driven computation parallel logic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：