Local consistency techniques for numerical constraints over interval domains combine interval arithmetic, constraint inversion and bisection to reduce variable domains.
In the second stage, a SAT-based arithmetic constraint solver, such as LPSAT or MathSAT, is used to find a solution to the system of constraints.
At the time, I was finishing one of the Grid's platform tools, called Grid Style Sheets, a language for layout design that leverages the Cassowary Linear Arithmetic Constraint Solver, a significant algorithm that also powers the interface logic for Apple's iOS & OS X.
In this paper, we study the problem of integrating any specific interval arithmetic library in constraint solvers.
From the results, it can be inferred that the learners are aware of the structure and constraints of arithmetic word problems (either completely or incompletely) and try to satisfy the constraints in posing word problems with Monsakun.
The correlation analysis between actual and possible posed problems shows that learners do not pose problems randomly; moreover, they are also trying to satisfy the constraints of arithmetic word problems as much as possible.
Monsakun enables us to do such analysis because Triplet Structure Model defines the basic structure of arithmetic word problems and the constraints to form them.
However, hardware architectures implementing these applications are designed using fixed-point arithmetic to satisfy the tight constraints on implementation area and power consumption related to embedded systems.
Finally, the constraints to form arithmetic word problems based on the task model are discussed and followed by a number of case examples.
While Hirashima et al. (2008) research showed not only students enjoyed learning problem posing with a computer-supported system but they also had better performance in math, the finding of this study shows the evidence that students were able to use the system for the intended purposes, which is to pose arithmetic word problems satisfying certain constraints.
