FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Abstract. This paper presents a prototype implementation of an intelligent assistance architecture for data-driven simulation specialising in qualitative data in the social science...
Catriona Kennedy, Georgios K. Theodoropoulos, Volk...
Abstract. Despite the considerable success of Inductive Logic Programming, deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques ...
Rui Camacho, Nuno A. Fonseca, Ricardo Rocha, V&iac...
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...
Trevor Walker, Lisa Torrey, Jude W. Shavlik, Richa...