Skip to main content

Journal of Automated Reasoning OnlineFirst articles

Open Access 27-07-2022

A Formalization of SQL with Nulls

SQL is the world’s most popular declarative language, forming the basis of the multi-billion-dollar database industry. Although SQL has been standardized, the full standard is based on ambiguous natural language rather than formal specification.


Tuple Interpretations for Termination of Term Rewriting

Interpretation methods constitute a foundation of the termination analysis of term rewriting. From time to time, remarkable instances of interpretation methods appeared, such as polynomial interpretations, matrix interpretations, arctic …


Six Decades of Automated Reasoning: Papers in Memory of Larry Wos



Fast Left Kan Extensions Using the Chase

We show how computation of left Kan extensions can be reduced to computation of free models of cartesian (finite-limit) theories. We discuss how the standard and parallel chase compute weakly free models of regular theories and free models of …

Open Access 07-06-2022

A Comprehensive Framework for Saturation Theorem Proving

A crucial operation of saturation theorem provers is deletion of subsumed formulas. Designers of proof calculi, however, usually discuss this only informally, and the rare formal expositions tend to be clumsy. This is because the equivalence of …

About this journal

The interdisciplinary Journal of Automated Reasoning balances theory, implementation and application. The spectrum of coverage 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. Topics include automated theorem proving, logic programming, expert systems, program synthesis and validation, artificial intelligence, computational logic, robotics, and various industrial applications. The contents focus 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.

Proof Pearls

In addition to regular research articles, the Journal of Automated Reasoning offers the special article type Proof Pearls. The goal is to disseminate insights gleaned from the growing body of machine-checked formalizations and proofs, obtained using both interactive and automated methods. Application areas include the full range from pure mathematics and logic to software and hardware verification. Proof Pearls should be short communications that focus on a few central ideas rather than extended research reports.

Contributions may include: a short, elegant proof of a self-standing result; a novel way of defining a fundamental concept; a notable approach to proving a key lemma in a larger development; a snippet of verified code, carefully engineered to balance efficiency with ease of verification; or a clever or impressive application of automated tools in a particular domain.

Proof Pearls adapt Jon Bentley's notion of a "programming pearl" to the verification paradigm. Proof Pearls should thus encapsulate fundamental insights that are adaptable and reusable, while being elegant and satisfying in their own right. Typical examples could be a verification of Huffman's algorithm, a perspicuous proof of the fundamental theorem of algebra, or a novel axiomatization of a particular algebraic system that was discovered using automated methods.

Submissions will undergo the usual refereeing process, and will be evaluated according to expository and theoretical merit. Systems and formalizations should be made available online.

Journal of Automated Reasoning
Volume 18/1997 - Volume 66/2022
Springer Netherlands
Electronic ISSN
Print ISSN
Journal ID

Premium Partner