报告人：Geoff Sutcliffe教授 美国迈阿密大学计算机科学系
报告人简介：
Geoff Sutcliffe is a Professor and the Chair of the Department of Computer Science at the University of Miami. He received a BSc(Hons) and MSc from the University of Natal, and a PhD in Computer Science from the University of Western Australia. His research is in the area of Automated Reasoning, particularly in the evaluation and effective use of automated reasoning systems. His most prominent achievements are: the first ever development of a heterogeneous parallel deduction system, leading to the development of the SSCPA automated reasoning system; the development and ongoing maintenance of the TPTP problem library, which is now the de facto standard for testing classical logic automated reasoning systems; the development and ongoing organization of the CADE ATP System Competition - the world championship for classical logic automated reasoning systems; and the specification of the TPTP language standards for automated reasoning tools. The research has been supported by grants from the National Science Foundation, the German Ministry for Research, the Australian Research Council, the European Union, and internal university grants from Edith Cowan University, James Cook University, and the University of Miami. The research has produced over 125 refereed journal, conference, and workshop papers.
He is an editor of Acta Informatica and the Formalised Mathematics journal, and has been guest editor of several special journal issues on topics in automated reasoning. He has contributed to the automated reasoning and artificial intelligence communities as a conference or program chair of (several instances of) the International Conference on Automated Deduction (CADE), the International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR), and the International Florida Artificial Intelligence Research Society (FLAIRS). He was co-founder and organizer of the "ES*" series of workshops on Empirically Successful Automated Reasoning. He regularly serves as a program committee member and reviewer for automated reasoning and artificial intelligence journals and conferences. He has served three terms as a CADE trustee, is on the LPAR steering committee, is on the Linking Research Globally (LRG) steering committee, and is currently the president of FLAIRS. As a faculty member at the University of Miami he is currently chair of the College of Arts and Sciences curriculum committee.
报告1
题目：JGXYZ - An ATP System for Gap and Glut Logics (JGXYZ -一种针对非经典逻辑的自动定理证明系统)
报告时间：2019年7月15日（星期一）9:30-10:30
报告地点：九里校区信息楼01020
报告内容简介：
This talk describes an ATP system, named JGXYZ, for some gap and glut logics. JGXYZ is based on an equi-provable translation to FOL, followed by use of an existing ATP system for FOL. A key feature of JGXYZ is that the translation to FOL is data-driven, in the sense that it requires only the addition of a new logic's truth tables for the unary and binary connectives in order to produce an ATP system for the logic. Experimental results from JGXYZ illustrate the differences between the logics and translated problems, both technically and in terms of a quasi-real-world use case.
报告2
报告题目：CASC - The CADE ATP System Competition (CASC -自动定理证明器竞赛的历史与发展)
报告时间：2019年7月16日（星期二）9:30-10:30
报告地点：九里校区信息楼01020
报告内容简介：
The CADE ATP System Competition (CASC) is the annual evaluation of fully automatic, classical logic Automated Theorem Proving (ATP) systems - the world championship for such systems. Besides the obvious aim of evaluating ATP systems, CASC stimulates ATP research, motivates development and implementation of robust ATP systems that are useful and easily deployed in applications, provides an inspiring environment for personal interaction between ATP researchers, and exposes ATP systems within and beyond the ATP community. This talk covers the past, present, and future of CASC.
报告3
题目：The TPTP Problem Library and Associated Infrastructure - from CNF to TH1, and Beyond (TPTP自动定理证明问题库及其架构)
报告时间：2019年7月18日（星期四）09:30-10:30
报告地点：九里校区信息楼01020
报告内容简介：
This talk describes the TPTP problem library and associated infrastructure, from its use of Clause Normal Form (CNF), via the First-Order Form (FOF) and Typed First-order Forms (TF0 and TF1), through to the Typed Higher-order Forms (TH0 and TH1). This talk summarizes the aims and history of the TPTP, documents its growth up to v7.3.0, reviews the structure and contents of TPTP problems, gives an overview of TPTP-related infrastructure, and describes current work extending the TPTP to include Boolean terms and modalities.
