0


自动推理的概述

Overview of Automated Reasoning
课程网址: http://videolectures.net/ssll09_norrish_oar/  
主讲教师: Michael Norrish
开课单位: 澳大利亚信息通信技术研究中心
开课时间: 2009-04-01
课程语种: 英语
中文简介:
课程描述:在许多应用中,我们期望计算机逻辑推理。我们可能天真地认为这是计算机擅长的,但事实上,他们发现这非常困难。在本概述课程中,我们将简要介绍几种机械推理。第一种是自动推断,即结论完全是通过遵循一个算法,而无需用户干预,从假设中得出的。自动推理程序是由他们能够推理的逻辑参数化的。我们区分命题逻辑和一阶逻辑。命题逻辑程序(也称为SAT解算器)的开发和应用在过去十年中受到了相当大的关注,例如解决约束满足问题、在硬件设计、验证、规划和调度中的应用。对于一阶逻辑中的自动推理,我们讨论了应用程序、标准的推理程序(如分解)和基本概念(如统一)。我们还研究了定理证明的对偶问题,即一个给定理论的生成模型,它在寻找非定理的反例中有应用。本课程涉及的第三个重要领域是交互式定理证明。交互式定理证明需要用户提供一定数量的指令来告诉证明程序(定理证明程序)如何进行证明。这种交互通常是因为使用了高阶逻辑,其表达形式允许对复杂系统(如操作系统或各种协议)进行自然建模。近年来,交互式证明技术的发展趋势是通过结合自动证明技术的力量来提高其自动化程度。
课程简介: Course Description:In many applications, we expect computers to reason logically. We might naively expect this to be what computers are good at, but in fact they find it extremely difficult. In this overview course, we look briefly at several varieties of mechanical reasoning. The first is automated deduction, whereby conclusions are derived from assumptions purely by following an algorithm, without user intervention. Automated deduction procedures are parametrized by the logic they are capable of reasoning with. We distinguish between propositional logic and first-order logic. Development and application of propositional logic procedures, also called SAT solvers, received considerable attention in the last ten years, e.g., for solving constraint satisfaction problems, applications in hardware design, verification, and planning and scheduling. Regarding automated deduction in first-order logic, we discuss applications, standard deductive procedures such as resolution, and basic concepts, such as unification. We also examine the dual problem of theorem proving, viz., generating models of a given theory, which has applications to finding counterexamples for non-theorems. A third important area covered in the course is dealing with interactive theorem proving. Interactive theorem proving requires certain amount of instructions from the user to tell the proving program (the theorem prover) how to proceed with a proof. Such interaction is required usually because of the use of higher-order logics, whose expressive formalisms allow natural modeling of complex systems, such as operating system or various protocols. A recent trend in the development of interactive proving is to improve its automation, by combining the power of automatic provers.
关 键 词: 计算机逻辑推理; 对偶问题; 交互式定理
课程来源: 视频讲座网
最后编审: 2020-06-06:zyk
阅读次数: 83