{"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":"/task/logical-reasoning/papers/3","list_of":"/task/logical-reasoning","task":"Logical Reasoning","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":3,"pages_in_order":8,"rows_per_page":100,"rows":[201,300],"of":747,"counts":{"archive_papers_tagged":747,"with_a_code_link":330,"where_syntology_ran_a_sample":113,"not_listed_spam_title":0,"listed":747,"listed_where_code_ran":113,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":96,"every_run_a_failure_of_syntologys_instrument":17,"listed_with_a_run_with_no_instrument_failure":96,"listed_every_run_a_failure_of_syntologys_instrument":17,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/logical-reasoning","prev":"/task/logical-reasoning/papers/2","next":"/task/logical-reasoning/papers/4","papers":[{"url":"/paper/a-survey-of-large-language-models-for-1","slug":"a-survey-of-large-language-models-for-1","title":"LLM4Drive: A Survey of Large Language Models for Autonomous Driving","date":"2023-11-02","arxiv_id":"2311.01043","repositories_listed":1,"syntology":null},{"url":"/paper/noisy-exemplars-make-large-language-models","slug":"noisy-exemplars-make-large-language-models","title":"Noisy Exemplars Make Large Language Models More Robust: A Domain-Agnostic Behavioral Analysis","date":"2023-11-01","arxiv_id":"2311.00258","repositories_listed":1,"syntology":null},{"url":"/paper/dynamics-of-instruction-tuning-each-ability","slug":"dynamics-of-instruction-tuning-each-ability","title":"Dynamics of Instruction Tuning: Each Ability of Large Language Models Has Its Own Growth Pace","date":"2023-10-30","arxiv_id":"2310.19651","repositories_listed":1,"syntology":null},{"url":"/paper/from-indeterminacy-to-determinacy-augmenting","slug":"from-indeterminacy-to-determinacy-augmenting","title":"DetermLR: Augmenting LLM-based Logical Reasoning from Indeterminacy to Determinacy","date":"2023-10-28","arxiv_id":"2310.18659","repositories_listed":1,"syntology":null},{"url":"/paper/poe-process-of-elimination-for-multiple","slug":"poe-process-of-elimination-for-multiple","title":"POE: Process of Elimination for Multiple Choice Reasoning","date":"2023-10-24","arxiv_id":"2310.15575","repositories_listed":1,"syntology":null},{"url":"/paper/breaking-the-language-barrier-improving-cross","slug":"breaking-the-language-barrier-improving-cross","title":"Breaking the Language Barrier: Improving Cross-Lingual Reasoning with Structured Self-Attention","date":"2023-10-23","arxiv_id":"2310.15258","repositories_listed":1,"syntology":null},{"url":"/paper/linc-a-neurosymbolic-approach-for-logical","slug":"linc-a-neurosymbolic-approach-for-logical","title":"LINC: A Neurosymbolic Approach for Logical Reasoning by Combining Language Models with First-Order Logic Provers","date":"2023-10-23","arxiv_id":"2310.15164","repositories_listed":1,"syntology":{"n":7,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/linc-a-neurosymbolic-approach-for-logical#ran","syntology_url":"https://syntology.ai/paper/2310.15164","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.15164"}},"official":{"repos":["benlipkin/linc"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/plan-verify-and-switch-integrated-reasoning","slug":"plan-verify-and-switch-integrated-reasoning","title":"Plan, Verify and Switch: Integrated Reasoning with Diverse X-of-Thoughts","date":"2023-10-23","arxiv_id":"2310.14628","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/plan-verify-and-switch-integrated-reasoning#ran","syntology_url":"https://syntology.ai/paper/2310.14628","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.14628"}},"official":{"repos":["tengxiaoliu/xot"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bongard-openworld-few-shot-reasoning-for-free","slug":"bongard-openworld-few-shot-reasoning-for-free","title":"Bongard-OpenWorld: Few-Shot Reasoning for Free-form Visual Concepts in the Real World","date":"2023-10-16","arxiv_id":"2310.10207","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/bongard-openworld-few-shot-reasoning-for-free#ran","syntology_url":"https://syntology.ai/paper/2310.10207","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.10207"}},"official":{"repos":["joyjayng/Bongard-OpenWorld"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-systematic-evaluation-of-large-language-1","slug":"a-systematic-evaluation-of-large-language-1","title":"Assessing and Enhancing the Robustness of Large Language Models with Task Structure Variations for Logical Reasoning","date":"2023-10-13","arxiv_id":"2310.09430","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/a-systematic-evaluation-of-large-language-1#ran","syntology_url":"https://syntology.ai/paper/2310.09430","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.09430"}},"official":{"repos":["strong-ai-lab/logical-and-abstract-reasoning"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/glore-evaluating-logical-reasoning-of-large","slug":"glore-evaluating-logical-reasoning-of-large","title":"GLoRE: Evaluating Logical Reasoning of Large Language Models","date":"2023-10-13","arxiv_id":"2310.09107","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-teach-large-language-models","slug":"learning-to-teach-large-language-models","title":"Improving Large Language Models in Event Relation Logical Prediction","date":"2023-10-13","arxiv_id":"2310.09158","repositories_listed":1,"syntology":null},{"url":"/paper/empower-nested-boolean-logic-via-self","slug":"empower-nested-boolean-logic-via-self","title":"Empower Nested Boolean Logic via Self-Supervised Curriculum Learning","date":"2023-10-09","arxiv_id":"2310.05450","repositories_listed":1,"syntology":null},{"url":"/paper/decoderlens-layerwise-interpretation-of","slug":"decoderlens-layerwise-interpretation-of","title":"DecoderLens: Layerwise Interpretation of Encoder-Decoder Transformers","date":"2023-10-05","arxiv_id":"2310.03686","repositories_listed":1,"syntology":null},{"url":"/paper/instance-needs-more-care-rewriting-prompts","slug":"instance-needs-more-care-rewriting-prompts","title":"Instances Need More Care: Rewriting Prompts for Instances with LLMs in the Loop Yields Better Zero-Shot Performance","date":"2023-10-03","arxiv_id":"2310.02107","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/instance-needs-more-care-rewriting-prompts#ran","syntology_url":"https://syntology.ai/paper/2310.02107","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.02107"}},"official":{"repos":["salokr/propmted"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dyval-graph-informed-dynamic-evaluation-of","slug":"dyval-graph-informed-dynamic-evaluation-of","title":"DyVal: Dynamic Evaluation of Large Language Models for Reasoning Tasks","date":"2023-09-29","arxiv_id":"2309.17167","repositories_listed":1,"syntology":null},{"url":"/paper/echoprompt-instructing-the-model-to-rephrase","slug":"echoprompt-instructing-the-model-to-rephrase","title":"EchoPrompt: Instructing the Model to Rephrase Queries for Improved In-context Learning","date":"2023-09-16","arxiv_id":"2309.10687","repositories_listed":1,"syntology":null},{"url":"/paper/2309-05936","slug":"2309-05936","title":"Do PLMs Know and Understand Ontological Knowledge?","date":"2023-09-12","arxiv_id":"2309.05936","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":12,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/2309-05936#ran","syntology_url":"https://syntology.ai/paper/2309.05936","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2309.05936"}},"official":{"repos":["vickywu1022/ontoprobe-plms"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/hae-rae-bench-evaluation-of-korean-knowledge","slug":"hae-rae-bench-evaluation-of-korean-knowledge","title":"HAE-RAE Bench: Evaluation of Korean Knowledge in Language Models","date":"2023-09-06","arxiv_id":"2309.02706","repositories_listed":1,"syntology":null},{"url":"/paper/lr-xfl-logical-reasoning-based-explainable","slug":"lr-xfl-logical-reasoning-based-explainable","title":"LR-XFL: Logical Reasoning-based Explainable Federated Learning","date":"2023-08-24","arxiv_id":"2308.12681","repositories_listed":1,"syntology":{"n":8,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/lr-xfl-logical-reasoning-based-explainable#ran","syntology_url":"https://syntology.ai/paper/2308.12681","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.12681"}},"official":{"repos":["yanci87/lr-xfl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/deciphering-raw-data-in-neuro-symbolic","slug":"deciphering-raw-data-in-neuro-symbolic","title":"Deciphering Raw Data in Neuro-Symbolic Learning with Provable Guarantees","date":"2023-08-21","arxiv_id":"2308.10487","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":8,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/deciphering-raw-data-in-neuro-symbolic#ran","syntology_url":"https://syntology.ai/paper/2308.10487","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.10487"}},"official":{"repos":["abductivelearning/abl-tl"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/lateval-an-interactive-llms-evaluation","slug":"lateval-an-interactive-llms-evaluation","title":"LatEval: An Interactive LLMs Evaluation Benchmark with Incomplete Information from Lateral Thinking Puzzles","date":"2023-08-21","arxiv_id":"2308.10855","repositories_listed":1,"syntology":{"n":9,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":9,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/lateval-an-interactive-llms-evaluation#ran","syntology_url":"https://syntology.ai/paper/2308.10855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.10855"}},"official":{"repos":["thukelab/lateval"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/ai-hilbert-from-data-and-background-knowledge","slug":"ai-hilbert-from-data-and-background-knowledge","title":"Evolving Scientific Discovery by Unifying Data and Background Knowledge with AI Hilbert","date":"2023-08-18","arxiv_id":"2308.09474","repositories_listed":1,"syntology":null},{"url":"/paper/how-susceptible-are-llms-to-logical-fallacies","slug":"how-susceptible-are-llms-to-logical-fallacies","title":"How susceptible are LLMs to Logical Fallacies?","date":"2023-08-18","arxiv_id":"2308.09853","repositories_listed":1,"syntology":null},{"url":"/paper/learning-the-meanings-of-function-words-from","slug":"learning-the-meanings-of-function-words-from","title":"Learning the meanings of function words from grounded language using a visual question answering model","date":"2023-08-16","arxiv_id":"2308.08628","repositories_listed":1,"syntology":null},{"url":"/paper/cumulative-reasoning-with-large-language","slug":"cumulative-reasoning-with-large-language","title":"Cumulative Reasoning with Large Language Models","date":"2023-08-08","arxiv_id":"2308.04371","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/cumulative-reasoning-with-large-language#ran","syntology_url":"https://syntology.ai/paper/2308.04371","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.04371"}},"official":{"repos":["iiis-ai/cumulative-reasoning"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/collie-systematic-construction-of-constrained","slug":"collie-systematic-construction-of-constrained","title":"COLLIE: Systematic Construction of Constrained Text Generation Tasks","date":"2023-07-17","arxiv_id":"2307.08689","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/collie-systematic-construction-of-constrained#ran","syntology_url":"https://syntology.ai/paper/2307.08689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.08689"}},"official":{"repos":["princeton-nlp/Collie"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/text-efo-k-cqa-towards-knowledge-graph","slug":"text-efo-k-cqa-towards-knowledge-graph","title":"$\\text{EFO}_{k}$-CQA: Towards Knowledge Graph Complex Query Answering beyond Set Operation","date":"2023-07-15","arxiv_id":"2307.13701","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/text-efo-k-cqa-towards-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2307.13701","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.13701"}},"official":{"repos":["hkust-knowcomp/efok-cqa"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/meta-reasoning-semantics-symbol","slug":"meta-reasoning-semantics-symbol","title":"Meta-Reasoning: Semantics-Symbol Deconstruction for Large Language Models","date":"2023-06-30","arxiv_id":"2306.17820","repositories_listed":1,"syntology":null},{"url":"/paper/idol-indicator-oriented-logic-pre-training","slug":"idol-indicator-oriented-logic-pre-training","title":"IDOL: Indicator-oriented Logic Pre-training for Logical Reasoning","date":"2023-06-27","arxiv_id":"2306.15273","repositories_listed":1,"syntology":null},{"url":"/paper/modeling-hierarchical-reasoning-chains-by-1","slug":"modeling-hierarchical-reasoning-chains-by-1","title":"Modeling Hierarchical Reasoning Chains by Linking Discourse Units and Key Phrases for Reading Comprehension","date":"2023-06-21","arxiv_id":"2306.12069","repositories_listed":1,"syntology":null},{"url":"/paper/are-large-language-models-really-good-logical","slug":"are-large-language-models-really-good-logical","title":"Are Large Language Models Really Good Logical Reasoners? A Comprehensive Evaluation and Beyond","date":"2023-06-16","arxiv_id":"2306.09841","repositories_listed":1,"syntology":null},{"url":"/paper/v-lol-a-diagnostic-dataset-for-visual-logical","slug":"v-lol-a-diagnostic-dataset-for-visual-logical","title":"V-LoL: A Diagnostic Dataset for Visual Logical Learning","date":"2023-06-13","arxiv_id":"2306.07743","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/v-lol-a-diagnostic-dataset-for-visual-logical#ran","syntology_url":"https://syntology.ai/paper/2306.07743","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.07743"}},"official":{"repos":["ml-research/vlol-dataset-gen"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/certified-reasoning-with-language-models","slug":"certified-reasoning-with-language-models","title":"Certified Deductive Reasoning with Language Models","date":"2023-06-06","arxiv_id":"2306.04031","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/certified-reasoning-with-language-models#ran","syntology_url":"https://syntology.ai/paper/2306.04031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.04031"}},"official":null}},{"url":"/paper/deductive-verification-of-chain-of-thought-1","slug":"deductive-verification-of-chain-of-thought-1","title":"Deductive Verification of Chain-of-Thought Reasoning","date":"2023-06-06","arxiv_id":"2306.03872","repositories_listed":1,"syntology":{"n":7,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/deductive-verification-of-chain-of-thought-1#ran","syntology_url":"https://syntology.ai/paper/2306.03872","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03872"}},"official":{"repos":["lz1oceani/verify_cot"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/logiqa-2-0-an-improved-dataset-for-logical","slug":"logiqa-2-0-an-improved-dataset-for-logical","title":"LogiQA 2.0—An Improved Dataset for Logical Reasoning in Natural Language Understanding","date":"2023-06-06","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/indl-a-new-datasets-and-benchmark-for-in","slug":"indl-a-new-datasets-and-benchmark-for-in","title":"InDL: A New Dataset and Benchmark for In-Diagram Logic Interpretation based on Visual Illusion","date":"2023-05-28","arxiv_id":"2305.17716","repositories_listed":1,"syntology":null},{"url":"/paper/synthesizing-a-progression-of-subtasks-for","slug":"synthesizing-a-progression-of-subtasks-for","title":"Synthesizing a Progression of Subtasks for Block-Based Visual Programming Tasks","date":"2023-05-27","arxiv_id":"2305.17518","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-reasoning-testing-language","slug":"counterfactual-reasoning-testing-language","title":"Counterfactual reasoning: Testing language models' understanding of hypothetical scenarios","date":"2023-05-26","arxiv_id":"2305.16572","repositories_listed":1,"syntology":null},{"url":"/paper/unlocking-temporal-question-answering-for","slug":"unlocking-temporal-question-answering-for","title":"Unlocking Temporal Question Answering for Large Language Models with Tailor-Made Reasoning Logic","date":"2023-05-24","arxiv_id":"2305.15014","repositories_listed":1,"syntology":null},{"url":"/paper/query-structure-modeling-for-inductive","slug":"query-structure-modeling-for-inductive","title":"Query Structure Modeling for Inductive Logical Reasoning Over Knowledge Graphs","date":"2023-05-23","arxiv_id":"2305.13585","repositories_listed":1,"syntology":null},{"url":"/paper/logical-reasoning-for-natural-language","slug":"logical-reasoning-for-natural-language","title":"Atomic Inference for NLI with Generated Facts as Atoms","date":"2023-05-22","arxiv_id":"2305.13214","repositories_listed":1,"syntology":null},{"url":"/paper/teaching-probabilistic-logical-reasoning-to","slug":"teaching-probabilistic-logical-reasoning-to","title":"Teaching Probabilistic Logical Reasoning to Transformers","date":"2023-05-22","arxiv_id":"2305.13179","repositories_listed":1,"syntology":null},{"url":"/paper/contrastive-learning-with-logic-driven-data","slug":"contrastive-learning-with-logic-driven-data","title":"Abstract Meaning Representation-Based Logic-Driven Data Augmentation for Logical Reasoning","date":"2023-05-21","arxiv_id":"2305.12599","repositories_listed":1,"syntology":null},{"url":"/paper/logic-lm-empowering-large-language-models","slug":"logic-lm-empowering-large-language-models","title":"Logic-LM: Empowering Large Language Models with Symbolic Solvers for Faithful Logical Reasoning","date":"2023-05-20","arxiv_id":"2305.12295","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/logic-lm-empowering-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2305.12295","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.12295"}},"official":{"repos":["teacherpeterpan/logic-llm"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/logicot-logical-chain-of-thought-instruction","slug":"logicot-logical-chain-of-thought-instruction","title":"LogiCoT: Logical Chain-of-Thought Instruction-Tuning","date":"2023-05-20","arxiv_id":"2305.12147","repositories_listed":1,"syntology":null},{"url":"/paper/scalable-coupling-of-deep-learning-with","slug":"scalable-coupling-of-deep-learning-with","title":"Scalable Coupling of Deep Learning with Logical Reasoning","date":"2023-05-12","arxiv_id":"2305.07617","repositories_listed":1,"syntology":null},{"url":"/paper/not-all-languages-are-created-equal-in-llms","slug":"not-all-languages-are-created-equal-in-llms","title":"Not All Languages Are Created Equal in LLMs: Improving Multilingual Capability by Cross-Lingual-Thought Prompting","date":"2023-05-11","arxiv_id":"2305.07004","repositories_listed":1,"syntology":null},{"url":"/paper/wasserstein-fisher-rao-embedding-logical","slug":"wasserstein-fisher-rao-embedding-logical","title":"Wasserstein-Fisher-Rao Embedding: Logical Query Embeddings with Local Comparison and Global Transport","date":"2023-05-06","arxiv_id":"2305.04034","repositories_listed":1,"syntology":null},{"url":"/paper/improved-logical-reasoning-of-language-models","slug":"improved-logical-reasoning-of-language-models","title":"Improved Logical Reasoning of Language Models via Differentiable Symbolic Programming","date":"2023-05-05","arxiv_id":"2305.03742","repositories_listed":1,"syntology":null},{"url":"/paper/a-neural-divide-and-conquer-reasoning","slug":"a-neural-divide-and-conquer-reasoning","title":"A Neural Divide-and-Conquer Reasoning Framework for Image Retrieval from Linguistically Complex Text","date":"2023-05-03","arxiv_id":"2305.02265","repositories_listed":1,"syntology":null},{"url":"/paper/tackling-universal-properties-of-minimal-trap","slug":"tackling-universal-properties-of-minimal-trap","title":"Tackling Universal Properties of Minimal Trap Spaces of Boolean Networks","date":"2023-05-03","arxiv_id":"2305.02442","repositories_listed":1,"syntology":null},{"url":"/paper/complex-logical-reasoning-over-knowledge","slug":"complex-logical-reasoning-over-knowledge","title":"Complex Logical Reasoning over Knowledge Graphs using Large Language Models","date":"2023-05-02","arxiv_id":"2305.01157","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-recommendation-with-probabilistic","slug":"sequential-recommendation-with-probabilistic","title":"Sequential Recommendation with Probabilistic Logical Reasoning","date":"2023-04-22","arxiv_id":"2304.11383","repositories_listed":1,"syntology":null},{"url":"/paper/chameleon-plug-and-play-compositional","slug":"chameleon-plug-and-play-compositional","title":"Chameleon: Plug-and-Play Compositional Reasoning with Large Language Models","date":"2023-04-19","arxiv_id":"2304.09842","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/chameleon-plug-and-play-compositional#ran","syntology_url":"https://syntology.ai/paper/2304.09842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2304.09842"}},"official":null}},{"url":"/paper/evaluating-the-logical-reasoning-ability-of","slug":"evaluating-the-logical-reasoning-ability-of","title":"Evaluating the Logical Reasoning Ability of ChatGPT and GPT-4","date":"2023-04-07","arxiv_id":"2304.03439","repositories_listed":1,"syntology":null},{"url":"/paper/nature-language-reasoning-a-survey","slug":"nature-language-reasoning-a-survey","title":"Natural Language Reasoning, A Survey","date":"2023-03-26","arxiv_id":"2303.14725","repositories_listed":1,"syntology":null},{"url":"/paper/neural-graph-reasoning-complex-logical-query","slug":"neural-graph-reasoning-complex-logical-query","title":"Neural Graph Reasoning: Complex Logical Query Answering Meets Graph Databases","date":"2023-03-26","arxiv_id":"2303.14617","repositories_listed":1,"syntology":null},{"url":"/paper/logical-reasoning-over-natural-language-as","slug":"logical-reasoning-over-natural-language-as","title":"Logical Reasoning over Natural Language as Knowledge Representation: A Survey","date":"2023-03-21","arxiv_id":"2303.12023","repositories_listed":1,"syntology":null},{"url":"/paper/weakly-supervised-knowledge-transfer-with","slug":"weakly-supervised-knowledge-transfer-with","title":"Weakly Supervised Knowledge Transfer with Probabilistic Logical Reasoning for Object Detection","date":"2023-03-09","arxiv_id":"2303.05148","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":5,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/weakly-supervised-knowledge-transfer-with#ran","syntology_url":"https://syntology.ai/paper/2303.05148","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.05148"}},"official":{"repos":["molden/probkt"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/answering-questions-over-knowledge-graphs","slug":"answering-questions-over-knowledge-graphs","title":"Domain Specific Question Answering Over Knowledge Graphs Using Logical Programming and Large Language Models","date":"2023-03-03","arxiv_id":"2303.02206","repositories_listed":1,"syntology":null},{"url":"/paper/chatcad-interactive-computer-aided-diagnosis","slug":"chatcad-interactive-computer-aided-diagnosis","title":"ChatCAD: Interactive Computer-Aided Diagnosis on Medical Image using Large Language Models","date":"2023-02-14","arxiv_id":"2302.07257","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/chatcad-interactive-computer-aided-diagnosis#ran","syntology_url":"https://syntology.ai/paper/2302.07257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.07257"}},"official":{"repos":["zhaozh10/ChatCAD"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/a-multitask-multilingual-multimodal","slug":"a-multitask-multilingual-multimodal","title":"A Multitask, Multilingual, Multimodal Evaluation of ChatGPT on Reasoning, Hallucination, and Interactivity","date":"2023-02-08","arxiv_id":"2302.04023","repositories_listed":1,"syntology":null},{"url":"/paper/double-permutation-equivariance-for-knowledge","slug":"double-permutation-equivariance-for-knowledge","title":"Double Equivariance for Inductive Link Prediction for Both New Nodes and New Relation Types","date":"2023-02-02","arxiv_id":"2302.01313","repositories_listed":1,"syntology":{"n":6,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 6 unverified","sample_list":"/paper/double-permutation-equivariance-for-knowledge#ran","syntology_url":"https://syntology.ai/paper/2302.01313","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2302.01313"}},"official":{"repos":["purdueminds/isdea"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":[]}}},{"url":"/paper/logical-message-passing-networks-with-one-hop","slug":"logical-message-passing-networks-with-one-hop","title":"Logical Message Passing Networks with One-hop Inference on Atomic Formulas","date":"2023-01-21","arxiv_id":"2301.08859","repositories_listed":1,"syntology":null},{"url":"/paper/mind-reasoning-manners-enhancing-type","slug":"mind-reasoning-manners-enhancing-type","title":"Mind Reasoning Manners: Enhancing Type Perception for Generalized Zero-shot Logical Reasoning over Text","date":"2023-01-08","arxiv_id":"2301.02983","repositories_listed":1,"syntology":null},{"url":"/paper/large-language-models-are-reasoners-with-self","slug":"large-language-models-are-reasoners-with-self","title":"Large Language Models are Better Reasoners with Self-Verification","date":"2022-12-19","arxiv_id":"2212.09561","repositories_listed":1,"syntology":{"n":1,"n_ran":0,"n_constructed":0,"n_ran_checked":0,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"0 ran · 1 unverified","sample_list":"/paper/large-language-models-are-reasoners-with-self#ran","syntology_url":"https://syntology.ai/paper/2212.09561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09561"}},"official":{"repos":["WENGSYX/Self-Verification"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"url":"/paper/on-second-thought-let-s-not-think-step-by","slug":"on-second-thought-let-s-not-think-step-by","title":"On Second Thought, Let's Not Think Step by Step! Bias and Toxicity in Zero-Shot Reasoning","date":"2022-12-15","arxiv_id":"2212.08061","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/on-second-thought-let-s-not-think-step-by#ran","syntology_url":"https://syntology.ai/paper/2212.08061","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.08061"}},"official":{"repos":["salt-nlp/chain-of-thought-bias"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-high-order-complementary","slug":"towards-high-order-complementary","title":"Towards High-Order Complementary Recommendation via Logical Reasoning Network","date":"2022-12-09","arxiv_id":"2212.04966","repositories_listed":1,"syntology":null},{"url":"/paper/counterfactual-reasoning-do-language-models","slug":"counterfactual-reasoning-do-language-models","title":"Counterfactual reasoning: Do language models need world knowledge for causal understanding?","date":"2022-12-06","arxiv_id":"2212.03278","repositories_listed":1,"syntology":null},{"url":"/paper/weisfeiler-and-leman-go-relational","slug":"weisfeiler-and-leman-go-relational","title":"Weisfeiler and Leman Go Relational","date":"2022-11-30","arxiv_id":"2211.17113","repositories_listed":1,"syntology":null},{"url":"/paper/nqe-n-ary-query-embedding-for-complex-query","slug":"nqe-n-ary-query-embedding-for-complex-query","title":"NQE: N-ary Query Embedding for Complex Query Answering over Hyper-Relational Knowledge Graphs","date":"2022-11-24","arxiv_id":"2211.13469","repositories_listed":1,"syntology":null},{"url":"/paper/logical-tasks-for-measuring-extrapolation-and","slug":"logical-tasks-for-measuring-extrapolation-and","title":"Logical Tasks for Measuring Extrapolation and Rule Comprehension","date":"2022-11-14","arxiv_id":"2211.07727","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/logical-tasks-for-measuring-extrapolation-and#ran","syntology_url":"https://syntology.ai/paper/2211.07727","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.07727"}},"official":{"repos":["ifujisawa/addition-experiment"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/zero-shot-classification-by-logical-reasoning","slug":"zero-shot-classification-by-logical-reasoning","title":"Zero-Shot Classification by Logical Reasoning on Natural Language Explanations","date":"2022-11-07","arxiv_id":"2211.03252","repositories_listed":1,"syntology":null},{"url":"/paper/gammae-gamma-embeddings-for-logical-queries","slug":"gammae-gamma-embeddings-for-logical-queries","title":"GammaE: Gamma Embeddings for Logical Queries on Knowledge Graphs","date":"2022-10-27","arxiv_id":"2210.15578","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":3,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gammae-gamma-embeddings-for-logical-queries#ran","syntology_url":"https://syntology.ai/paper/2210.15578","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.15578"}},"official":{"repos":["dyang67/GammaE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/tape-assessing-few-shot-russian-language","slug":"tape-assessing-few-shot-russian-language","title":"TAPE: Assessing Few-shot Russian Language Understanding","date":"2022-10-23","arxiv_id":"2210.12813","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-logical-query-answering-in","slug":"inductive-logical-query-answering-in","title":"Inductive Logical Query Answering in Knowledge Graphs","date":"2022-10-13","arxiv_id":"2210.08008","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/inductive-logical-query-answering-in#ran","syntology_url":"https://syntology.ai/paper/2210.08008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08008"}},"official":null}},{"url":"/paper/document-level-biomedical-relation-extraction","slug":"document-level-biomedical-relation-extraction","title":"Document-level Biomedical Relation Extraction Based on Multi-Dimensional Fusion Information and Multi-Granularity Logical Reasoning","date":"2022-10-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/neural-methods-for-logical-reasoning-over-1","slug":"neural-methods-for-logical-reasoning-over-1","title":"Neural Methods for Logical Reasoning Over Knowledge Graphs","date":"2022-09-28","arxiv_id":"2209.14464","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-methods-for-logical-reasoning-over-1#ran","syntology_url":"https://syntology.ai/paper/2209.14464","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.14464"}},"official":{"repos":["amayuelas/NNKGReasoning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/folio-natural-language-reasoning-with-first","slug":"folio-natural-language-reasoning-with-first","title":"FOLIO: Natural Language Reasoning with First-Order Logic","date":"2022-09-02","arxiv_id":"2209.00840","repositories_listed":1,"syntology":null},{"url":"/paper/language-models-show-human-like-content","slug":"language-models-show-human-like-content","title":"Language models show human-like content effects on reasoning tasks","date":"2022-07-14","arxiv_id":"2207.07051","repositories_listed":1,"syntology":null},{"url":"/paper/learning-symmetric-rules-with-satnet","slug":"learning-symmetric-rules-with-satnet","title":"Learning Symmetric Rules with SATNet","date":"2022-06-28","arxiv_id":"2206.13998","repositories_listed":1,"syntology":null},{"url":"/paper/semantic-probabilistic-layers-for-neuro","slug":"semantic-probabilistic-layers-for-neuro","title":"Semantic Probabilistic Layers for Neuro-Symbolic Learning","date":"2022-06-01","arxiv_id":"2206.00426","repositories_listed":1,"syntology":null},{"url":"/paper/tflex-temporal-feature-logic-embedding-1","slug":"tflex-temporal-feature-logic-embedding-1","title":"TFLEX: Temporal Feature-Logic Embedding Framework for Complex Reasoning over Temporal Knowledge Graph","date":"2022-05-28","arxiv_id":"2205.14307","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/tflex-temporal-feature-logic-embedding-1#ran","syntology_url":"https://syntology.ai/paper/2205.14307","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.14307"}},"official":{"repos":["linxueyuanstdio/tflex"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/robustlr-evaluating-robustness-to-logical","slug":"robustlr-evaluating-robustness-to-logical","title":"RobustLR: Evaluating Robustness to Logical Perturbation in Deductive Reasoning","date":"2022-05-25","arxiv_id":"2205.12598","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/robustlr-evaluating-robustness-to-logical#ran","syntology_url":"https://syntology.ai/paper/2205.12598","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.12598"}},"official":{"repos":["ink-usc/robustlr"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/flex-feature-logic-embedding-framework-for","slug":"flex-feature-logic-embedding-framework-for","title":"FLEX: Feature-Logic Embedding Framework for CompleX Knowledge Graph Reasoning","date":"2022-05-23","arxiv_id":"2205.11039","repositories_listed":1,"syntology":null},{"url":"/paper/logical-reasoning-with-span-predictions-span","slug":"logical-reasoning-with-span-predictions-span","title":"Logical Reasoning with Span-Level Predictions for Interpretable and Robust NLI Models","date":"2022-05-23","arxiv_id":"2205.11432","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/logical-reasoning-with-span-predictions-span#ran","syntology_url":"https://syntology.ai/paper/2205.11432","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.11432"}},"official":{"repos":["joestacey/snli_logic"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-paradox-of-learning-to-reason-from","slug":"on-the-paradox-of-learning-to-reason-from","title":"On the Paradox of Learning to Reason from Data","date":"2022-05-23","arxiv_id":"2205.11502","repositories_listed":1,"syntology":{"n":10,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/on-the-paradox-of-learning-to-reason-from#ran","syntology_url":"https://syntology.ai/paper/2205.11502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.11502"}},"official":{"repos":["joshuacnf/paradox-learning2reason"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/logigan-learning-logical-reasoning-via","slug":"logigan-learning-logical-reasoning-via","title":"LogiGAN: Learning Logical Reasoning via Adversarial Pre-training","date":"2022-05-18","arxiv_id":"2205.08794","repositories_listed":1,"syntology":null},{"url":"/paper/logiformer-a-two-branch-graph-transformer","slug":"logiformer-a-two-branch-graph-transformer","title":"Logiformer: A Two-Branch Graph Transformer Network for Interpretable Logical Reasoning","date":"2022-05-02","arxiv_id":"2205.00731","repositories_listed":1,"syntology":null},{"url":"/paper/table-based-fact-verification-with-self-1","slug":"table-based-fact-verification-with-self-1","title":"Table-based Fact Verification with Self-adaptive Mixture of Experts","date":"2022-04-19","arxiv_id":"2204.08753","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/table-based-fact-verification-with-self-1#ran","syntology_url":"https://syntology.ai/paper/2204.08753","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.08753"}},"official":{"repos":["thumlp/samoe"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/abductionrules-training-transformers-to-1","slug":"abductionrules-training-transformers-to-1","title":"AbductionRules: Training Transformers to Explain Unexpected Inputs","date":"2022-03-23","arxiv_id":"2203.12186","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/abductionrules-training-transformers-to-1#ran","syntology_url":"https://syntology.ai/paper/2203.12186","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.12186"}},"official":{"repos":["strong-ai-lab/abductionrules"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/chartqa-a-benchmark-for-question-answering","slug":"chartqa-a-benchmark-for-question-answering","title":"ChartQA: A Benchmark for Question Answering about Charts with Visual and Logical Reasoning","date":"2022-03-19","arxiv_id":"2203.10244","repositories_listed":1,"syntology":null},{"url":"/paper/fairr-faithful-and-robust-deductive-reasoning-1","slug":"fairr-faithful-and-robust-deductive-reasoning-1","title":"FaiRR: Faithful and Robust Deductive Reasoning over Natural Language","date":"2022-03-19","arxiv_id":"2203.10261","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fairr-faithful-and-robust-deductive-reasoning-1#ran","syntology_url":"https://syntology.ai/paper/2203.10261","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10261"}},"official":{"repos":["ink-usc/fairr"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/adalogn-adaptive-logic-graph-network-for","slug":"adalogn-adaptive-logic-graph-network-for","title":"AdaLoGN: Adaptive Logic Graph Network for Reasoning-Based Machine Reading Comprehension","date":"2022-03-16","arxiv_id":"2203.08992","repositories_listed":1,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/adalogn-adaptive-logic-graph-network-for#ran","syntology_url":"https://syntology.ai/paper/2203.08992","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.08992"}},"official":{"repos":["nju-websoft/adalogn"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/what-makes-reading-comprehension-questions-2","slug":"what-makes-reading-comprehension-questions-2","title":"What Makes Reading Comprehension Questions Difficult?","date":"2022-03-12","arxiv_id":"2203.06342","repositories_listed":1,"syntology":null},{"url":"/paper/merit-meta-path-guided-contrastive-learning","slug":"merit-meta-path-guided-contrastive-learning","title":"MERIt: Meta-Path Guided Contrastive Learning for Logical Reasoning","date":"2022-03-01","arxiv_id":"2203.00357","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":2,"n_ran_checked":2,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"5 ran (of which 2 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/merit-meta-path-guided-contrastive-learning#ran","syntology_url":"https://syntology.ai/paper/2203.00357","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.00357"}},"official":{"repos":["sparkjiao/merit"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/exais-executable-ai-semantics","slug":"exais-executable-ai-semantics","title":"ExAIS: Executable AI Semantics","date":"2022-02-20","arxiv_id":"2202.09868","repositories_listed":1,"syntology":null},{"url":"/paper/end-to-end-algorithm-synthesis-with-recurrent","slug":"end-to-end-algorithm-synthesis-with-recurrent","title":"End-to-end Algorithm Synthesis with Recurrent Networks: Logical Extrapolation Without Overthinking","date":"2022-02-11","arxiv_id":"2202.05826","repositories_listed":1,"syntology":{"n":18,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":15,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 15 unverified","sample_list":"/paper/end-to-end-algorithm-synthesis-with-recurrent#ran","syntology_url":"https://syntology.ai/paper/2202.05826","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.05826"}},"official":{"repos":["aks2203/deep-thinking"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":15,"ran_from_kinds":["official"]}}},{"url":"/paper/vael-bridging-variational-autoencoders-and","slug":"vael-bridging-variational-autoencoders-and","title":"VAEL: Bridging Variational Autoencoders and Probabilistic Logic Programming","date":"2022-02-07","arxiv_id":"2202.04178","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/vael-bridging-variational-autoencoders-and#ran","syntology_url":"https://syntology.ai/paper/2202.04178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2202.04178"}},"official":{"repos":["elemisi/vael"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}}],"record_sha256":"22a77492d2e0ebd61209a78b546ae1f56393d20112b032b8b2f793f9148228f2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}