A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://link.springer.com/content/pdf/10.1007/s10817-020-09556-x.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Springer Science and Business Media LLC">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2ewief65xnegfh2slwulpgsnba" style="color: black;">Journal of automated reasoning</a>
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<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10817-020-09556-x">doi:10.1007/s10817-020-09556-x</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/u32hsri2yjh57nuqcevx75234y">fatcat:u32hsri2yjh57nuqcevx75234y</a> </span>
more »... en 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.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200711230312/https://link.springer.com/content/pdf/10.1007/s10817-020-09556-x.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/54/ff/54ffbbca7df3217e555b4049651b60b980e621a7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10817-020-09556-x"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> springer.com </button> </a>