麻省理工电机工程与计算科学课程人工智能秋季课程五.pdf

麻省理工电机工程与计算科学课程人工智能秋季课程五.pdf

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
麻省理工电机工程与计算科学课程人工智能秋季课程五

6.034 Artificial Intelligence by T. Lozano-Perez and L. Kaelbling. Copyright © 2003 by Massachusetts Institute of Technology. 6.034 Notes: Section 5.1 Slide 5.1.1 Now were going to start talking about first-order logic, which extends propositional logic so that we can talk about things. Slide 5.1.2 In propositional logic, all we had were variables that stood, not for things in the world or even quantities, but just facts, Boolean statements that might or might not be true about the world, like whether its raining, or greater than 67 degrees; but you couldnt have variables that stood for tables or books, or the temperature, or anything like that. And as it turns out, thats an enormously limiting kind of representation. Slide 5.1.3 In first-order logic, variables refer to things in the world and you can quantify over them. That is, you can talk about all or some of them without having to name them explicitly. 6.034 Artificial Intelligence by T. Lozano-Perez and L. Kaelbling. Copyright © 2003 by Massachusetts Institute of Technology. Slide 5.1.4 There are lots of examples that show how propositional logic is inadequate to characterize even moderately complex domains. Here are some

文档评论(0)

asd522513656 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档