Experiments with a deductive question-answering program

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Generate & Rank: A Multi-task Framework for Math Word Problems (2021, neutral): “Early approaches on math word problems mainly craft rules and templates for pattern matching (Bobrow, 1964; Slagle, 1965; Fletcher, 1985; Bakman, 2007).”
The Gap of Semantic Parsing: A Survey on Automatic Math Word Problem Solvers (2018, methodology): “In the ﬁrst pioneering stage, roughly from the year 1960 to 2010 , systems such as STUDENT [1], DEDUCOM [6], WORDPRO [7] and ROBUST [8], manually craft rules and schemas for pattern matchings.”
Toward automatic program synthesis (1971, methodology): “Some program synthesizers have already been written, including the Heuristic Compiler (Simon [25]), DEDUCOM (Slagle [ 26 ]), QA3 (Green [6, 7]), and PROW (Waldinger and Lee [29] and Waldinger [28]).”
A review of methods for automatic understanding of natural language mathematical problems (2008, methodology): “Slagle’s DEDUCOM (Deductive Communicator) (Slagle 1965; Simmons 1970) was a LISP program that stored LISP expressions of data statements such as: ‘There are 5 fingers on a hand’, ‘There is one hand on an arm’, ‘There are 2 arms on a man’ and inference rules in the form of conditional statements…”