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

Continuation compilation for concurrent logic programming

Annual Review in Automatic programming 1994年第C期19卷 299-305页

作者： Kemp, B Soper, P King, A Dept. of Electronics and Computer Science University of Southampton Southampton S09 5NH United Kingdom Computing Laboratory University of Kent at Canterbury Canterbury CT2 7NF United Kingdom

A new and powerful approach to threading is proposed, that is designed to improve the responsiveness of concurrent logic programs for distributed, real-time AI applications. The technique builds on previously proposed scheduling techniques to improve responsiveness by synchronously passing control and data directly from a producer to a consumer. Furthermore, synchronous transfer of data requires less buffering and so less garbage is produced. Arguments are also passed in registers, further reducing overheads. © 1995.

关键词： concurrent logic programming garbage collection program optimisation and abstract interpretation responsiveness

来源：评论

学校读者我要写书评

暂无评论

LMNtal as a hierarchical logic programming language

引用

THEORETICAL COMPUTER SCIENCE 2009年第46期410卷 4784-4800页

作者： Ueda, Kazunori Waseda Univ Dept Comp Sci & Engn Shinjuku Ku Tokyo 1698555 Japan

LMNtal (pronounced "elemental") is a simple language model based on hierarchical graph rewriting that uses logical variables to represent connectivity and membranes to represent hierarchy. LMNtal is an outcome of the attempt to unify constraint based concurrency and Constraint Handling Rules (CHR), the two notable extensions to concurrent logic programming. LMNtal is intended to be a substrate language of various computational models, especially those addressing concurrency, mobility and multiset rewriting. Although the principal objective of LMNtal was to provide a unifying computational model, it is of interest to equip the formalism with a precise logical interpretation. In this paper, we show that it is possible to give LMNtal a simple logical interpretation based on intuitionistic linear logic and a flattening technique. This enables us to call LMNtal a hierarchical, concurrent linear logic language. (C) 2009 Elsevier B.V. All rights reserved.

关键词： LMNtal concurrent logic programming concurrent constraint programming Hierarchical graph rewriting

来源：评论

学校读者我要写书评

暂无评论

logic/Constraint programming and Concurrency: The hard-won lessons of the Fifth Generation Computer project

引用

SCIENCE OF COMPUTER programming 2018年 164卷 3-17页

作者： Ueda, Kazunori Waseda Univ Dept Comp Sci & Engn Shinjuku Ku 3-4-1 Okubo Tokyo 1698555 Japan

The technical goal of the Fifth Generation Computer Systems (FGCS) project (1982-1993) was to develop Parallel Inference technologies, namely systematized technologies for realizing knowledge information processing on top of parallel computer architecture. The logic programming paradigm was adopted as the central working hypothesis of the project. At the same time, building a large-scale Parallel Inference Machine (PIM) meant to develop a novel form of general-purpose computing technologies that are powerful enough to express various parallel algorithms and to describe a full operating system of PIM. Accordingly, the research goal of the Kernel Language was set to designing a concurrent and parallel programming language under the working hypothesis of logic programming. The aim of this article is to describe the design process of the Kernel Language (KL1) in the context of related programming models in the 1980s, the essence of concurrent logic programming and Constraint-Based Concurrency, and how the technologies we developed in those days evolved after their conception. (C) 2017 Elsevier B.V. All rights reserved.

关键词： logic programming concurrent logic programming Constraint-Based Concurrency Fifth Generation Computer Systems project

来源：评论

学校读者我要写书评

暂无评论

A logic programming LANGUAGE BASED ON THE ANDORRA MODEL

引用

NEW GENERATION COMPUTING 1990年第2-3期7卷 109-125页

作者： HARIDI, S Swedish Institute of Computer Science Kista Sweden

The Andorra model is a parallel execution model of logic programs which exploits the dependent and-parallelism and or-parallelism inherent in logic programming. We present a flat subset of a language based on the Andorra model, henceforth called Andorra Prolog, that is intended to subsume both Prolog and the committed choice languages. Flat Andorra, in addition todon’t know anddon’t care nondeterminism, supports control of or-parallel split, synchronisation on variables, and selection of clauses. We show the operational semantics of the language, and its applicability in the domain of committed choice languages. As an examples of the expressiveness of the language, we describe a method for communication between objects by time-stamped messages, which is suitable for expressing distributed discrete event simulation applications. This method depends critically on the ability to expressdon’t know nondeterminism and thus cannot easily be expressed in a committed choice language.

关键词： Andorra Prolog concurrent logic programming Distributed Simulation Parallel programming Languages

来源：评论

学校读者我要写书评

暂无评论

Distributed memory implementation of KLIC

引用

NEW GENERATION COMPUTING 1996年第3期14卷 261-280页

作者： Rokusawa, K Nakase, A Chikayama, T INST NEW GENERAT COMP TECHNOL MINATO KUTOKYO 108JAPAN

This paper describes external reference management and distributed unification in a distributed implementation of a concurrent logic programming language KL1. This implementation is based on the KLIC system. KLIC has a feature called generic objects that enable easy modification and extension of the system without changes in the core implementation. This distributed implementation is built upon the same core and external references are represented using generic objects. Unification operations are defined as methods of generic objects. Since creation of interprocessor reference loops cannot be avoided, we studied a new unification scheme that can cope with interprocessor reference loops. We built several experimental distributed systems that all demonstrate reasonable efficiency.

关键词： concurrent logic programming distributed unification remote reference management distributed garbage collection weighted reference counting generic objects

来源：评论

学校读者我要写书评

暂无评论

FLAT PARLOG - A BASIS FOR COMPARISON

引用

INTERNATIONAL JOURNAL OF PARALLEL programming 1987年第2期16卷 87-125页

作者： FOSTER, I TAYLOR, S UNIV LONDON IMPERIAL COLL SCI & TECHNOL DEPT COMPLONDON SW7 2BZENGLAND WEIZMANN INST SCI DEPT COMP SCIIL-76100 REHOVOTISRAEL

Three similar parallel logic programming languages have been proposed; Parlog, Flat concurrent Prolog, and Guarded Horn Clauses. Quantitative comparison of the languages has not previously been possible since they employ different execution models and implementation techniques. In order to uncover the effects of semantic differences on efficiency, a common basis is required for experimentation. This paper presents a subset of the languageParlog calledFlat Parlog which provides a basis for quantitative comparison. The language combines the directional semantics of Parlog with the simple execution model of Flat concurrent Prolog. A performance comparison between Flat Parlog and Flat concurrent Prolog based on new implementations of both languages is presented. These new implementations are identical except for optimizations that are possible by virtue of semantic differences. Benchmark results indicate that Flat Parlog is more efficient; experiments have been able to quantify and explain this performance differential. A detailed description of the abstract machine for Flat Parlog is presented to illustrate the simplicity of the language.

关键词： concurrent logic programming concurrent Prolog Parlog performance evaluation

来源：评论

学校读者我要写书评

暂无评论

THE 5TH GENERATION PROJECT - LAUNCHING THE NEW ERA

引用

COMMUNICATIONS OF THE ACM 1993年第3期36卷 49-100页

作者： FUCHI, K KOWALSKI, R FURUKAWA, K UEDA, K KAHN, K CHIKAYAMA, T TICK, E UNIV LONDON IMPERIAL COLL SCI TECHNOL & MED DEPT COMP LONDON SW7 2BZ ENGLAND KEIO UNIV FAC ENVIRONM INFORMAT KANAGAWA 252 JAPAN NEC CORP LTD C&C SYST RES LABS COMP SYST RES LAB MIYAMAE KU KAWASAKI 216 JAPAN UNIV OREGON DEPT COMP SCI & INFORMAT SCI EUGENE OR 97403 USA

Research accomplishments in the fifth generation computer systems project over a ten year period since inception are outlined. The future of computers and information technology is discussed. The hypothesis has been that parallel inference technology will provide the core for new technologies of the future. The goal was to create a parallel inference machine starting with the study of parallel architectures based on a fifth generation kernel language, KL1, and the related operating system. The integration of logic, functional, and object oriented languages, and of programming and databases are discussed. Progress in these areas is outlined. Developments in general purpose parallel and mainframe computers are discussed. International collaboration in this project is considered.

关键词： concurrent logic programming 5TH GENERATION COMPUTER SYSTEMS PROJECT GUARDED HORN CLAUSES PROLOG

来源：评论

学校读者我要写书评

暂无评论

BLACKBOARD SYSTEMS IN POLKA

引用

INTERNATIONAL JOURNAL OF PARALLEL programming 1987年第5期16卷 401-424页

作者： DAVISON, A UNIV LONDON IMPERIAL COLL SCI & TECHNOL DEPT COMPPARLOG GRPLONDON SW7 2BZENGLAND

The design of concurrently executing blackboard systems is discussed, culminating in the description of one implemented in the Polka language. Polka combines the features of object oriented programming with those of the concurrent logic programming language Parlog, which allows blackboards and knowledge sources to be represented as concurrently executing objects.

关键词： Blackboards object oriented programming concurrent logic programming Parlog

来源：评论

学校读者我要写书评

暂无评论

A MULTICOMPUTER GARBAGE COLLECTOR FOR A SINGLE-ASSIGNMENT LANGUAGE

引用

INTERNATIONAL JOURNAL OF PARALLEL programming 1989年第3期18卷 181-203页

作者： FOSTER, I ARGONNE NATL LAB DIV MATH & COMP SCIARGONNEIL 60439

An asynchronous garbage collector for a message-passing multiprocessor (multicomputer) is described. This combines Weighted Reference Counting (WRC) interprocessor collection and tracing intraprocessor collection to permit individual processors to reclaim local storage independently. A novel feature is the integration of Weighted Reference Counting collection and the communication algorithms required to support a global address space in a single assignment language. This significantly reduces communication overhead and space requirements attributable to garbage collection. In addition, techniques are described that avoid the creation of cyclic structures that cannot be reclaimed using WRC. Experimental studies performed in a concurrent logic programming system that incorporates the collector confirm its efficiency and the benefits of integrating garbage collector and language implementation.

关键词： concurrent logic programming garbage collection multicomputers single-assignment languages weighted reference counting

来源：评论

学校读者我要写书评

暂无评论

LINDA IN CONTEXT

引用

COMMUNICATIONS OF THE ACM 1989年第4期32卷 444-458页

作者： CARRIERO, N GELERNTER, D Associate research scientist Department of Computer Science Yale University. Associate professor of computer science Yale

The article discusses the use of Linda, a parallel programming system consisting of a few simple operations that embody the tuple space model. Linda consists of a few simple operations that embody the tuple space model of parallel programming. Adding these tuple-space operations to a base language yields a parallel programming dialect. Use of Linda is growing slowly but steadily as versions of the system for beta test are being distributed and as several manufacturers work on their own implementations. But Linda remains stubbornly outside the research mainstream. To write parallel programs, programmers must be able to create and coordinate multiple execution threads. Linda is a model of process creation and coordination that is orthogonal to the base language in which it is embedded. The Linda model does not care how the multiple execution threads in a Linda program compute what they compute. It deals only with how these execution threads are created and how they can be organized into a coherent program.

关键词： concurrent logic programming concurrent object-oriented programming functional programming Linda monitors parallelism

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：