This special issue of the Journal of Automated Reasoning is dedicated to selected papers presented at the 9th Joint Conference on Automated Reasoning (IJCAR 2018), held between July 14 and July 17, 2018 in Oxford, UK, as part of the Federated Logic Conference (FLOC) 2018. IJCAR is the premier international joint conference on all topics in automated reasoning and merges three leading events in automated reasoning: CADE (Conference on Automated Deduction), FroCoS (Symposium on Frontiers of Combining Systems), and TABLEAUX (Conference on Analytic Tableaux and Related Methods). The papers selected for this special issue underwent a two-round reviewing process. In the first round, the papers had been reviewed and accepted by at least three reviewers as part of the IJCAR 2018 reviewing process. We invited authors of top rated papers in the proceedings as evaluated by the reviewers to submit revised and extended versions of their papers to this special issue. In the second round, the submitted extended papers went through the reviewing process of the Journal of Automated Reasoning. Each paper was reviewed by two reviewers. The seven selected papers in this special issue cover a wide spectrum of topics in Automated Reasoning, from proof theory and theorem proving to formalization and mechanization of completeness or decidability results, from proof systems to analysis of complexity and decidability, from automated reasoning to the production of stateful ML programs together with proofs of correctness, from extensions of model checking techniques to the verification of some parameterized systems. The paper “Formalizing Bachmair and Ganzinger’s Ordered Resolution Prover” presents a formalization of the first half of Bachmair and Ganzinger’s chapter on resolution theorem proving in Isabelle/HOL, providing a refutationally complete first-order prover based on ordered resolution with literal selection. It proposes general infrastructure and methodology that can form the basis of completeness proofs for related calculi, including superposition. The paper “Constructive Decision via Redundancy-free Proof-Search” presents a constructive account of Kripke-Curry’smethod used to establish the decidability of Implicational Relevance Logic (R→). The method is mechanized in axiom-free Coq, with the replacement of Kripke/Dickson’s lemma by a constructive form of Ramsey’s theorem and of König’s

中文翻译：

---

前言：IJCAR 2018 精选扩展论文特刊

本期《自动推理杂志》特刊专门介绍于 2018 年 7 月 14 日至 17 日在英国牛津举行的第 9 届自动推理联合会议 (IJCAR 2018) 上发表的精选论文，作为联邦逻辑会议的一部分（ FLOC) 2018. IJCAR 是自动推理所有主题的首屈一指的国际联合会议，合并了自动推理领域的三个主要活动：CADE（自动推理会议）、FroCoS（组合系统前沿研讨会）和 TABLEAUX（分析会议）表和相关方法）。本期特刊入选的论文经过了两轮评审。在第一轮中，作为 IJCAR 2018 评审过程的一部分，论文已被至少三位评审员评审并接受。我们邀请审稿人评估的论文集中评分最高的论文的作者向本特刊提交他们论文的修订和扩展版本。第二轮，提交的扩展论文通过了Journal of Automatic Reasoning的审稿流程。每篇论文都由两名审稿人审阅。本期特刊中的七篇精选论文涵盖了自动推理的广泛主题，从证明理论和定理证明到完整性或可判定性结果的形式化和机械化，从证明系统到复杂性和可判定性分析，从自动推理到生产状态 ML 程序以及正确性证明，从模型检查技术的扩展到一些参数化系统的验证。论文“Formalizing Bachmair and Ganzinger's Ordered Resolution Prover”介绍了 Bachmair 和 Ganzinger 在 Isabelle/HOL 中关于解析定理证明的前半部分的形式化，提供了一个基于带字面选择的有序解析的反驳完备的一阶证明器。它提出了通用的基础设施和方法，可以构成相关演算（包括叠加）的完整性证明的基础。论文“Constructive Decision via Redundancy-free Proof-Search”对用于建立蕴涵相关逻辑 (R→) 可判定性的 Kripke-Curry 方法进行了建设性的说明。该方法在无公理的 Coq 中机械化，将 Kripke/Dickson 引理替换为 Ramsey 定理和 König 定理的构造形式 基于具有文字选择的有序解析提供可反驳的完整一阶证明。它提出了通用的基础设施和方法，可以构成相关演算（包括叠加）的完整性证明的基础。论文“Constructive Decision via Redundancy-free Proof-Search”对用于建立蕴涵相关逻辑 (R→) 可判定性的 Kripke-Curry 方法进行了建设性的说明。该方法在无公理的 Coq 中机械化，将 Kripke/Dickson 引理替换为 Ramsey 定理和 König 定理的构造形式 基于具有文字选择的有序解析提供可反驳的完整一阶证明。它提出了通用的基础设施和方法，可以构成相关演算（包括叠加）的完整性证明的基础。论文“Constructive Decision via Redundancy-free Proof-Search”对用于建立蕴涵相关逻辑 (R→) 可判定性的 Kripke-Curry 方法进行了建设性的说明。该方法在无公理的 Coq 中机械化，将 Kripke/Dickson 引理替换为 Ramsey 定理和 König 定理的构造形式 论文“Constructive Decision via Redundancy-free Proof-Search”对用于建立蕴涵相关逻辑 (R→) 可判定性的 Kripke-Curry 方法进行了建设性的说明。该方法在无公理的 Coq 中机械化，将 Kripke/Dickson 引理替换为 Ramsey 定理和 König 定理的构造形式 论文“Constructive Decision via Redundancy-free Proof-Search”对用于建立蕴涵相关逻辑 (R→) 可判定性的 Kripke-Curry 方法进行了建设性的说明。该方法在无公理的 Coq 中机械化，将 Kripke/Dickson 引理替换为 Ramsey 定理和 König 定理的构造形式