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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Constraint-Based Concurrency and Beyond

引用

ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE 2006年第1期162卷 327-331页

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

Constraint-based concurrency is a simple and elegant formalism of concurrency with monotonic mobile channels, whose history started in early 1980's as a subfield of logic programming. Although it has hardly been recognized as process calculi, there is a close connection between them. In this paper we try to convey the essence of constraint-based concurrency to the process calculi community. We also describe how it smoothly evolved into LMNtal (pronounced "elemental"), a language model based on hierarchical graph rewriting.

关键词： constraint-based concurrency concurrent constraint programming concurrent logic programming mobility hierarchical graph rewriting multiset rewriting LMNtal

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

MODED FLAT GHC AND ITS MESSAGE-ORIENTED IMPLEMENTATION TECHNIQUE

引用

NEW GENERATION COMPUTING 1994年第1期13卷 3-43页

作者： UEDA, K MORITA, M INST NEW GENERAT CO TECHNOL MINATO KUTOKYO 108JAPAN MITSUBISHI RES INST CHIYODA KUTOKYO 100JAPAN

concurrent processes can be used both for programming computation and for programming storage. Previous implementations of Flat GHC, however, have been tuned for computation-intensive programs, and perform poorly for storage-intensive programs (such as programs implementing reconfigurable data structures using processes and streams) and demand-driven programs. This paper proposes an optimization technique for programs in which processes are almost always suspended. The technique compiles unification for data transfer into message passing. Instead of reducing the number of process switching operations, the technique optimizes the cost of each process switching operation and reduces the number of cons operations for data buffering. The technique is based on a mode system which is powerful enough to analyze bidirectional communication and streams of streams. The mode system is based on mode constraints imposed by individual clauses rather than on global dataflow analysis, enabling separate analysis of program modules. The introduction of a mode system into Flat GHC effectively subsets Flat GHC;the resulting language is called Moded Flat GHC. Moded Flat GHC programs enjoy two important properties under certain conditions: (1) reduction of a goal clause retains the well-modedness of the clause, and (2) when execution terminates, all the variables in an initial goal clause will be bound to ground terms. Practically, the computational complexity of all-at-once mode analysis can be made almost linear with respect to the size n of the program and the complexity of the data structures used, and the complexity of separate analysis is higher only by O(log n) times.

关键词： concurrent logic programming MODED FLAT GHC STATIC MODE SYSTEM CONSTRAINT-BASED PROGRAM ANALYSIS MESSAGE-ORIENTED IMPLEMENTATION

来源：评论

学校读者我要写书评

暂无评论

SUSPENSION ANALYSES FOR concurrent logic PROGRAMS

引用

ACM TRANSACTIONS ON programming LANGUAGES AND SYSTEMS 1994年第3期16卷 649-686页

作者： CODISH, M FALASLCHI, M MARRIOTT, K WEIZMANN INST SCI IL-76100 REHOVOTISRAEL UNIV PISA I-56100 PISAITALY TJ WATSON RES CTR YORKTOWN HTSNY

concurrent logic languages specify reactive systems which consist of collections of communicating processes. The presence of unintended suspended computations is a common programming error which is difficult to detect using standard debugging and testing techniques. We develop a number of analyses, based on abstract interpretation, which succeed if a program is definitely suspension free. If an analysis fails the program may, or may not, be suspension free. Examples demonstrate that the analyses are practically useful. They are conceptually simple and easy to justify because they are based directly on the transition system semantics of concurrent logic programs. A naive analysis must consider all scheduling policies. However, it is proven that for our analyses it suffices to consider only one scheduling policy, allowing for efficient implementation.

关键词： LANGUAGES ABSTRACT INTERPRETATION concurrent logic programming PROGRAM ANALYSIS

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

MESSAGE-ORIENTED PARALLEL IMPLEMENTATION OF MODED FLAT GHC

引用

NEW GENERATION COMPUTING 1993年第3-4期11卷 323-341页

作者： UEDA, K MORITA, M MITSUBISHI RES INST CHIYODA KUTOKYO 100JAPAN

We proposed in Ref 5) a new, message-oriented implementation technique for Moded Flat GHC that compiled unification for data transfer into message passing. The technique was based on constraint-based program analysis, and significantly improved the performance of programs that used goals and streams to implement reconfigurable data structures. In this paper we discuss how the technique can be parallelized. We focus on a method for shared-memory multiprocessors, called the shared-goal method, though a different method could be used for distributed-memory multiprocessors. Unlike other parallel implementations of concurrent logic languages which we call process-oriented, the unit of parallel execution is not an individual goal but a chain of message sends caused successively by an initial message send. Parallelism comes from the existence of different chains of message sends that can be executed independently or in a pipelined manner. Mutual exclusion based on busy waiting and on message buffering controls access to individual, shared goals. Typical goals allow last-send optimization, the message-oriented counterpart of last-call optimization. We have built an experimental implementation on Sequent Symmetry. In spite of the simple scheduling currently adopted, preliminary evaluation shows good parallel speedup and good absolute performance for concurrent operations on binary process trees.

关键词： GHC MODED FLAT GHC OPTIMIZATION concurrent logic programming PARALLELISM MUTUAL EXCLUSION SHARED-MEMORY MULTIPROCESSORS

来源：评论

学校读者我要写书评

暂无评论

Current research status and future direction of the fifth generation computer project

引用

Future Generation Computer Systems 1992年第2-3期7卷 269-273页

作者： Furukawa, Koichi Institute for New Generation Computer Technology Minato-ku Tokyo 108 4-28 Mita 1-Chome Japan

The fifth generation computer project was launched in 1982, aiming at developing parallel computers dedicated for knowledge information processing. It was commonly believed that knowledge processing based on symbolic computation is very difficult to parallelize. We made a conjecture that logic programming technology will solve the difficulty. During the project, we succeeded in inventing a parallel logic programming language, GHC, and its realistic extention, KL1. We devoted our effort in developing parallel hardware called PIM, dedicated for KL1. We are now developing software technology on top of KL1 and PIM. We succeeded in developing PIM's operating system totally in KL1, which runs on Multi-PSI, a current experimental parallel hardware for developing KL1 programming. We are now concentrating our effort on developing mapping techniques, such as load balancing and priority control, for deriving real spead up in parallel execution. We are also trying to develop more realistic and complicated application programs such as VLSI-CAD systems, case based reasoning systems and parallel theorem provers which, we hope, will run efficiently on PIM. © 1992.

关键词： concurrent logic programming constraint logic programming Fifth generation computer knowledge information processing logic programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：