Benchmark problems in which equality plays the major role

We have recently heard rumors that researchers are again studying paramodulation (Wos87) in the context of strategy for its control. In part to facilitate such research, and in part to provide test problems for evaluating other approaches to equality-oriented reasoning, we offer in this article a set of benchmark problems in which equality plays the dominant role. The test problems are taken from group theory, Robbins algebra, combinatory logic, and other areas. For each problem, we include appropriate clauses and comment as to its status with regard to provability by an unaided automated reasoning program

Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximations

We study algorithms for online linear optimization in Hilbert spaces, focusing on the case where the player is unconstrained. We develop a novel characterization of a large class of minimax algorithms, recovering, and even improving, several previous results as immediate corollaries. Moreover, using our tools, we develop an algorithm that provides a regret bound of $\mathcal{O}\Big(U \sqrt{T \log(U \sqrt{T} \log^2 T +1)}\Big)$, where $U$ is the $L_2$ norm of an arbitrary comparator and both $T$ and $U$ are unknown to the player. This bound is optimal up to $\sqrt{\log \log T}$ terms. When $T$ is known, we derive an algorithm with an optimal regret bound (up to constant factors). For both the known and unknown $T$ case, a Normal approximation to the conditional value of the game proves to be the key analysis tool.Comment: Proceedings of the 27th Annual Conference on Learning Theory (COLT 2014

Global citizenship and critical thinking in higher education curricula and police education: a socially critical vocational perspective

The re‐emergence of the concept of global citizenship within higher education (HE) after what Smith et al. (2008, p.136) have described as ‘many years of comparative neglect’ has reopened the debate about the fundamental roles, responsibilities and purpose of HE. Rhoads and Szelenyi (2011, p8‐9) argue that not only do ‘universities have an obligation to use their knowledge capacities to advance social life and to better the human condition’, but they also have a responsibility for ‘advancing global social relations’. Likewise, Camicia and Franklin (2011, p.39) maintain that universities have the ‘intellectual authority that society needs to help it reflect, understand and act’ which suggests that Higher Education Institutions (HEIs) have a profound and moral responsibility to take a leading and active role in creating a more enlightened, socially just and civilised global society

Structural Analysis: Shape Information via Points-To Computation

This paper introduces a new hybrid memory analysis, Structural Analysis, which combines an expressive shape analysis style abstract domain with efficient and simple points-to style transfer functions. Using data from empirical studies on the runtime heap structures and the programmatic idioms used in modern object-oriented languages we construct a heap analysis with the following characteristics: (1) it can express a rich set of structural, shape, and sharing properties which are not provided by a classic points-to analysis and that are useful for optimization and error detection applications (2) it uses efficient, weakly-updating, set-based transfer functions which enable the analysis to be more robust and scalable than a shape analysis and (3) it can be used as the basis for a scalable interprocedural analysis that produces precise results in practice. The analysis has been implemented for .Net bytecode and using this implementation we evaluate both the runtime cost and the precision of the results on a number of well known benchmarks and real world programs. Our experimental evaluations show that the domain defined in this paper is capable of precisely expressing the majority of the connectivity, shape, and sharing properties that occur in practice and, despite the use of weak updates, the static analysis is able to precisely approximate the ideal results. The analysis is capable of analyzing large real-world programs (over 30K bytecodes) in less than 65 seconds and using less than 130MB of memory. In summary this work presents a new type of memory analysis that advances the state of the art with respect to expressive power, precision, and scalability and represents a new area of study on the relationships between and combination of concepts from shape and points-to analyses