A goal of the Multi-tac project is to make combinatorial problem-solving technology available to users who have no formal training in AI or OR. To achieve this aim, we have built a system , ViCSS (Visual Constraint Speciication System) that enables users to specify problems graphically. To simplify the speciication process, ViCSS relies heavily on programming-by-demonstration techniques. We bel...

Programming by demonstration is an efficient way to acquire procedural knowledge, but it can require many examples to learn how to perform complex tasks. In this paper, we present a novel approach to using transfer learning in programming by demonstration. In particular, we describe a mechanism that learns how to transfer solutions to common subgoals from one task to another. We show that trans...

In this paper, we investigate the PBD-closure of sets K with {7, 13} ⊆ K ⊆ {7, 13, 19, 25, 31, 37, 43}. In particular, we show that v ≡ 1 mod 6, v ≥ 98689 implies v ∈ B({7, 13}). As a preliminary result, many new 13-GDDs of type 13q and resolvable BIBD with block size 6 or 12 are also constructed. Furthermore, we show some elements to be not essential in a Wilson bases for the PBD-closed set {v...

We investigate the class PBD of π-Calculus processes that are bounded in the function depth. First, we show that boundedness in depth has an intuitive characterisation when we understand processes as graphs: a process is bounded in depth if and only if the length of the simple paths is bounded. The proof is based on a new normal form for the π-Calculus called anchored fragments. Using this conc...

Machine learning research has been very successful at producing powerful, broadlyapplicable classification learners. However, many practical learning problems do not fit the classification framework well, and as a result the initial phase of suitably formulating the problem and incorporating the relevant domain knowledge can be very difficult and typically consumes the majority of the project t...

Programming by Demonstration systems often have problems with control structure injerence and user-intended generalization. We propose a new solution for these weaknesses basred on concepts of AWK and present a prototype system for text processing. I t utilizes ‘vertical demonstration’, extensive visual feedback, and program visualization via spreadsheets to achieve improved usability and expre...

In this paper, we propose a new mechanism, imitation, which can be used in a programming by demonstration system as an alternative to generalization. A system using imitation always asks the user for help when a new case arises in an algorithm. At this point, the user may demonstrate the steps for this case or tell the system: (1) that this case is similar to another one already demonstrated an...

A pairwise balanced design, B(K; v), is a block design on v points, with block sizes taken from K, and with every pair of points occurring in a unique block; for a fixed K, B(K) is the set of all v for which a B(K; v) exists. A set, S, is a PBD-basis for the set, T , if T = B(S). Let Na(m) = {n : n ≡ a mod m}, and N≥m = {n : n ≥ m}; with Q the corresponding restriction of N to prime powers. Thi...

A Latin square of order s is an s by s array L of the symbols { 1,2,..., s}, such that each symbol occurs once in each row and column of L. Two Latin squares L and M of order s are orthogonal if their superposition yields all s2 possible ordered pairs (i,j), 1 < i, j < s. It was conjectured by Euler, and proved by Tarry [4] that there do not exist a pair of orthogonal Latin squares of order six...