Journal of Automated Reasoning

Aims & Scope

The Journal of Automated Reasoning is an interdisciplinary journal that maintains a balance between theory, implementation and application.

The spectrum of material published ranges from the presentation of a new inference rule with proof of its logical properties to a detailed account of a computer program designed to solve various problems in industry.

The main fields covered are automated theorem proving, logic programming, expert systems, program synthesis and validation, artificial intelligence, computational logic, robotics, and various industrial applications.

The papers share the common feature of focusing on several aspects of automated reasoning, a field whose objective is the design and implementation of a computer program that serves as an assistant in solving problems and in answering questions that require reasoning.

The Journal of Automated Reasoning provides a forum and a means for exchanging information for those interested purely in theory, those interested primarily in implementation, and those interested in specific research and industrial applications.

View Aims & Scope

---

Metrics & Ranking

Journal Rank

Year	Value
2024	9414

Journal Citation Indicator

Year	Value
2024	163

SJR (SCImago Journal Rank)

Year	Value
2024	0.616

Quartile

Year	Value
2024	Q2

h-index

Year	Value
2024	64

Impact Factor

Year	Value
2024	0.90

---

---

Abstracting & Indexing

Journal is indexed in leading academic databases, ensuring global visibility and accessibility of our peer-reviewed research.

• Scopus
• Google Scholar
• Web of Science

---

Subjects & Keywords

Journal’s research areas, covering key disciplines and specialized sub-topics in Computer Science, designed to support cutting-edge academic discovery.

---

Most Cited Articles

The Most Cited Articles section features the journal's most impactful research, based on citation counts. These articles have been referenced frequently by other researchers, indicating their significant contribution to their respective fields.

• Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family

  Citation: 682

  Authors: Diego, Giuseppe, Domenico, Maurizio, Riccardo

• HermiT: An OWL 2 Reasoner

  Citation: 438

  Authors: Birte, Ian, Boris, Giorgos, Zhe

• A Formally Verified Compiler Back-end

  Citation: 357

  Authors: Xavier

• Differential Dynamic Logic for Hybrid Systems

  Citation: 291

  Authors: André

• The TPTP Problem Library and Associated Infrastructure

  Citation: 236

  Authors: Geoff

• Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems

  Citation: 219

  Authors: Carla P., Bart, Nuno, Henry

• Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints

  Citation: 211

  Authors: Mark H., Karem A.

• The foundation of a generic theorem prover

  Citation: 194

  Authors: Lawrence C.

• Solution of the Robbins Problem

  Citation: 179

  Authors: William

• The Role of the Mizar Mathematical Library for Interactive Proof Development in Mizar

  Citation: 178

  Authors: Grzegorz, Czesław, Adam, Artur, Roman, Adam, Karol

---