Knowledge 1:Propositional Logic 命题逻辑基础及符号
Keywords
- reasoning 推理
- Deductive reasoning(for a basic logic) 演绎推理
- analogy 类比;比喻 /əˈnælədʒi/
- definition of terminology /ˌtɜːmɪˈnɒlədʒi/术语的定义
- proposition/ˌprɒpəˈzɪʃn/命题
- distinction/dɪˈstɪŋkʃn/n. 区别;差别
- arithmetic /əˈrɪθmətɪk/ 算术,算法
- anthropomorphize/,ænθrəpəʊ'mɔːfaɪz/vt. 赋与人性,人格化
- knowledge base(KB) 知识库
- connectionism /kə'nekʃənizəm/ 联结主义
- retrieval /rɪˈtriːvl/n. 检索;恢复;取回;拯救
- inference: 推理
- entailment:蕴含
- syntax: /ˈsɪntæks/n. 语法;句法;
- semantic: /sɪˈmæntɪk/adj. 语义的;语义学的
- falsity: /ˈfɔːlsəti/n. 虚伪;错误;谎言;不真实
- notation /nəʊˈteɪʃn/n. 符号
- terminology:/ˌtɜːmɪˈnɒlədʒi/n. 术语,术语学;用辞
- theorem/ˈθɪərəm/n. [数] 定理;原理
- axiom: /ˈæksiəm/n. [数] 公理
- iff: 当且仅当
- K |= a是语义蕴含,K |- b是形式推演
What's all the Fuss about?
- Resources required to solve a problem
- Time(computational complexity)
- Memory
- Some problem are easy to solve
- 1+1=?
- This is good!
- Some problems are difficult to solve
- Playing chess, scheduling/timetabling...
- Is this bad?
- Some problems cannot be solved!
- Reasoning, planning,...
What is knowledge?
- taking the world to be one way and not another
- the propositions for the true or false encode what you know about the world.
What is representation?
- symbolic encoding of propositions believed by some agent 命题的符号编码,由某些行为者相信
- symbols standing for things in the world
What is reasoning?
- Manipulation of symbols encoding propositions to produce representations of new propositions.对编码命题的符号进行操作,以产生新命题的表示。
Why knowledge?
- taking an intentional stance
Why representation?
- intentional stance says nothing about what is / is not represented symbolically
Why reasoning?
- Want knowledge to affect action
- We don't want to do action A if sentence P is in KB,
- But rather do action A if world believed in satisfies P
- Difference:
- P may not be explicitly represented
- Need to apply what is known to particulars of given situation
- Usually need more than just DB-style retrieval of facts in the KB
Entailment
- Sentences P1, P2, ..., Pn entail sentence P iff the truth of P is implicit in the truth of P1, P2, ..., Pn
- Inference: the process of calculating entailments
- sound: get only entailment
- complete: get all entailment
- Sometimes want unsound / incomplete reasoning
- Logic: study of entailment relations
Using Logic
- No universal language / semantics
- No universal reasoning scheme
- Start with first-order predicate calculus(FOL)
Why do we need formal Knowledge Representation?
- Natural languages exhibit ambiguity
- ambiguity make it difficult to make any inferences
Syntax vs Semantics
- Syntax: Describe the legal sentences in a knowledge representation language.
- Semantics: Refers to the meaning of sentences. Semantics talks about truth and falsity.
Propositions
- Propositions are statements of fact.
- We shall use single letters to represent propositions
- P: Socrates is bald.
Formulae in Propositional Logic
Syntax
- BNF grammar
- Sentence ::= AtomicSentence || ComplexSentence
- AtomicSentence ::= True || False || P || Q || R || . .
- ComplexSentence ::= ( Sentence ) || Sentence Connective Sentence || ¬ Sentence
- Connective ::= ∧ || ∨ || → || ↔
Semantics
- The semantics of the connectives can be given by truth tables. It determines the semantics for complex formulae.
What is a logic?
- A logic consists of:
- A formal system for expressing knowledge about a domain consisting of
- Syntax: Sentences(well formed formulae)
- Semantics: Meaning
- A proof theory: rules of inference for deducing sentences from a knowledge base
Provability
- λ ⊢ ρ: we can construct a proof for ρ from λ using axioms and rules of inference
- If λ is empty (i.e., 0⊢ρ) and ρ is a single formula, then we say that ρ is a theorem of the logic
Entailment
- λ |= ρ: whenever the formula(s) λ are true, one of the formula(s) in ρ is true
- In the case where ρ is a single formula, we can determine whether λ |= ρ by constructing a truth table for λ and ρ. If, in any row of the truth table where all the formulae in λ are true, ρ is also true, then λ |= ρ.
- If λ is empty, we say that ρ is a tautology
Soundness and Completeness
- λ |= a是语义蕴含, λ |- b是形式推演
- An inference procedure (and hence a logic) is sound if and only if it preserves truth
- In other words ⊢ is sound iff whenever λ ⊢ ρ, then λ |= ρ
- Soundness 是说右侧推演的知识都是被λ蕴含的(推出来的知识都是正确的)
- A logic is complete if and only if it is capable of proving all truths
- In other words, whenever λ |= ρ, then λ ⊢ ρ
- Completeness 是说,左侧蕴含出来的知识都可以推演出来
- A logic is decidable if and only if we can write a mechanical procedure (computer program) which when asked λ ⊢ ρ it can eventually halt and answer “yes” or answer “no”
Knowledge 1:Propositional Logic 命题逻辑基础及符号的更多相关文章
- JQuery基础概念--$符号的实质
$符号的实质 //$其实就是一个函数,以后用$的时候,记得跟小括号 $(); //参数不同,功能就不同 //3种用法 //1. 参数是一个function, 入口函数 $(function () { ...
- python 基础 特殊符号的使用
python语句中的一些基本规则和特殊符号: 1.井号# 表示之后的字符为python注释 Python注释语句从#号字符开始,注释可以在语句的任何一个地方开始,解释器会忽略掉该行#号之后的所有内容 ...
- shell基础之符号与语法
shell脚本如今已经成为了一种非常普遍的脚本语言,之所以如此广泛的被应用,毋庸置疑它是有它的独到之处的.shell脚本语言和其它的语言比方说c/c++有何不同呢?c/c++等语言属于 ...
- C#语法基础----变量 符号 数据转换
变量的作用:为了更好的管理内存数据,不同类型的数据存放在不同的内存块中. 变量的特点:不同数据类型占用的存储空间大小不一样. 变量的意义:内存地址是一串十六进制数,非常不好记忆,通过变量可以快速找到数 ...
- Discrete Mathematics and Its Applications | 1 CHAPTER The Foundations: Logic and Proofs | 1.2 Applications of Propositional Logic
Translating English Sentences System Specifications Boolean Searches Logic Puzzles Logic Circuits
- Discrete Mathematics and Its Applications | 1 CHAPTER The Foundations: Logic and Proofs | 1.1 Propositional Logic
propositional variables (or statement variables), letters used for propositional variables are p, q, ...
- JAVA基础——运算符号
运算符(java) 算数运算符:+,-,*,/,%(取余),++,-- 赋值运算符:= 关系运算符:<, >, >= ,<= ,== , != 逻辑运算符:&& ...
- 2018美赛准备之路——Matlab基础——基本运算符号表示
π pi ln(x) log(x) lg(x) log10(x) log2(x) log2(x) 根号 sqrt(x) x的y次方 x^y e的y次方 exp(y)
- Python基础知识(Basic knowledge)
Python基础知识(Basic knowledge) 1.认识Python&基础环境搭建 2.Python基础(上) 3.Python基础(中) 4.Python基础(下) 5.Python ...
随机推荐
- 【NOI2014】动物园 - KMP
题目描述 近日,园长发现动物园中好吃懒做的动物越来越多了.例如企鹅,只会卖萌向游客要吃的.为了整治动物园的不良风气,让动物们凭自己的真才实学向游客要吃的,园长决定开设算法班,让动物们学习算法. 某天, ...
- 反制面试官 | 14张原理图 | 再也不怕被问 volatile!
反制面试官 | 14张原理图 | 再也不怕被问 volatile! 悟空 爱学习的程序猿,自主开发了Java学习平台.PMP刷题小程序.目前主修Java.多线程.SpringBoot.SpringCl ...
- Vue3 + Element ui 后台管理系统
Vue3 + Element ui 后台管理系统 概述:这是一个用vue3.0和element搭建的后台管理系统界面. 项目git地址: https://github.com/whiskyma/vu ...
- 解决QT5移植报错:This application failed to start because no Qt platform plugin could be initialized
今天自己基于Pyqt5开发了一个软件,打包成exe后在自己的电脑上运行正常,在其他机器上提示: This application failed to start because no Qt platf ...
- (转)@Autowired(required=false)注入注意的问题
1.前言 在使用spring开发过程中,我们基本上都是使用@Autowired这个注解,用来注入已有的bean.但是有些时候,会注入失败.当我们加上参数(required=false)就能解决.今天整 ...
- Jmeter系列(51)- 详解 Transaction Controller 事务控制器
如果你想从头学习Jmeter,可以看看这个系列的文章哦 https://www.cnblogs.com/poloyy/category/1746599.html 简单介绍 可以添加多个取样器(samp ...
- SparkStreaming架构
SparkStreaming是一个对实时数据流进行高通量.容错处理的流式处理系统,可以对多种数据源(如Kdfka.Flume.Twitter.Zero和TCP 套接字)进行类似Map.Reduce和J ...
- 多主机搭建etcd集群
下载https://github.com/etcd-io/etcd/releases/download/v3.4.10/etcd-v3.4.10-linux-amd64.tar.gz分别放到两台主机上 ...
- springboot整合druid监控配置
方式一:直接引入druid 1.maven坐标 <dependency> <groupId>com.alibaba</groupId> <artifactId ...
- Dubbo详解
什么是DubboDubbo是一个分布式服务框架,致力于提供高性能和透明化的远程服务调用方案,这容易和负载均衡弄混,负载均衡是对外提供一个公共地址,请求过来时通过轮询.随机等,路由到不同server.目 ...