Showing papers in "Future Generation Computer Systems in 1992"

TL;DR: This work presents a methodology to easily write efficient, high performance and portable massively parallel programs, based on the definition of a new explicitly parallel programming language, namely P 3 L, and of a set of compiling tools that perform automatic adaptation of the program features to the target architecture hardware.

TL;DR: An incremental entailment simplification simplification system that is proved to be sound and complete, and a proof showing that FT satisfies the so-called " independence of negative constraints".

TL;DR: A novel (non-von Neumann) paradigm of parallel computation supporting a much more efficient implementation of parallel algorithms is introduced and its flexibility is illustrated by simple DSP and image processing examples.

TL;DR: The paper reports on the experiences in implementing three frequently occurring communication patterns: message passing through a mailbox, one-to-many communication, and access to replicated shared data.

TL;DR: The main result presented is a Function Cell architecture which has been designed to support the functionality required by these data flow graphs and some results from an implementation are presented.

TL;DR: This work continues the exploration of a theory of database updates based upon the situation calculus, which takes seriously the fact that databases evolve in time, so that updatable relations should be endowed with an explicit state argument representing the current database state.

TL;DR: A declarative semantics of logic programs which possibly contain inconsistent information is presented and the extended well-founded semantics for paraconsistent logic programs is extended to disjunctive paracons consistent logic programs.

TL;DR: This paper explores the operating system support that these multimedia systems must have in order to do the job properly.

TL;DR: This work proposes a model of parallel computation, the YPRAM, that allows general parallel algorithms to be designed for a wide class of parallel models, and shows that this model predicts, reasonably accurately, the actual known performances of several basic parallel models when solving these problems.

TL;DR: The design features and the evaluation results show that an efficient and highly testable parallel computer is realized, based on the modified dataflow schemes and the versatile maintenance schemes.

TL;DR: This paper introduces a general-isation of propagation that is applicable to any CLP computation domain, thereby restoring or-thogonality and bridging the gap between two important constraint logic programming paradigms.

TL;DR: The paper proposes the introduction of `bounded quanti cations' in logic programming languages, a natural way to express programs operating on arrays and other `indexable' data structures.

TL;DR: A new programming language designed to allow the convenient expression of algorithms for a parallel random access machine (PRAM) and its contribution should be seen as a modest attempt to fill this gap.

TL;DR: A simple language is defined which suffices to express all data-parallel extensions of usual scalar control structures of C, as found in C∗, MPL, POMPC, etc, and its operational semantics are given.

TL;DR: An experimental evaluation shows that the number of relevant bibliographic references retrieved with the knowledge-based front-end is significantly improved, without compromising the precision of the retrieval.

TL;DR: An overview of R&D activities for databases and knowledge-bases in the FGCS project, which are aimed towards an integrated knowledge-base management system.

TL;DR: It is proposed that improved integrated systems can be constructed by taking a broader view of the underlying semantics of logic programming, and a novel integrated language paradigm, Deenitional Constraint Programming (DCP), which generalises constraint logic programming by admitting user-deened functions via a purely functional subsystem and enhances it with the power to solve constraints over functional programs.