scholarly journals Mapping to Declarative Knowledge for Word Problem Solving

2018 ◽  
Vol 6 ◽  
pp. 159-172
Author(s):  
Subhro Roy ◽  
Dan Roth

Math word problems form a natural abstraction to a range of quantitative reasoning problems, such as understanding financial news, sports results, and casualties of war. Solving such problems requires the understanding of several mathematical concepts such as dimensional analysis, subset relationships, etc. In this paper, we develop declarative rules which govern the translation of natural language description of these concepts to math expressions. We then present a framework for incorporating such declarative knowledge into word problem solving. Our method learns to map arithmetic word problem text to math expressions, by learning to select the relevant declarative knowledge for each operation of the solution expression. This provides a way to handle multiple concepts in the same problem while, at the same time, supporting interpretability of the answer expression. Our method models the mapping to declarative knowledge as a latent variable, thus removing the need for expensive annotations. Experimental evaluation suggests that our domain knowledge based solver outperforms all other systems, and that it generalizes better in the realistic case where the training data it is exposed to is biased in a different way than the test data.

2019 ◽  
Vol 36 (2) ◽  
pp. 142-156
Author(s):  
Lynn S. Fuchs ◽  
Douglas Fuchs ◽  
Pamela M. Seethaler ◽  
Caitlin Craddock

2017 ◽  
Vol 40 (2) ◽  
pp. 91-104 ◽  
Author(s):  
Lisa L. Morin ◽  
Silvana M. R. Watson ◽  
Peggy Hester ◽  
Sharon Raver

Author(s):  
Alexander Kott ◽  
Gerald Agin ◽  
Dave Fawcett

Abstract Configuration is a process of generating a definitive description of a product or an order that satisfies a set of specified requirements and known constraints. Knowledge-based technology is an enabling factor in automation of configuration tasks found in the business operation. In this paper, we describe a configuration technique that is well suited for configuring “decomposable” artifacts with reasonably well defined structure and constraints. This technique may be classified as a member of a general class of decompositional approaches to configuration. The domain knowledge is structured as a general model of the artifact, an and-or hierarchy of the artifact’s elements, features, and characteristics. The model includes constraints and local specialists which are attached to the elements of the and-or-tree. Given the specific configuration requirements, the problem solving engine searches for a solution, a subtree, that satisfies the requirements and the applicable constraints. We describe an application of this approach that performs configuration and design of an automotive component.


2021 ◽  
pp. 105345122110475
Author(s):  
Bradley Witzel ◽  
Jonté A. Myers ◽  
Yan Ping Xin

State exams frequently use word problems to measure mathematics performance making difficulties with word problem solving a barrier for many students with learning disabilities (LD) in mathematics. Based on meta-analytic data from students with LD, five empirically validated word-problem strategies are presented with components of model-based problem solving (MBPS) highlighted.


Sign in / Sign up

Export Citation Format

Share Document