<p>This paper reviews a pedagogic exercise related to the degree of Architecture being taught at University Chile. This exercise, which is based on action folding paper, integrates knowledge areas from project learning in initial phases. To illustrate this, methodology section, applied didactic strategy together with its theoretical sustenance are described and then followed by both revie...

Performance on symbolic and non-symbolic numeric order determination tasks was examined as predictors of Woodcock Johnson calculation (exact) and computation estimation (approximate) scores among university aged adults. For Woodcock Johnson scores, only the symbolic task variant was found to be a significant predictor of performance outcomes after entering both task variants into a multiple reg...

The mpoly package is a general purpose collection of tools for symbolic computing with multivariate polynomials in R. In addition to basic arithmetic, mpoly can take derivatives of polynomials, compute Gröbner bases of collections of polynomials, and convert polynomials into a functional form to be evaluated. Among other things, it is hoped that mpoly will provide an R-based foundation for the ...

Partial evaluation, also known as automatic specialization, is a particular collection of techniques for improving the performance of an application. With clear benefits, but unclear implementation up until now, partial evaluation is little used in current computing practice. This soon will change. Presented here is partial execution, an alternative to symbolic evaluation the technique driving ...

Partially-observable Markov decision processes (POMDPs) provide a powerful model for sequential decision-making problems with partially-observed state and are known to have (approximately) optimal dynamic programming solutions. Much work in recent years has focused on improving the efficiency of these dynamic programming algorithms by exploiting symmetries and factored or relational representat...

We propose an algorithm, referred to as ALLTHETA, for performing efficient domain-independent symbolic reasoning in a planning system FLUCAP 1.1 that solves first-order MDPs. The computation is done avoiding vicious state and action grounding.

We propose a first-order dynamic logic for reasoning about hybrid systems. As a uniform model for discrete and continuous evolutions in hybrid systems, we introduce hybrid programs with differential actions. Our logic can be used to specify and verify correctness statements about hybrid programs, which are suitable for symbolic processing by calculus rules. Using first-order variables, our logi...

Finite state automata with counters are useful for modeling systems with discrete parameters. The calculation of state invariants is an important tool in the analysis of such systems. Previous authors have presented techniques for the calculation of state invariants based on their approximation by convex polyhedra or periodic sets. In this paper we present a new method for the calculation of in...