提供学术论文选刊润色服务

计算机科学

返回期刊列表

Review Cycle Records

JOURNAL OF AUTOMATED REASONING

Springer SCIE 非OA

2026新锐 2区2025中科院 3区2025 JCR Q4

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

271.4平均天数

225中位天数

1最短天数

598最长天数

322025发文量

Paper Review Records

全部论文审稿周期

17 篇有效样本 · 按发表日期由新到旧排列
审稿天数=录用日期-收稿日期；保留 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 网页

Expert Matching · Case Demo

把投稿要求，转成可验证的期刊方案

说清专业、时限和作者背景，CrushSCI 结合真实审稿样本，给出拟题方向、期刊初筛与周期判断。

客户询问

我是环境工程专业，需要一篇 SCI，希望 3 个月内见刊。没有基金，也没有大牛挂名，可以投哪些期刊？

CrushSCI回复

可以。先按 90 天时限做可行性筛选，同步查找无基金、无知名作者挂靠的典型论文案例，作为选刊依据。重点核对研究质量与期刊 scope。

拟题建议: 《融合机器学习与生命周期评价的城市污水处理碳排放预测与优化》
数据库初筛: Environmental Technology & Innovation

样本口径2026 年最近 5 篇有效论文样本

平均审稿96.4 天

中位数77 天

JOURNAL OF AUTOMATED REASONING

全部论文审稿周期

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

把投稿要求，转成可验证的期刊方案

联系 CrushSCI

扫码添加微信好友

正在维护

JOURNAL OF AUTOMATED REASONING

全部论文审稿周期

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

相关榜单与期刊入口