Review Cycle Records

JOURNAL OF AUTOMATED REASONING

Springer 非OA 2026新锐 2区2025中科院 3区已自动采集最新完整样本 10 篇平均 346.3 天

数据更新 2026-07-16 · 完整周期 10 篇 · 日期来源可逐条复核

JOURNAL OF AUTOMATED REASONING已收录10篇完整论文周期样本，平均审稿346.3 天，中位审稿365.5 天。2025中科院3区，非OA，2025发文量32。页面含论文收到日期、录用日期、PDF、DOI和出版社网页溯源入口。

查看审稿周期计算与数据来源 · 报告数据问题

346.3平均天数

365.5中位天数

126最短天数

598最长天数

10最新论文

322025发文量

最新发表论文审稿周期

审稿天数=录用日期-收到日期；保留 PDF/DOI/网页源链接

329 天

Probabilistic Automaton Classifier Applied to Examples Related to the Andrews-Curtis Conjecture

收到 2025-07-18 录用 2026-06-12 发表 2026-07-08

作者Michael Fairbank; Alexei Lisitsa; Alexei Vernitski

作者单位1. University of Essex, Colchester, United Kingdom; 2. University of Liverpool, Liverpool, United Kingdom

PDF源文件 DOI 网页

154 天

Typed Compositional Quantum Computation with Lenses

收到 2025-09-01 录用 2026-02-02 发表 2026-05-22

作者Jacques Garrigue; Takafumi Saikawa

作者单位1. Graduate School of Mathematics, Nagoya University, Nagoya, Japan

PDF源文件 DOI 网页

225 天

YALLA: Yet Another Deep Embedding of Linear Logic in Rocq

收到 2025-09-01 录用 2026-04-14 发表 2026-05-21

作者Olivier Laurent

作者单位1. Laboratoire de l’Informatique du Parallélisme, CNRS – ENS de Lyon – Université Claude Bernard Lyon 1, Lyon cedex 07, France

PDF源文件 DOI 网页

452 天

Verified Tableaux: from Modal Logics to Modal Fixpoint Logics

收到 2024-12-29 录用 2026-03-26 发表 2026-05-08

作者Rajeev Goré; Anthony Peigné

作者单位1. Monash University, Melbourne, Australia; 2. Australian National University, Canberra, Australia

PDF源文件 DOI 网页

151 天

The Rewster: Type Preserving Rewrite Rules for the Rocq Prover

收到 2025-10-02 录用 2026-03-02 发表 2026-04-11

作者Yann Leray; Gaëtan Gilbert; Nicolas Tabareau; Théo Winterhalter

作者单位1. Nantes Université, École Centrale Nantes, CNRS, INRIA, LS2N, UMR 6004, Nantes, France; 2. INRIA Rennes Bretagne Atlantique, LS2N, Nantes, France; 3. INRIA Saclay, LMF, Gif-sur-Yvette, France

PDF源文件 DOI 网页

447 天

Targeting Completeness: Automated Complexity Analysis of Integer Programs

收到 2024-11-27 录用 2026-02-17 发表 2026-04-04

作者Nils Lommen; Éléanore Meyer; Jürgen Giesl

作者单位1. RWTH Aachen University, Aachen, Germany

PDF源文件 DOI 网页

126 天

Applying Saturation-Based Theorem Proving to Open Problems in Positive Implicational Logic

收到 2025-10-27 录用 2026-03-02 发表 2026-03-18

作者Branden Fitelson; Nicolas Peltier

作者单位1. Northeastern University, Boston, USA; 2. Univ. Grenoble Alpes, CNRS, LIG, Grenoble, France

PDF源文件 DOI 网页

598 天

Feature Necessity and Relevancy in Machine Learning Explanations

收到 2024-05-31 录用 2026-01-19 发表 2026-03-17

作者Xuanxiang Huang; Martin C. Cooper; Antonio Morgado; Jordi Planes; Joao Marques-Silva

作者单位1. NTU, Singapore, Singapore; 2. IRIT, University of Toulouse, Toulouse, France; 3. INESC-ID/IST, University of Lisbon, Lisbon, Portugal; 4. University of Lleida, Lleida, Spain; 5. ICREA & University of Lleida, Lleida, Spain

PDF源文件 DOI 网页

402 天

A Formal Correctness Proof of Edmonds’ Blossom Shrinking Algorithm

收到 2024-12-02 录用 2026-01-08 发表 2026-02-16

作者Mohammad Abdulaziz; Kurt Mehlhorn

作者单位1. King’s College London, London, United Kingdom; 2. Max Planck Institute for Informatics, Saarbrücken, Germany

PDF源文件 DOI 网页

579 天

Unsatisfiability-based Algorithms for Multi-Objective Combinatorial Optimization

收到 2024-06-19 录用 2026-01-19 发表 2026-02-16

作者João Cortes; Inês Lynce; Vasco Manquinho

作者单位1. INESC-ID, Instituto Superior Técnico, Universidade de Lisboa, Lisbon (Lisboa), Portugal

PDF源文件 DOI 网页

JOURNAL OF AUTOMATED REASONING

最新发表论文审稿周期

Probabilistic Automaton Classifier Applied to Examples Related to the Andrews-Curtis Conjecture

Typed Compositional Quantum Computation with Lenses

YALLA: Yet Another Deep Embedding of Linear Logic in Rocq

Verified Tableaux: from Modal Logics to Modal Fixpoint Logics

The Rewster: Type Preserving Rewrite Rules for the Rocq Prover

Targeting Completeness: Automated Complexity Analysis of Integer Programs

Applying Saturation-Based Theorem Proving to Open Problems in Positive Implicational Logic

Feature Necessity and Relevancy in Machine Learning Explanations

A Formal Correctness Proof of Edmonds’ Blossom Shrinking Algorithm

Unsatisfiability-based Algorithms for Multi-Objective Combinatorial Optimization

相关榜单与期刊入口