{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/learning-symbolic-rules-over-abstract-meaning","title":"Learning Symbolic Rules over Abstract Meaning Representations for Textual Reinforcement Learning","arxiv_id":"2307.02689","date":"2023-07-05","proceeding":null,"authors":["Subhajit Chaudhury","Sarathkrishna Swaminathan","Daiki Kimura","Prithviraj Sen","Keerthiram Murugesan","Rosario Uceda-Sosa","Michiaki Tatsubori","Achille Fokoue","Pavan Kapanipathi","Asim Munawar","Alexander Gray"],"abstract":"Text-based reinforcement learning agents have predominantly been neural network-based models with embeddings-based representation, learning uninterpretable policies that often do not generalize well to unseen games. On the other hand, neuro-symbolic methods, specifically those that leverage an intermediate formal representation, are gaining significant attention in language understanding tasks. This is because of their advantages ranging from inherent interpretability, the lesser requirement of training data, and being generalizable in scenarios with unseen data. Therefore, in this paper, we propose a modular, NEuro-Symbolic Textual Agent (NESTA) that combines a generic semantic parser with a rule induction system to learn abstract interpretable rules as policies. Our experiments on established text-based game benchmarks show that the proposed NESTA method outperforms deep reinforcement learning-based techniques by achieving better generalization to unseen test games and learning from fewer training interactions.","url_abs":"https://arxiv.org/abs/2307.02689v1","url_pdf":"https://arxiv.org/pdf/2307.02689v1.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":"learning-symbolic-rules-over-abstract-meaning","repo_url":"https://github.com/ibm/loa","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"deep-reinforcement-learning","task_name":"Deep Reinforcement Learning"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"representation-learning","task_name":"Representation Learning"},{"task_slug":"reinforcement-learning-2","task_name":"reinforcement-learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2307.02689","atlas_url":"https://app.syntology.ai/?focus=2307.02689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.02689"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/ibm/loa","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":5,"unverified":1},"by_repo_kind":{"official":{"samples":6,"ran":5,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"4476d005e0c176f7","entry":"get_formatted_obs_text","repo":"ibm/loa","repo_kind":"official","path":"amr_parser.py","file_url":"https://github.com/ibm/loa/blob/HEAD/amr_parser.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4476d005e0c176f7"}},{"code_sha256_prefix":"a413540a6f34c792","entry":"get_node_id","repo":"ibm/loa","repo_kind":"official","path":"amr_parser.py","file_url":"https://github.com/ibm/loa/blob/HEAD/amr_parser.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"a413540a6f34c792"}},{"code_sha256_prefix":"7be31b4c520794b8","entry":"ground_predicate","repo":"ibm/loa","repo_kind":"official","path":"utils.py","file_url":"https://github.com/ibm/loa/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"7be31b4c520794b8"}},{"code_sha256_prefix":"50c0baee9140f776","entry":"instantiate","repo":"ibm/loa","repo_kind":"official","path":"utils.py","file_url":"https://github.com/ibm/loa/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"50c0baee9140f776"}},{"code_sha256_prefix":"d043534ad59e6029","entry":"is_whitespace","repo":"ibm/loa","repo_kind":"official","path":"utils.py","file_url":"https://github.com/ibm/loa/blob/HEAD/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"d043534ad59e6029"}},{"code_sha256_prefix":"5e66694e0bb9b326","entry":"get_all_admissible_verbs","repo":"ibm/loa","repo_kind":"official","path":"logical_twc.py","file_url":"https://github.com/ibm/loa/blob/HEAD/logical_twc.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"5e66694e0bb9b326"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}