Formalising Szemerédi’s Regularity Lemma and Roth’s Theorem on Arithmetic Progressions in Isabelle/HOL

IF 0.9 3区计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Journal of Automated Reasoning Pub Date : 2022-07-15 DOI:10.1007/s10817-022-09650-2

C. Edmonds, Angeliki Koutsoukou-Argyraki, Lawrence Charles Paulson

引用次数: 3

Abstract Image

查看原文本刊更多论文

关于等差数列的szemersamedi正则引理和Roth定理的形式化

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Automated Reasoning 工程技术-计算机：人工智能

CiteScore

3.60

自引率

9.10%

发文量

审稿时长

>12 weeks

期刊介绍： 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.