|
所在平台: Udemy |
课程主页: https://www.udemy.com/course/introduction-to-computational-logic/
课程评论：没有评论
**课程名称：计算逻辑导论** **课程概述：** 本课程旨在介绍逻辑在计算机科学中的应用。我们将学习如何构建语言来模拟计算机科学专业人士在实践中遇到的各种情境，并在此基础上进行形式化推理。形式化推理意味着构建严谨、可验证的论证，甚至可以在计算机上执行。 为了使论证严谨，我们需要一种能够清晰表达句子逻辑结构的语言。课程将从**命题逻辑**开始，它基于**命题**（即可以判断真假的陈述句）。 **课程大纲：** 1. **命题逻辑入门：** * 命题逻辑的基本概念 * 解析树（Parse tree） * 命题逻辑语句的赋值（Valuation） * 命题逻辑模型（Model） 2. **命题逻辑推理的演算：** * 自然推理（Natural Rules for Deduction） * 自然推理规则的应用示例 * 导出规则（Derived Rules for Deduction） * 反证法 * 分离规则（Modus Tollens） * 排中律（Law of Excluded middle portion） * 双重否定消除（Double negation elimination） 3. **谓词逻辑入门：** * 将自然语言语句转化为谓词逻辑语句 * 解析树 * 代入（Substitution） * 一阶逻辑模型（Model in First order logic） **学习目标：** 通过本课程的学习，您将能够理解命题逻辑和谓词逻辑的基本原理，掌握构建形式化论证的方法，并能将其应用于计算机科学的各种问题中。
The aim of logic in computer science is to develop languages to model the situations we encounter as computer science professionals, in such a way that we can reason about them formally. Reasoning about situations means constructing arguments about them; we want to do this formally, so that the arguments are valid and can be defended rigorously, or executed on a machine. In order to make arguments rigorous, we need to develop a language in which we can express sentences in such a way that brings out their logical structure. The language we begin with is the language of propositional logic. It is based on propositions, or declarative sentences which one can, in principle, argueas being true or false. The outline of this course is given as,Introduction to Propositional Logic, Parse tree, valuation of Propositional Logic statements, Model in propositional logicHow do we go about constructing a calculus for reasoning about propositions given a certain arrangement of premises. - Natural Rules for Deduction, Examples of Natural Deduction RulesDerived Rules for Deduction, Proof by contradiction, Modus Tollens,Law of Excluded middle portion and Double negation eliminationIntroduction to Predicate Logic, Natural language statements to Predicate logic statementsParse tree, substitution and Model in First order logic
