{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/mapping-to-declarative-knowledge-for-word","title":"Mapping to Declarative Knowledge for Word Problem Solving","arxiv_id":"1712.09391","date":"2017-12-26","proceeding":"TACL 2018 1","authors":["Subhro Roy","Dan Roth"],"abstract":"Math word problems form a natural abstraction to a range of quantitative\nreasoning problems, such as understanding financial news, sports results, and\ncasualties of war. Solving such problems requires the understanding of several\nmathematical concepts such as dimensional analysis, subset relationships, etc.\nIn this paper, we develop declarative rules which govern the translation of\nnatural language description of these concepts to math expressions. We then\npresent a framework for incorporating such declarative knowledge into word\nproblem solving. Our method learns to map arithmetic word problem text to math\nexpressions, by learning to select the relevant declarative knowledge for each\noperation of the solution expression. This provides a way to handle multiple\nconcepts in the same problem while, at the same time, support interpretability\nof the answer expression. Our method models the mapping to declarative\nknowledge as a latent variable, thus removing the need for expensive\nannotations. Experimental evaluation suggests that our domain knowledge based\nsolver outperforms all other systems, and that it generalizes better in the\nrealistic case where the training data it is exposed to is biased in a\ndifferent way than the test data.","url_abs":"http://arxiv.org/abs/1712.09391v1","url_pdf":"http://arxiv.org/pdf/1712.09391v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"mapping-to-declarative-knowledge-for-word","repo_url":"https://github.com/CogComp/arithmetic","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"math","task_name":"Math"},{"task_slug":"translation","task_name":"Translation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1712.09391","atlas_url":"https://app.syntology.ai/?focus=1712.09391","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1712.09391"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1712.09391\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1712.09391"},"call":"get_concepts_for_paper(arxiv_id=\"1712.09391\")"}],"by_repo":[{"repo":"CogComp/arithmetic","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"0ec3f4f8ac0c432c22284e554824e8455066b6bbdac4bf6b6d8c795e9446af13","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}