Although logic languages, due to their non-declarative nature, are widely proclaimed to be conducive in theory to parallel implementation, in fact there appears to be insufficient practical evidence to stimulate furth...
Although logic languages, due to their non-declarative nature, are widely proclaimed to be conducive in theory to parallel implementation, in fact there appears to be insufficient practical evidence to stimulate further developments in this field. The paper puts forward various complications which arise in assuming a solely process parallel approach as a possible explanation for this situation. As an alternative, data parallelism is posited as an underutilized forte of logicprogramming. The paper illustrates a data parallel implementation of a particular language called SEL which is based on sets. Thus, SEL (set equational language) is introduced as an example of logic language which lends itself to an efficient data parallel implementation. The strategy of this implementation assumes an abstract machine called SAM (set-oriented abstract machine) which is based on the WAM (Warren abstract machine). SAM serves as an intermediary between the SEL language and the target machine for the implementation, the Connection Machine. Finally, some preliminary benchmarks are presented.
Over the last few years, the efficient learnability of logic programs has been studied extensively. Positive and negative learnability results now exist for a number of restricted classes of logic programs that are cl...
详细信息
Over the last few years, the efficient learnability of logic programs has been studied extensively. Positive and negative learnability results now exist for a number of restricted classes of logic programs that are closely related to the classes used in practice within inductive logicprogramming. This paper surveys these results, and also introduces some of the more useful techniques for deriving such results. The paper does not assume any prior background in computational learning theory.
Encapsulation constructs with import/export declarations is the structuring facility offered in most commercial Prolog systems. However, real-life applications have shown to require a finer information exchange betwee...
详细信息
ISBN:
(纸本)3540592938
Encapsulation constructs with import/export declarations is the structuring facility offered in most commercial Prolog systems. However, real-life applications have shown to require a finer information exchange between encapsulated pieces of code. In this paper, a refinement of import/export declarations for modules of logic programs is presented. This offers a stricter form of communication between the modules and a larger variety of visibility states of their predicates, the standard approaches being special cases of it. The semantics of this module system has been examined and model-theoretic, fixpoint and operational ones are given and have been proved to be equivalent. Instead of using other logics, all these semantics extend the ones of Horn clause logic using concepts commonly used in it. In addition, the module system has been naturally transformed to Horn clause logic exploiting the distinction of the predicates within a module according to the interface declarations of this module. A form of equivalence with the other semantics of the system is given. In addition, the employed transformation has provided us with a basis for a preprocessor based implementation of the module system.
The proceedings contain 24 papers. The special focus in this conference is on theory and practice of Parallel programming. The topics include: Time and information in sequential and concurrent computation;simulating g...
ISBN:
(纸本)3540591729
The proceedings contain 24 papers. The special focus in this conference is on theory and practice of Parallel programming. The topics include: Time and information in sequential and concurrent computation;simulating guarded programs in linear logic;sharing mutable objects and controlling groups of tasks in a concurrent and distributed language;multi-threaded pailisp with granularity adaptive parallel execution;an abstract machine for scheduling fine-grain threads on stock CPUs;higher-order concurrent linear logicprogramming;a parallel object-oriented language OCore;concurrent objects in a process calculus;formalism for remotely interacting processes;a meta system for concurrent process calculi based on SOS;first-class synchronous operations;a performance debugger for a parallel logicprogramming language fleng;locality abstractions for parallel and distributed computing;an algorithm for efficient global garbage collection on massively parallel computers;advanced component interface specification;graph notation for concurrent combinators;a calculus for exploiting data parallelism on recursively defined data;the data-parallel C language NCX and its implementation strategies and programming with distributed data structure for EM-X multiprocessor.
This paper briefly reviews concurrent logicprogramming and the I/O mode system designed for the concurrent logic language Flat GHC. The mode system plays fundamental roles both in programming and implementation in al...
详细信息
The aim of this contribution is to show that RPL-Rational Pavelka logic and RQL-Rationai Quantification logic (Hájek’s substantial simplification of Pavelka’s propositional and Novák’s predicate fuzzy cal...
详细信息
Functional and logicprogramming are the most important declarative programming paradigms, and interest in combining them has grown over the last decade. Early research concentrated on the definition and improvement o...
Functional and logicprogramming are the most important declarative programming paradigms, and interest in combining them has grown over the last decade. Early research concentrated on the definition and improvement of execution principles for such integrated languages, while more recently efficient implementations of these execution principles have been developed so that these languages became relevant for practical applications. In this paper, we survey the development of the operational semantics as well as the improvement of the implementation of functional logic languages.
Petri Nets are one of the most basic formal models for the representations and analysis of concurrent programming. Combining finite automata with non-deterministic Petri net, we introduce a new paradigm of Non-Determi...
详细信息
暂无评论