We have developed TAIL, a textual programming language isomorphic to the blocks language of MIT App Inventor 2 (AI2), and have extended AI2 with code blocks, a novel mechanism that enables bidirectional isomorphic conversions between blocks and text program fragments. TAIL improves AI2’s usability by facilitating the reading, writing, and sharing of programs, and may also ease the transition fr...

Mainstream research in planning assumes that input information is complete and correct. There are branches of research into plan generation with incomplete planning problems and with incomplete domain models. Approaches include gaining knowledge aimed at making the input information complete or building robust planners that can generate plans despite the incompleteness of the input. This paper ...

This paper focuses on the development and validation of an optimal motion planning method for computer-assisted surgical training. The context of this work is the development of new-generation systems that combine artificial intelligence and computer vision techniques in order to adjust the learning process to specific needs of a trainee, while preventing a trainee from the memorization of part...

This paper investigates an approach to designing and building adaptive agents. The main contribution is the use of a symbolic machine learning system for approximating the policy and Q functions that are at the heart of the agent. Under the assumption that sufficient knowledge of the application domain is available, it is shown how this knowledge can be provided to the agent in the form of symb...

This paper reports an analysis of near-optimal Blocks World planning. Various methods are clarified, and their time complexity is shown to be linear in the number of blocks, which improves their known complexity bounds. The speed of the implemented programs (ten thousand blocks are handled in a second) enables us to make empirical observations on large problems. These suggest that the above met...

Diaconescu, Moore and Witten proved that the partition function of type IIA string theory coincides (to the extent checked) with the partition function of M-theory. One of us (Kriz) and Sati proposed in a previous paper a refinement of the IIA partition function using elliptic cohomology and conjectured that it coincides with a partition function coming from F-theory. In this paper, we define t...

We study T 2 compactification of massive type IIA supergravity in presence of possible Ramond-Ramond (RR) background fluxes. The resulting theory in D = 8 is shown to possess full SL(2, R) × SL(2, R) T-duality symmetry similar to the massless case. It is shown that elements of duality symmetry interpolate between massive type IIA compactified on T 2 and ordinary type IIA compactified on T 2 wit...