Journal of Automated Reasoning
| 短名 | J Autom Reasoning |
| Journal Impact | 1.07 |
| 国际分区 | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE(Q4) |
| 期刊索引 | SCI Q4中科院 3 区 |
| ISSN | 0168-7433, 1573-0670 |
| h-index | 62 |
| 国内分区 | 计算机科学(3区)计算机科学计算机人工智能(3区) |
JOURNAL OF AUTOMATED REASONING 是一本跨学科期刊，在理论、实施和应用之间保持平衡。所发表的材料范围从提出新的推理规则及其逻辑属性的证明到对旨在解决工业中各种问题的计算机程序的详细说明。涵盖的主要领域是自动定理证明、逻辑编程、专家系统、程序合成和验证、人工智能、计算逻辑、机器人技术和各种工业应用。这些论文的共同特点是专注于自动化推理的几个方面，该领域的目标是设计和实现计算机程序，作为解决问题和回答需要推理的问题的助手。《自动化推理杂志》提供为那些对理论感兴趣的人、主要对实施感兴趣的人以及对特定研究和工业应用感兴趣的人提供一个论坛和交流信息的手段。
期刊主页投稿网址| 涉及主题 | 计算机科学数学程序设计语言理论计算机科学算法人工智能哲学离散数学几何学语言学医学纯数学认识论口腔正畸科牙科牙石（牙科）数学证明域代数上的工程类数学分析生物自动定理证明 |
| 出版信息 | 出版商: Springer Netherlands，出版周期: Bimonthly，期刊类型: journal |
| 基本数据 | 创刊年份: 1985，原创研究文献占比: 100.00%，自引率:11.10%， Gold OA占比: 53.41% |
| 平均审稿周期 | 网友分享经验：>12周，或约稿 |
| 平均录用比例 | 网友分享经验：容易 |
期刊引文格式
这些示例是对学术期刊文章的引用，以及它们应该如何出现在您的参考文献中。
并非所有期刊都按卷和期组织其已发表的文章，因此这些字段是可选的。有些电子期刊不提供页面范围，而是列出文章标识符。在这种情况下，使用文章标识符而不是页面范围是安全的。
只有1位作者的期刊
有2位作者的期刊
有3位作者的期刊
有5位以上作者的期刊
书籍引用格式
以下是创作和编辑的书籍的参考文献的示例。
学位论文引用格式
网页引用格式
这些示例是对网页的引用，以及它们应该如何出现在您的参考文献中。
专利引用格式
最新文章
Single-Set Cubical Categories and Their Formalisation with a Proof Assistant
2024-9-12
Towards a Scalable Proof Engine: A Performant Prototype Rewriting Primitive for Coq
2024-8-14
Verifying Programs with Logic and Extended Proof Rules: Deep Embedding vs. Shallow Embedding
2024-8-10
Verifying the Generalization of Deep Learning to Out-of-Distribution Domains
2024-8-3
Dependency Schemes in CDCL-Based QBF Solving: A Proof-Theoretic Study
2024-7-24
Verifying a Sequent Calculus Prover for First-Order Logic with Functions in Isabelle/HOL
2024-6-27
Refinement of Parallel Algorithms Down to LLVM: Applied to Practically Efficient Parallel Sorting
2024-6-19
General Clauses for SAT-Based Proof Search in Intuitionistic Propositional Logic
2024-6-16
Automated Generation of Geometry Proof Problems Based on Point Geometry Identity
2024-6-1
Gale-Shapley Verified
2024-6-1
Formalized Functional Analysis with Semilinear Maps
2024-6-1
Linear Resources in Isabelle/HOL
2024-5-18
Sequent Calculi for Choice Logics
2024-4-3
Schematic Program Proofs with Abstract Execution
2024-3-26
SAT Meets Tableaux for Linear Temporal Logic Satisfiability
2024-3-15
Should Decisions in QCDCL Follow Prefix Order?
2024-2-9
Non-termination in Term Rewriting and Logic Programming
2024-2-2
A Matroid-Based Automatic Prover and Coq Proof Generator for Projective Incidence Geometry
2024-1-18
A Formalization of the CHSH Inequality and Tsirelson’s Upper-bound in Isabelle/HOL
2023-12-19
Formally-Verified Round-Off Error Analysis of Runge–Kutta Methods
2023-12-6
Formal Verification of Termination Criteria for First-Order Recursive Functions
2023-11-29
Saturation-Based Boolean Conjunctive Query Answering and Rewriting for the Guarded Quantification Fragments
2023-11-23
Self-evident Automated Geometric Theorem Proving Based on Complex Number Identity
2023-11-20
Bisequent Calculus for Four-Valued Quasi-Relevant Logics: Cut Elimination and Interpolation
2023-11-16
Finitary Type Theories With and Without Contexts
2023-10-7
Combining Stable Infiniteness and (Strong) Politeness
2023-9-27
Lower Bounds for QCDCL via Formula Gauge
2023-9-27
Enabling Floating-Point Arithmetic in the Coq Proof Assistant
2023-9-16
Reasoning About Vectors: Satisfiability Modulo a Theory of Sequences
2023-9-1
Preprocessing of Propagation Redundant Clauses
2023-9-1
A Proof Procedure for Separation Logic with Inductive Definitions and Data
2023-9-1
Mechanising Gödel–Löb Provability Logic in HOL Light
2023-8-29
Measure Construction by Extension in Dependent Type Theory with Application to Integration
2023-8-18
Cyclic Hypersequent System for Transitive Closure Logic
2023-8-16
A Resolution Proof System for Dependency Stochastic Boolean Satisfiability
2023-8-3
Binary Codes that do not Preserve Primitivity
2023-7-18
POSIX Lexing with Derivatives of Regular Expressions
2023-7-8
Rensets and Renaming-Based Recursion for Syntax with Bindings Extended Version
2023-7-5
SCL(EQ): SCL for First-Order Logic with Equality
2023-6-30
A Formal Theory of Choreographic Programming
2023-5-27
Combining Higher-Order Logic with Set Theory Formalizations
2023-5-25
Synthesising Programs with Non-trivial Constants
2023-5-13
Engel’s Theorem in Mathlib
2023-5-13
An Automatically Verified Prototype of the Android Permissions System
2023-5-12
Unifying Splitting
2023-4-28
An Automated Approach to the Collatz Conjecture
2023-4-25
First-Order Theory of Rewriting for Linear Variable-Separated Rewrite Systems: Automation, Formalization, Certification
2023-4-6
Synthetic Undecidability and Incompleteness of First-Order Axiom Systems in Coq
2023-3-1
Computer-Aided Constructions of Commafree Codes
2023-2-17
Finding Normal Binary Floating-Point Factors Efficiently
2023-2-6
帮你贴心管理全部的文献
研飞ivySCI，高效的论文管理
投稿经验分享
分享我的经验，帮你走得更远