Abstract
Logic programming provides a high-level view of programming that gives implementor; a vast latitude in what techniques to research towards obtaining the best performance for logic programs. The Emended Andorra Model was designed towards achieving reduction of the search space whilst exploiting all the available parallelism in the application. The BEAM is a first sequential implementation for the Extended Andorra Model with Implicit Control, that has been shown to obtain good results. In this work we propose the RAINBOW, a parallel execution model for the BEAM. We present a general overview of how to distribute work, propose alternative approaches towards addressing the binding problem for the EAM, and present a scheduling strategy.

Abstract
This Doctoral Consortium paper focuses on Extreme Adaptivity, a set of top level requirements for adaptive hypertext systems, which has resulted from one year of examining the adaptive hypertext landscape. The complete specification of a system, KnowledgeAtoms, is also given, mainly as an example of Extreme Adaptivity. Additional methodological elements are discussed.

Abstract
We describe the MyYapDB, a deductive database system coupling the Yap Prolog compiler and the MySQL DBMS. We use our OPTYap extension of the Yap compiler, which is the first available system that can exploit parallelism from tabled logic programs. We describe the major features of the system, give a simplified description of the implementation and present a performance comparison of using static facts or accessing the facts as MySQL tuples for a simple example.

Abstract
Relatively simple transformations can speed up the execution of queries for data mining considerably. While some ILP systems use such transformations, relatively little is known about them or how they relate to each other. This paper describes a number of such transformations. Not all of them are novel, but there have been no studies comparing their efficacy. The main contributions of the paper are: (a) it clarifies the relationship between the transformations; (b) it contains an empirical study of what can be gained by applying the transformations; and (c) it provides some guidance on the kinds of problems that are likely to benefit from the transformations.

Abstract
Several works on grid computing have been proposed in the last years. However, most of them, including available software, can not deal properly with some issues related to control of applications that spread a very large number of tasks across the grid network. This work presents a step toward solving the problem of controlling such applications. We propose and discuss an architectural model called GRAND (Grid Robust ApplicatioN Deployment) based on partitioning and hierarchical submission and control of such applications. The main contribution of our model is to be able to control the execution of a huge number of distributed tasks while preserving data locality and reducing the load of the submit machines. We propose a taxonomy to classify application models to run in grid environments and partitioning methods. We also present our application description language GRID-ADL. Copyright 2004 ACM.

Abstract
This work investigates the impact of hybrid coherence protocols on non-scientific applications. We use execution-driven simulation of a scalable multiprocessor and compare the results obtained with a hybrid protocol with a well-known invalidate protocol and an update-based protocol. Our results show that for our sample programs a hybrid protocol with high threshold outperforms both the invalidate-based and update-based protocols, regardless of the type of parallelism exhibited by the benchmarks. We conclude that our applications can benefit from a hybrid protocol, and that multiprocessors designed for running these systems efficiently should adopt some form of hybrid protocol.