知识卡片
符号推理依规则和前提有效性
符号推理按明确规则从前提导出结论,便于追踪所用关系。规则有效不保证输入事实正确,默认条件或例外也会影响结果;应保留推导链与来源,而不是把符号方法视为自动产生真实智能的充分条件。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- · 查看原书依据
There are a few other terms that are often used when referring to the grounding process using a knowledge graph. Sometimes, it’s referred to as symbolic reasoning, as opposed to the probabilistic reasoning of machine learning models. First-order logic—or GOFAI, pronounced go fie—is one system for symbolic reasoning.1 This was the preferred approach to building expert systems and theorem provers before modern-day data and processing
参考来源
- 位置:《Natural Language Processing in Action, Second Edition》第11章《信息抽取与知识图谱》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Natural Language Processing in Action, Second Edition/_epub-src/OEBPS/Text/chapter-11.html)
- 结论依据:摘录中关于符号推理依规则和前提有效性的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:There are a few other terms that are often used when referring to the grounding process using a knowledge graph. Sometimes, it’s referred to as symbolic reasoning, as opposed to the probabilistic reasoning of machine learning models. First-order logic—or GOFAI, pronounced go fie—is one system for symbolic reasoning.1 This was the preferred approach to building expert systems and theorem provers before modern-day data and processing