Assumption-based reasoning in dynamic normative agent systems

G. Giannikis, Aspassia Daskalopulu
{"title":"Assumption-based reasoning in dynamic normative agent systems","authors":"G. Giannikis, Aspassia Daskalopulu","doi":"10.3233/WIA-2010-0196","DOIUrl":null,"url":null,"abstract":"In this paper we address dynamic assumption-based reasoning in open agent systems, where, unavoidably, agents have incomplete knowledge about their environment and about other agents. The interactions among agents in such systems are typically subject to norms, which stipulate what each agent is obliged, permitted, prohibited, empowered etc. to do, while it participates in the system. In such environments agents need to resort to assumptions, in order to establish what actions are appropriate to perform, and they need to do so dynamically, since the environment, the agents that exist in it, the information that is exchanged between them, and the normative relations between them change over time. In earlier work, we had proposed Default Theory construction to support dynamic assumption-based reasoning. We argued that in this way, agents could perform both assumption identification and employment dynamically, contrary to other approaches to assumption-based reasoning, which catered for either one or the other. A shortcoming of this early proposal of ours, though, is that Default Theory construction seems to require proof, which is notably computationally expensive. In this paper we present a computational technique that can be used for this construction in an incremental manner that does not depend on proof, and a prototype tool that we developed for experimentation. In a nutshell, depending on their current knowledge at any given time, agents can identify appropriate candidate assumptions in an ad hoc manner. When such choices need to be revised, agents can reconstruct their view of the possible world in which they find themselves, and establish their revised assumption requirements at run-time. \n \nThis paper is an extended version of the work presented at the 2008 IEEE/WI/ACM Int. Conf. on Intelligent Agent Technology, 9-12 December, Sydney, Australia.","PeriodicalId":263450,"journal":{"name":"Web Intell. Agent Syst.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Web Intell. Agent Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/WIA-2010-0196","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper we address dynamic assumption-based reasoning in open agent systems, where, unavoidably, agents have incomplete knowledge about their environment and about other agents. The interactions among agents in such systems are typically subject to norms, which stipulate what each agent is obliged, permitted, prohibited, empowered etc. to do, while it participates in the system. In such environments agents need to resort to assumptions, in order to establish what actions are appropriate to perform, and they need to do so dynamically, since the environment, the agents that exist in it, the information that is exchanged between them, and the normative relations between them change over time. In earlier work, we had proposed Default Theory construction to support dynamic assumption-based reasoning. We argued that in this way, agents could perform both assumption identification and employment dynamically, contrary to other approaches to assumption-based reasoning, which catered for either one or the other. A shortcoming of this early proposal of ours, though, is that Default Theory construction seems to require proof, which is notably computationally expensive. In this paper we present a computational technique that can be used for this construction in an incremental manner that does not depend on proof, and a prototype tool that we developed for experimentation. In a nutshell, depending on their current knowledge at any given time, agents can identify appropriate candidate assumptions in an ad hoc manner. When such choices need to be revised, agents can reconstruct their view of the possible world in which they find themselves, and establish their revised assumption requirements at run-time. This paper is an extended version of the work presented at the 2008 IEEE/WI/ACM Int. Conf. on Intelligent Agent Technology, 9-12 December, Sydney, Australia.
动态规范智能体系统中基于假设的推理
在本文中,我们讨论了开放智能体系统中基于假设的动态推理,在这种系统中,智能体不可避免地对其环境和其他智能体具有不完全的知识。在这样的系统中,主体之间的互动通常受到规范的约束,规范规定了每个主体在参与系统时必须做什么、允许做什么、禁止做什么、授权做什么等。在这样的环境中,代理需要求助于假设,以便确定适合执行的操作,并且它们需要动态地这样做,因为环境、其中存在的代理、它们之间交换的信息以及它们之间的规范关系会随着时间而变化。在早期的工作中,我们提出了默认理论构建来支持基于假设的动态推理。我们认为,通过这种方式,智能体可以动态地进行假设识别和就业,这与其他基于假设的推理方法相反,这些方法要么满足其中一个,要么满足另一个。然而,我们这个早期建议的一个缺点是,默认理论的构造似乎需要证明,这在计算上是非常昂贵的。在本文中,我们提出了一种计算技术,该技术可以以一种不依赖于证明的增量方式用于这种构造,以及我们为实验开发的原型工具。简而言之,根据它们在任何给定时间的当前知识,代理可以以一种特殊的方式识别适当的候选假设。当这些选择需要修改时,代理可以重建它们对可能世界的看法,并在运行时建立它们修改后的假设需求。本文是在2008年IEEE/WI/ACM Int上发表的工作的扩展版本。智能代理技术研讨会,12月9-12日,悉尼,澳大利亚。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信