{"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/formal-logic","name":"Formal Logic","slug":"formal-logic","description_markdown":null,"categories":[{"name":"Knowledge Base","url":"/area/knowledge-base"},{"name":"Natural Language Processing","url":"/area/natural-language-processing"},{"name":"Reasoning","url":"/area/reasoning"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":73,"papers_with_code":20,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":3,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/formal-logic-on-big-bench","slug":"formal-logic-on-big-bench","dataset":"BIG-bench","dataset_url":"/dataset/big-bench","rows_in_archive":1,"metrics":["Accuracy"],"first_row_in_archive_order":{"model":"Gopher-280B (few-shot, k=5)","paper_title":"Scaling Language Models: Methods, Analysis & Insights from Training Gopher","paper_url":"/paper/scaling-language-models-methods-analysis-1","paper_date":"2021-12-08","arxiv_id":"2112.11446","code_links":[{"title":"allenai/dolma","url":"https://github.com/allenai/dolma"},{"title":"rvlopes/gloria","url":"https://github.com/rvlopes/gloria"},{"title":"bramiozo/PubScience","url":"https://github.com/bramiozo/PubScience"}],"syntology":null}}],"datasets":[{"url":"/dataset/big-bench","name":"BIG-bench","full_name":"Beyond the Imitation Game Benchmark","num_papers_in_archive":349},{"url":"/dataset/mindgames","name":"Mindgames","full_name":"","num_papers_in_archive":4},{"url":"/dataset/probability-words-nli-1","name":"probability_words_nli","full_name":"","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/mathematical-reasoning","name":"Mathematical Reasoning"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":73,"of":73,"of_with_code":20,"tagged_in_all":73,"counts":{"archive_papers_tagged":73,"with_a_code_link":20,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":73,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":3,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":3,"listed_every_run_a_failure_of_syntologys_instrument":0,"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"},"items":[{"url":"/paper/learning-deductive-reasoning-from-synthetic","slug":"learning-deductive-reasoning-from-synthetic","title":"Learning Deductive Reasoning from Synthetic Corpus based on Formal Logic","date":"2023-08-11","arxiv_id":"2308.07336","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"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 0 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","sample_list":"/paper/learning-deductive-reasoning-from-synthetic#ran","syntology_url":"https://syntology.ai/paper/2308.07336","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.07336"}},"official":{"repos":["hitachi-nlp/fld"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/scaling-language-models-methods-analysis-1","slug":"scaling-language-models-methods-analysis-1","title":"Scaling Language Models: Methods, Analysis & Insights from Training Gopher","date":"2021-12-08","arxiv_id":"2112.11446","repositories_listed":3,"syntology":null},{"url":"/paper/enhancing-reasoning-capabilities-of-llms-via","slug":"enhancing-reasoning-capabilities-of-llms-via","title":"Enhancing Reasoning Capabilities of LLMs via Principled Synthetic Logic Corpus","date":"2024-11-19","arxiv_id":"2411.12498","repositories_listed":2,"syntology":null},{"url":"/paper/learning-symbolic-rules-for-reasoning-in-1","slug":"learning-symbolic-rules-for-reasoning-in-1","title":"Learning Symbolic Rules for Reasoning in Quasi-Natural Language","date":"2021-11-23","arxiv_id":"2111.12038","repositories_listed":2,"syntology":null},{"url":"/paper/are-llms-reliable-translators-of-logical","slug":"are-llms-reliable-translators-of-logical","title":"Are LLMs Reliable Translators of Logical Reasoning Across Lexically Diversified Contexts?","date":"2025-06-05","arxiv_id":"2506.04575","repositories_listed":1,"syntology":null},{"url":"/paper/training-step-level-reasoning-verifiers-with","slug":"training-step-level-reasoning-verifiers-with","title":"Training Step-Level Reasoning Verifiers with Formal Verification Tools","date":"2025-05-21","arxiv_id":"2505.15960","repositories_listed":1,"syntology":null},{"url":"/paper/cot-tl-low-resource-temporal-knowledge","slug":"cot-tl-low-resource-temporal-knowledge","title":"CoT-TL: Low-Resource Temporal Knowledge Representation of Planning Instructions Using Chain-of-Thought Reasoning","date":"2024-10-21","arxiv_id":"2410.16207","repositories_listed":1,"syntology":null},{"url":"/paper/autoformalization-of-game-descriptions-using","slug":"autoformalization-of-game-descriptions-using","title":"Autoformalization of Game Descriptions using Large Language Models","date":"2024-09-18","arxiv_id":"2409.12300","repositories_listed":1,"syntology":null},{"url":"/paper/logic-enhanced-language-model-agents-for","slug":"logic-enhanced-language-model-agents-for","title":"Towards Logically Sound Natural Language Reasoning with Logic-Enhanced Language Model Agents","date":"2024-08-28","arxiv_id":"2408.16081","repositories_listed":1,"syntology":null},{"url":"/paper/ai-driven-statutory-reasoning-via-software","slug":"ai-driven-statutory-reasoning-via-software","title":"Software Engineering Methods For AI-Driven Deductive Legal Reasoning","date":"2024-04-15","arxiv_id":"2404.09868","repositories_listed":1,"syntology":null},{"url":"/paper/realcqa-scientific-chart-question-answering","slug":"realcqa-scientific-chart-question-answering","title":"RealCQA: Scientific Chart Question Answering as a Test-bed for First-Order Logic","date":"2023-08-03","arxiv_id":"2308.01979","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-large-language-models-to-generate","slug":"leveraging-large-language-models-to-generate","title":"Leveraging Large Language Models to Generate Answer Set Programs","date":"2023-07-15","arxiv_id":"2307.07699","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/leveraging-large-language-models-to-generate#ran","syntology_url":"https://syntology.ai/paper/2307.07699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.07699"}},"official":{"repos":["azreasoners/gpt-asp-rules"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/harnessing-the-power-of-large-language-models","slug":"harnessing-the-power-of-large-language-models","title":"Harnessing the Power of Large Language Models for Natural Language to First-Order Logic Translation","date":"2023-05-24","arxiv_id":"2305.15541","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"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) · 0 unverified","sample_list":"/paper/harnessing-the-power-of-large-language-models#ran","syntology_url":"https://syntology.ai/paper/2305.15541","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2305.15541"}},"official":{"repos":["gblackout/logicllama"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/nanopublication-based-semantic-publishing-and","slug":"nanopublication-based-semantic-publishing-and","title":"Nanopublication-Based Semantic Publishing and Reviewing: A Field Study with Formalization Papers","date":"2022-03-03","arxiv_id":"2203.01608","repositories_listed":1,"syntology":null},{"url":"/paper/design-of-quantum-optical-experiments-with","slug":"design-of-quantum-optical-experiments-with","title":"Design of quantum optical experiments with logic artificial intelligence","date":"2021-09-27","arxiv_id":"2109.13273","repositories_listed":1,"syntology":null},{"url":"/paper/satisfiability-and-containment-of-recursive","slug":"satisfiability-and-containment-of-recursive","title":"Satisfiability and Containment of Recursive SHACL","date":"2021-08-30","arxiv_id":"2108.13063","repositories_listed":1,"syntology":null},{"url":"/paper/negation-in-cognitive-reasoning","slug":"negation-in-cognitive-reasoning","title":"Negation in Cognitive Reasoning","date":"2020-12-23","arxiv_id":"2012.12641","repositories_listed":1,"syntology":null},{"url":"/paper/bits-and-pieces-understanding-information","slug":"bits-and-pieces-understanding-information","title":"Bits and Pieces: Understanding Information Decomposition from Part-whole Relationships and Formal Logic","date":"2020-08-21","arxiv_id":"2008.09535","repositories_listed":1,"syntology":null},{"url":"/paper/leveraging-rust-types-for-modular","slug":"leveraging-rust-types-for-modular","title":"Leveraging Rust types for modular specification and verification","date":"2019-10-10","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/lectures-on-jacques-herbrand-as-a-logician","slug":"lectures-on-jacques-herbrand-as-a-logician","title":"Lectures on Jacques Herbrand as a Logician","date":"2009-02-26","arxiv_id":"0902.4682","repositories_listed":1,"syntology":null},{"url":null,"slug":"ltlcrit-a-temporal-logic-based-llm-critic-for","title":"LTLCrit: A Temporal Logic-based LLM Critic for Safe and Efficient Embodied Agents","date":"2025-07-04","arxiv_id":"2507.03293","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-immutable-memory-systems-for-artificial","title":"On Immutable Memory Systems for Artificial Agents: A Blockchain-Indexed Automata-Theoretic Framework Using ECDH-Keyed Merkle Chains","date":"2025-06-16","arxiv_id":"2506.13246","repositories_listed":0,"syntology":null},{"url":null,"slug":"alpay-algebra-iii-observer-coupled-collapse","title":"Alpay Algebra III: Observer-Coupled Collapse and the Temporal Drift of Identity","date":"2025-05-26","arxiv_id":"2505.19790","repositories_listed":0,"syntology":null},{"url":null,"slug":"reasoning-under-threat-symbolic-and-neural","title":"Reasoning Under Threat: Symbolic and Neural Techniques for Cybersecurity Verification","date":"2025-03-27","arxiv_id":"2503.22755","repositories_listed":0,"syntology":null},{"url":null,"slug":"unveiling-the-mathematical-reasoning-in","title":"Evaluating Mathematical Reasoning Across Large Language Models: A Fine-Grained Approach","date":"2025-03-13","arxiv_id":"2503.10573","repositories_listed":0,"syntology":null},{"url":null,"slug":"building-knowledge-graphs-towards-a-global","title":"Building Knowledge Graphs Towards a Global Food Systems Datahub","date":"2025-02-26","arxiv_id":"2502.19507","repositories_listed":0,"syntology":null},{"url":null,"slug":"linguistic-generalizations-are-not-rules","title":"Linguistic Generalizations are not Rules: Impacts on Evaluation of LMs","date":"2025-02-18","arxiv_id":"2502.13195","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-integration-strategies-in","title":"Knowledge Integration Strategies in Autonomous Vehicle Prediction and Planning: A Comprehensive Survey","date":"2025-02-13","arxiv_id":"2502.10477","repositories_listed":0,"syntology":null},{"url":null,"slug":"automating-mathematical-proof-generation","title":"Automating Mathematical Proof Generation Using Large Language Model Agents and Knowledge Graphs","date":"2025-02-04","arxiv_id":"2503.11657","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-an-llm-swarm-to-a-pddl-empowered-hive","title":"From An LLM Swarm To A PDDL-Empowered HIVE: Planning Self-Executed Instructions In A Multi-Modal Jungle","date":"2024-12-17","arxiv_id":"2412.12839","repositories_listed":0,"syntology":null},{"url":null,"slug":"formal-logic-guided-robust-federated-learning","title":"Formal Logic-guided Robust Federated Learning against Poisoning Attacks","date":"2024-11-05","arxiv_id":"2411.03231","repositories_listed":0,"syntology":null},{"url":null,"slug":"interchangeable-token-embeddings-for","title":"Interchangeable Token Embeddings for Extendable Vocabulary and Alpha-Equivalence","date":"2024-10-22","arxiv_id":"2410.17161","repositories_listed":0,"syntology":null},{"url":null,"slug":"rulebreakers-challenge-revealing-a-blind-spot","title":"Rulebreakers Challenge: Revealing a Blind Spot in Large Language Models' Reasoning with Formal Logic","date":"2024-10-21","arxiv_id":"2410.16502","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-deductive-reasoning-with-step","title":"Boosting Deductive Reasoning with Step Signals In RLHF","date":"2024-10-12","arxiv_id":"2410.09528","repositories_listed":0,"syntology":null},{"url":null,"slug":"proof-of-thought-neurosymbolic-program","title":"Proof of Thought : Neurosymbolic Program Synthesis allows Robust and Interpretable Reasoning","date":"2024-09-25","arxiv_id":"2409.17270","repositories_listed":0,"syntology":null},{"url":null,"slug":"proslm-a-prolog-synergized-language-model-for","title":"ProSLM : A Prolog Synergized Language Model for explainable Domain Specific Knowledge Based Question Answering","date":"2024-09-17","arxiv_id":"2409.11589","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-theorem-provers-help-improve-large","title":"Automated Theorem Provers Help Improve Large Language Model Reasoning","date":"2024-08-07","arxiv_id":"2408.03492","repositories_listed":0,"syntology":null},{"url":null,"slug":"networks-of-networks-complexity-class","title":"Networks of Networks: Complexity Class Principles Applied to Compound AI Systems Design","date":"2024-07-23","arxiv_id":"2407.16831","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-data-to-commonsense-reasoning-the-use-of","title":"From Data to Commonsense Reasoning: The Use of Large Language Models for Explainable AI","date":"2024-07-04","arxiv_id":"2407.03778","repositories_listed":0,"syntology":null},{"url":null,"slug":"discussion-graph-semantics-of-first-order","title":"Discussion Graph Semantics of First-Order Logic with Equality for Reasoning about Discussion and Argumentation","date":"2024-06-18","arxiv_id":"2406.12163","repositories_listed":0,"syntology":null},{"url":null,"slug":"enforcing-temporal-constraints-on-generative","title":"Procedural Adherence and Interpretability Through Neuro-Symbolic Generative Agents","date":"2024-02-24","arxiv_id":"2402.16905","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-systematic-decompositional-natural","title":"Enhancing Systematic Decompositional Natural Language Inference Using Informal Logic","date":"2024-02-22","arxiv_id":"2402.14798","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-of-abstraction-for-a-unified-1","title":"Inference of Abstraction for a Unified Account of Reasoning and Learning","date":"2024-02-14","arxiv_id":"2402.09046","repositories_listed":0,"syntology":null},{"url":null,"slug":"inference-of-abstraction-for-a-unified","title":"Inference of Abstraction for a Unified Account of Symbolic Reasoning from Data","date":"2024-02-13","arxiv_id":"2402.08646","repositories_listed":0,"syntology":null},{"url":null,"slug":"socrasynth-multi-llm-reasoning-with","title":"SocraSynth: Multi-LLM Reasoning with Conditional Statistics","date":"2024-01-19","arxiv_id":"2402.06634","repositories_listed":0,"syntology":null},{"url":null,"slug":"formal-logic-enabled-personalized-federated","title":"Formal Logic Enabled Personalized Federated Learning Through Property Inference","date":"2024-01-15","arxiv_id":"2401.07448","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-simple-generative-model-of-logical","title":"A Simple Generative Model of Logical Reasoning and Statistical Learning","date":"2023-05-18","arxiv_id":"2305.11098","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-logic-with-time-beyond-logical","title":"Generative Logic with Time: Beyond Logical Consistency and Statistical Possibility","date":"2023-01-20","arxiv_id":"2301.08509","repositories_listed":0,"syntology":null},{"url":null,"slug":"proceedings-of-the-2nd-workshop-on-logic-and","title":"Proceedings of the 2nd Workshop on Logic and Practice of Programming (LPOP)","date":"2022-11-17","arxiv_id":"2211.09923","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentiable-logics-for-neural-network","title":"Differentiable Logics for Neural Network Training and Verification","date":"2022-07-14","arxiv_id":"2207.06741","repositories_listed":0,"syntology":null},{"url":null,"slug":"interactive-learning-from-natural-language","title":"Interactive Learning from Natural Language and Demonstrations using Signal Temporal Logic","date":"2022-07-01","arxiv_id":"2207.00627","repositories_listed":0,"syntology":null},{"url":null,"slug":"logical-story-representations-via-framenet-1","title":"Logical Story Representations via FrameNet + Semantic Parsing","date":"2022-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stateless-and-rule-based-verification-for","title":"Stateless and Rule-Based Verification For Compliance Checking Applications","date":"2022-04-14","arxiv_id":"2204.07430","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-unifying-logical-entailment-and","title":"Towards Unifying Logical Entailment and Statistical Estimation","date":"2022-02-27","arxiv_id":"2202.13406","repositories_listed":0,"syntology":null},{"url":null,"slug":"logical-story-representations-via-framenet","title":"Logical Story Representations via FrameNet + Semantic Parsing","date":"2022-01-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-spatio-temporal-specifications-for","title":"Learning Spatio-Temporal Specifications for Dynamical Systems","date":"2021-12-20","arxiv_id":"2112.10714","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-enactivist-account-of-mind-reading-in","title":"An Enactivist account of Mind Reading in Natural Language Understanding","date":"2021-11-11","arxiv_id":"2111.06179","repositories_listed":0,"syntology":null},{"url":null,"slug":"visual-question-answering-based-on-formal","title":"Visual Question Answering based on Formal Logic","date":"2021-11-08","arxiv_id":"2111.04785","repositories_listed":0,"syntology":null},{"url":null,"slug":"expressing-high-level-scientific-claims-with","title":"Expressing High-Level Scientific Claims with Formal Semantics","date":"2021-09-27","arxiv_id":"2109.12907","repositories_listed":0,"syntology":null},{"url":null,"slug":"lgpsolver-solving-logic-grid-puzzles","title":"LGPSolver - Solving Logic Grid Puzzles Automatically","date":"2020-11-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-theory-of-hypergames-on-graphs-for","title":"A Theory of Hypergames on Graphs for Synthesizing Dynamic Cyber Defense with Deception","date":"2020-08-07","arxiv_id":"2008.03210","repositories_listed":0,"syntology":null},{"url":null,"slug":"inferences-and-modal-vocabulary","title":"Inferences and Modal Vocabulary","date":"2020-07-06","arxiv_id":"2007.02487","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-common-sense","title":"Machine Common Sense","date":"2020-06-15","arxiv_id":"2006.08409","repositories_listed":0,"syntology":null},{"url":null,"slug":"simple-dataset-for-proof-method","title":"Simple Dataset for Proof Method Recommendation in Isabelle/HOL (Dataset Description)","date":"2020-04-21","arxiv_id":"2004.10667","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-the-engineering-of-virtuous-machines","title":"Toward the Engineering of Virtuous Machines","date":"2018-12-07","arxiv_id":"1812.03868","repositories_listed":0,"syntology":null},{"url":null,"slug":"consistent-ccg-parsing-over-multiple","title":"Consistent CCG Parsing over Multiple Sentences for Improved Logical Reasoning","date":"2018-04-19","arxiv_id":"1804.07068","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-representation-learning-with-logic","title":"Combining Representation Learning with Logic for Language Processing","date":"2017-12-27","arxiv_id":"1712.09687","repositories_listed":0,"syntology":null},{"url":null,"slug":"building-multimodal-simulations-for-natural","title":"Building Multimodal Simulations for Natural Language","date":"2017-04-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"principles-and-examples-of-plausible","title":"Principles and Examples of Plausible Reasoning and Propositional Plausible Logic","date":"2017-03-06","arxiv_id":"1703.01697","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-algorithm-of-islamic-jurisprudence-fiqh","title":"The Algorithm of Islamic Jurisprudence (Fiqh) with Validation of an Entscheidungsproblem","date":"2016-03-10","arxiv_id":"1604.00266","repositories_listed":0,"syntology":null},{"url":null,"slug":"service-choreography-sbvr-and-time","title":"Service Choreography, SBVR, and Time","date":"2015-12-24","arxiv_id":"1512.07685","repositories_listed":0,"syntology":null},{"url":null,"slug":"implementation-of-an-automatic-sign-language","title":"Implementation of an Automatic Sign Language Lexical Annotation Framework based on Propositional Dynamic Logic","date":"2014-03-25","arxiv_id":"1403.6392","repositories_listed":0,"syntology":null},{"url":null,"slug":"dlolis-a-description-logic-based-text","title":"DLOLIS-A: Description Logic based Text Ontology Learning","date":"2013-03-24","arxiv_id":"1303.5929","repositories_listed":0,"syntology":null}],"syntology_records":3,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"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)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":3,"papers_where_code_ran_first_page":"/task/formal-logic/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/formal-logic/papers/ran/1","json":"/task/formal-logic/papers/ran/1.json","rows":3}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"4f1bb98935a16c6aa2e89fdffb59ad160ed6739d2663c572b7fecfe7dc7c663e","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}