2. 的逻辑

G. Lakemeyer, H. Levesque
{"title":"2. 的逻辑","authors":"G. Lakemeyer, H. Levesque","doi":"10.12987/9780300157673-003","DOIUrl":null,"url":null,"abstract":"Recently Lakemeyer and Levesque proposed the logic , which amalgamates both the situation calculus and Levesque’s logic of only knowing. While very expressive the practical relevance of the formalism is unclear because it heavily relies on second-order logic. In this paper we demonstrate that the picture is not as bleak as it may seem. In particular, we show that for large classes of knowledge bases and queries, including epistemic ones, query evaluation requires first-order reasoning only. We also provide a simple semantic definition of progressing a knowledge base. For a particular class of knowledge bases, adapted from earlier results by Lin and Reiter, we show that progression is first-order representable and easy to compute.","PeriodicalId":386728,"journal":{"name":"The Rise and Decline of Nations","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"2. The Logic\",\"authors\":\"G. Lakemeyer, H. Levesque\",\"doi\":\"10.12987/9780300157673-003\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently Lakemeyer and Levesque proposed the logic , which amalgamates both the situation calculus and Levesque’s logic of only knowing. While very expressive the practical relevance of the formalism is unclear because it heavily relies on second-order logic. In this paper we demonstrate that the picture is not as bleak as it may seem. In particular, we show that for large classes of knowledge bases and queries, including epistemic ones, query evaluation requires first-order reasoning only. We also provide a simple semantic definition of progressing a knowledge base. For a particular class of knowledge bases, adapted from earlier results by Lin and Reiter, we show that progression is first-order representable and easy to compute.\",\"PeriodicalId\":386728,\"journal\":{\"name\":\"The Rise and Decline of Nations\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Rise and Decline of Nations\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.12987/9780300157673-003\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The Rise and Decline of Nations","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.12987/9780300157673-003","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

最近Lakemeyer和Levesque提出了一种将情景演算和Levesque的唯知逻辑相结合的逻辑。虽然很有表现力,但形式主义的实际意义尚不清楚,因为它严重依赖于二阶逻辑。在本文中,我们证明了情况并不像看起来那样黯淡。特别是,我们表明,对于大型知识库和查询类,包括认知类,查询评估只需要一阶推理。我们还提供了推进知识库的简单语义定义。对于一类特殊的知识库,根据Lin和Reiter早期的结果改编,我们证明了级数是一阶可表示的,并且易于计算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
2. The Logic
Recently Lakemeyer and Levesque proposed the logic , which amalgamates both the situation calculus and Levesque’s logic of only knowing. While very expressive the practical relevance of the formalism is unclear because it heavily relies on second-order logic. In this paper we demonstrate that the picture is not as bleak as it may seem. In particular, we show that for large classes of knowledge bases and queries, including epistemic ones, query evaluation requires first-order reasoning only. We also provide a simple semantic definition of progressing a knowledge base. For a particular class of knowledge bases, adapted from earlier results by Lin and Reiter, we show that progression is first-order representable and easy to compute.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信