Supercompilation 1 is a program transformation technique that symbolically evaluates a given program, with run-time values as unknowns. In doing so, it discovers execution patterns of the original ...

Abstract: Designing algorithms to solve math word problems (MWPs) is an important research topic in natural language processing and smart education domains. The task of solving MWPs involves ...

Abstract: We propose a distributed Nash equilibrium seeking approach that can achieve both almost sure convergence and rigorous differential privacy with finite cumulative privacy budget, which is in ...

Linear functions are used to model a broad range of real-world problems. The ability to solve linear equations and inequalities is an essential skill for analysing these models. This section covers ...