事件演算及其怀疑论和轻信变体的一般模态框架

Iliano Cervesato , Angelo Montanari
{"title":"事件演算及其怀疑论和轻信变体的一般模态框架","authors":"Iliano Cervesato ,&nbsp;Angelo Montanari","doi":"10.1016/S0743-1066(98)10021-3","DOIUrl":null,"url":null,"abstract":"<div><p>We propose a general and uniform modal framework for the Event Calculus (EC) and its skeptical and credulous variants. The resulting temporal formalism, called the Generalized Modal Event Calculus (GMEC), extends considerably the expressive power of EC when information about the ordering of events is incomplete. It provides means of inquiring about the evolution of the maximal validity intervals of properties relative to all possible refinements of the ordering data by allowing a free mix of propositional connectives and modal operators. We first give a semantic definition of GMEC and relate it to known systems of modal logic; then, we propose a declarative encoding of GMEC in the language of hereditary Harrop formulas and prove the soundness and completeness of the resulting logic programs.</p></div>","PeriodicalId":101236,"journal":{"name":"The Journal of Logic Programming","volume":"38 2","pages":"Pages 111-164"},"PeriodicalIF":0.0000,"publicationDate":"1999-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0743-1066(98)10021-3","citationCount":"20","resultStr":"{\"title\":\"A general modal framework for the event calculus and its skeptical and credulous variants\",\"authors\":\"Iliano Cervesato ,&nbsp;Angelo Montanari\",\"doi\":\"10.1016/S0743-1066(98)10021-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We propose a general and uniform modal framework for the Event Calculus (EC) and its skeptical and credulous variants. The resulting temporal formalism, called the Generalized Modal Event Calculus (GMEC), extends considerably the expressive power of EC when information about the ordering of events is incomplete. It provides means of inquiring about the evolution of the maximal validity intervals of properties relative to all possible refinements of the ordering data by allowing a free mix of propositional connectives and modal operators. We first give a semantic definition of GMEC and relate it to known systems of modal logic; then, we propose a declarative encoding of GMEC in the language of hereditary Harrop formulas and prove the soundness and completeness of the resulting logic programs.</p></div>\",\"PeriodicalId\":101236,\"journal\":{\"name\":\"The Journal of Logic Programming\",\"volume\":\"38 2\",\"pages\":\"Pages 111-164\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1999-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0743-1066(98)10021-3\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The Journal of Logic Programming\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0743106698100213\",\"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 Journal of Logic Programming","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0743106698100213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

摘要

我们为事件演算(EC)及其怀疑论和轻信变体提出了一个通用和统一的模态框架。由此产生的时间形式,称为广义模态事件演算(GMEC),在关于事件排序的信息不完整时,极大地扩展了EC的表达能力。它通过允许命题连接词和模态操作符的自由混合,提供了查询相对于排序数据的所有可能细化的属性的最大有效区间的演变的方法。我们首先给出GMEC的语义定义,并将其与已知的模态逻辑系统联系起来;然后,我们提出了遗传Harrop公式语言的GMEC声明性编码,并证明了所得到的逻辑程序的正确性和完备性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A general modal framework for the event calculus and its skeptical and credulous variants

We propose a general and uniform modal framework for the Event Calculus (EC) and its skeptical and credulous variants. The resulting temporal formalism, called the Generalized Modal Event Calculus (GMEC), extends considerably the expressive power of EC when information about the ordering of events is incomplete. It provides means of inquiring about the evolution of the maximal validity intervals of properties relative to all possible refinements of the ordering data by allowing a free mix of propositional connectives and modal operators. We first give a semantic definition of GMEC and relate it to known systems of modal logic; then, we propose a declarative encoding of GMEC in the language of hereditary Harrop formulas and prove the soundness and completeness of the resulting logic programs.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
More on tractable disjunctive Datalog Decidability of logic program semantics and applications to testing Pair-sharing over rational trees Meta-agent programs Index
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1