Memoization, such as that performed by bottom-up evaluation, helps detect loops, avoid repeated computation when subgoals are generated repeatedly, and in conjunction with a fair search strategy, ensures that evaluation is complete. Programs that generate non-ground facts (i.e., facts containing universally quantiied variables) and also need memoization are important in several contexts. Curren...

In PEPA, the calculation of the transitions enabled by a process accounts for a large part of the time for the state space exploration of the underlying Markov chain. Unlike other approaches based on recursion, we present a new technique that is iterative—it traverses the process’ binary tree from the sequential components at the leaves up to the root. Empirical results shows that this algorith...

We present a particular way of building ontologies that proceeds in a bottom-up fashion. Concepts are defined in a way that mirrors the way their instances are composed out of smaller objects. The smaller objects themselves may also be modeled as being composed. Bottom-up ontologies are flexible through the use of implicit and, hence, parsimonious part-whole and subconceptsuperconcept relations...

Traditional top down specialisation techniques are not optimal to spe-cialise programs containing a lot of internal structure handling, such as programs containing abstract data types or meta programs. In this abstract , we discuss the diiculties top down specialisers have when special-ising these kinds of programs. The diiculties arise from the fact that unfolding works in a top down way, wher...

In this work we analyze the relevance of the different low energy phases for the CP asymmetry of the Universe. To this end, we develop a parametrization of the see-saw mechanism in terms of low energy data that will allow us to study leptogenesis from a bottom-up perspective. We find that the relevant phases for leptogenesis depend on the particular scenario, and we classify the different possi...

Previous studies of feature-selective attention have focused on situations in which attention is directed to one of two spatially superimposed stimuli of equal salience. While such overlapping stimuli should maximize stimulus interactions, it is still unknown how bottom-up biases favoring one or the other stimulus influence the efficiency of feature-selective attention. We examined the integrat...

We introduce the concept of bisimulation between Datalog goals using bottom-up evaluation technique: two Datalog goals are bisimilar with respect to a given Datalog program equipped with a bottom-up evaluation technique when their resolution trees are bisimilar. We define the notion of a resolution tree and we address the problem of deciding whether two given goals are bisimilar with respect to...

In this work, we present a new bottom-up algorithm for decision tree pruning that is very eecient (requiring only a single pass through the given tree), and prove a strong performance guarantee for the generalization error of the resulting pruned tree. We work in the typical setting in which the given tree T may have been derived from the given training sample S, and thus may badly overrt S. In...

Electronics obtained through the bottom-up approach of molecular-level control of material composition and structure may lead to devices and fabrication strategies not possible with top-down methods. This review presents a brief summary of bottom-up and hybrid bottom-up/top-down strategies for nanoelectronics with an emphasis on memories based on the crossbar motif. First, we will discuss repre...

This study investigated the functional significance of EEG alpha power increases, a finding that is consistently observed in various memory tasks and specifically during divergent thinking. It was previously shown that alpha power is increased when tasks are performed in mind-e.g., when bottom-up processing is prevented. This study aimed to examine the effect of task-immanent differences in bot...