Awesome Logic in Computer Science

Key papers

• Towards Autonomous Mechanistic Reasoning in Virtual Cells (2026)
  Yunhui Jang et al.
  7.58
• La representaci\'on de la variaci\'on contextual mediante definiciones terminol\'ogicas flexibles (2016)
  Antonio San Mart\'in
  6.34
• A homotopy-type-theoretic generalization of neurosymbolic inference (2026)
  Fernando Zhapa-Camacho et al.
  5.49
• ZX-Calculus:Trace-Indexed Dependent Types and Epistemic Semantics (2026)
  Peng Chen
  4.39
• Towards Non-Monotonic Entailment in Propositional Defeasible Standpoint Logic (2026)
  Nicholas Leisegang et al.
  4.39
• veriFIRE: an Industrial Case Study in Verifying Consistency Properties for a DNN-Based Wildfire Detection System (2026)
  Idan Refaeli et al.
  4.39
• Towards a Bridge Layer Between Bibliographic and Formalized Mathematical Knowledge (2026)
  A. Mayeux
  4.39
• Transforming Shape Schemas with Composable Property-Graph Queries (Extended Version) (2026)
  Philipp Seifer et al.
  4.39
• Flood and Harvest: The Provable Necessity of Trivia for Generating Valuable Mathematics via the Lens of Language Generation in the Limit (2026)
  Xiaoyu Li et al.
  4.39
• Simplifying the Modeling of Arbitrary Conditionals in Natural Language (2026)
  Yinhan Lu et al.
  4.39
• Provenance-Enhanced Statements in Knowledge Graphs (2026)
  Fabio Vitali et al.
  4.39
• The algebra of Krom logic programs (2026)
  Christian Anti\'c
  4.39
• Polynomial-Time Mistake-Bounded Language Generation (2026)
  H\'ector Jimenez et al.
  4.39
• The Faithfulness Gap: Certifying Semantic Equivalence Between Natural-Language and Formal Mathematical Statements (2026)
  Noor Islam S. Mohammad et al.
  4.39
• Symbolic Informalization: Fluent, Productive, Multilingual (2026)
  Aarne Ranta
  4.39
• Demystifying Variance in Circuit Discovery of LLMs (2026)
  Frank Zhengqing Wu et al.
  4.39
• The More the Merrier: Combining Properties for ABox Abduction under Repair Semantics for ELbot (2026)
  Anselm Haak et al.
  4.39
• LECTOR: Joint Optimization of Scientific Reasoning Graphs and Introduction Generation (2026)
  Jiabei Xiao et al.
  4.33
• From Reasoning Chains to Verifiable Subproblems: Curriculum Reinforcement Learning Enables Credit Assignment for LLM Reasoning (2026)
  Xitai Jiang et al.
  4.31
• (Auto)formalization is supposed to be easy: Trellis process semantics for spelling out rigorous proofs (2026)
  Wesley Pegden
  3.51
• A Definition of Good Explanations and the Challenges Explaining LLM Outputs (2026)
  Louis Mahon et al.
  3.51
• MerLean-Prover: A Recursive Looping Harness for Lean 4 Theorem Proving (2026)
  Jinzheng Li et al.
  3.45
• On the Generalization Bounds of Symbolic Regression with Genetic Programming (2026)
  Masahiro Nomura et al.
  3.39
• One Refiner To Unlock Them All: Inference-time Reasoning Elicitation Via Reinforcement Query Refinement (2026)
  Yixiao Zhou, Dongzhou Cheng, Zhiliang Wu, et al.
  2.95
• Llm-assisted Op-amp Behavioral-level Design Via Agentic Human-mimicking Reasoning (2026)
  Zihao Chen, Ziyi Sun, Jiayin Wang, et al.
  2.60
• Lean Meets Theoretical Computer Science: Scalable Synthesis of Theorem Proving Challenges in Formal-Informal Pairs (2026)
  Terry Jingchen Zhang et al.
  2.00
• Sufficient Explanations in Databases and their Connections to Database Repairs (2026)
  Leopoldo Bertossi et al.
  2.00
• The Lattice Representation Hypothesis of Large Language Models (2026)
  Bo Xiong
  2.00
• Answer Only as Precisely as Justified: Calibrated Claim-Level Specificity Control for Agentic Systems (2026)
  Tianyi Huang et al.
  2.00
• Leveraging Speech to Identify Signatures of Insight and Transfer in Problem Solving (2026)
  Linas Nasvytis et al.
  2.00
• Information Lattice Learning as Probabilistic Graphical Model Structure Learning (2026)
  Haizi Yu et al.
  2.00
• Unsupervised Causal Abstractions Discovery (2026)
  Th\'eo Saulus et al.
  2.00
• Efficiently Representing Algorithms With Chain-of-Thought Transformers (2026)
  Yanhong Li et al.
  2.00
• What Makes Effective Supervision in Latent Chain-of-Thought: An Information-Theoretic Analysis (2026)
  Xinghao Chen et al.
  2.00
• Faithful Autoformalization Via Roundtrip Verification And Repair (2026)
  Daneshvar Amrollahi, Jerry Lopez, Clark Barrett
  2.00
• Axiomatisation For An Asynchronous Epistemic Logic With Sending And Receiving Messages (2026)
  Philippe Balbiani, Hans van Ditmarsch, Clara Lerouvillois
  2.00
• Cap-cot: Cycle Adversarial Prompt For Improving Chain Of Thoughts In LLM Reasoning (2026)
  Shuxu Chen, Yitian Zhou, Jiaquan Zhang, et al.
  2.00
• RSAT: Structured Attribution Makes Small Language Models Faithful Table Reasoners (2026)
  Jugal Gajjar, Kamalasankari Subramaniakuppusamy
  2.00
• From Mechanistic to Compositional Interpretability (2026)
  Ward Gauderis et al.
  1.94
• Hilbert-Geo: Solving Solid Geometric Problems by Neural-Symbolic Reasoning (2026)
  Ruoran Xu et al.
  1.94
• Beyond Predefined Schemas: TRACE-KG for Context-Enriched Knowledge Graph Generation (2026)
  Mohammad Sadeq Abolhasani et al.
  1.89
• Transfer Learning from Foundational Optimization Embeddings to Unsupervised SAT Representations (2026)
  Koyena Pal et al.
  1.89
• MPBMC: Multi-Property Bounded Model Checking with GNN-guided Clustering (2026)
  Soumik Guha Roy et al.
  1.83
• Decidable By Construction: Design-Time Verification for Trustworthy AI (2026)
  Houston Haynes
  1.83
• MathlibLemma: Folklore Lemma Generation and Benchmark for Formal Mathematics (2026)
  Xinyu Liu et al.
  1.78
• Oops, Wait: Discourse Tokens Matter in Reasoning Model (2026)
  Jaehui Hwang et al.
  1.72
• Moded Types for Grassroots Logic Programs, by AI, for AI (Full Version) (2026)
  Ehud Shapiro
  1.72
• ReVEAL: GNN-Guided Reverse Engineering for Formal Verification of Optimized Multipliers (2025)
  Chen Chen et al.
  1.67
• Constrained and Robust Policy Synthesis with Satisfiability-Modulo-Probabilistic-Model-Checking (2025)
  Linus Heck et al.
  1.61
• Pragmatic Inference for Moral Reasoning Acquisition: Generalization via Metapragmatic Links (2025)
  Guangliang Liu et al.
  1.50
• Overcoming Over-Fitting in Constraint Acquisition via Query-Driven Interactive Refinement (2025)
  Vasileios Balafas et al.
  1.50
• Towards Constraint Temporal Answer Set Programming (2025)
  Pedro Cabalar et al.
  1.39
• Learning To Ponder: Adaptive Reasoning In Latent Space (2025)
  Yixin He, Lumingyuan Tang
  1.33
• Fully Geometric Multi-Hop Reasoning on Knowledge Graphs with Transitive Relations (2025)
  Fernando Zhapa-Camacho et al.
  1.28
• Designing Behavior Trees From Goal-oriented Ltlf Formulas (2023)
  Aadesh Neupane, Eric G Mercer, Michael A. Goodrich
  0.00
• An adaptive prefix-assignment technique for symmetry reduction (2017)
  Tommi Junttila (1) et al.
  —
• Inductive Synthesis for Probabilistic Programs Reaches New Horizons (2021)
  Roman Andriushchenko et al.
  —
• Exploiting Transformer in Sparse Reward Reinforcement Learning for Interpretable Temporal Logic Motion Planning (2022)
  Hao Zhang et al.
  —
• Chronosymbolic Learning: Efficient CHC Solving with Symbolic Reasoning and Inductive Learning (2023)
  Ziyan Luo and Xujie Si
  —
• MULTIGAIN 2.0: MDP controller synthesis for multiple mean-payoff, LTL and steady-state constraints (2023)
  Severin Bals et al.
  —