{"title":"建模和跟踪不一致的BDI代理","authors":"Barbara Dunin-Kęplicz, Andrzej Szałas","doi":"10.1007/s10472-023-09902-w","DOIUrl":null,"url":null,"abstract":"<div><p>The <span>Bdi</span> model of rational agency has been studied for over three decades. Many robust multiagent systems have been developed, and a number of <span>Bdi</span> logics have been studied. Following this intensive development phase, the importance of integrating <span>Bdi</span> models with inconsistency handling and revision theory have been emphasized. There is also a demand for a tighter connection between <span>Bdi</span>-based implementations and <span>Bdi</span> logics. In this paper, we address these postulates by introducing a novel, paraconsistent logical <span>Bdi</span> model close to implementation, with building blocks that can be represented as <span>Sql</span>/rule-based databases. Importantly, tractability is achieved by reasoning as querying. This stands in a sharp contrast to the high complexity of known <span>Bdi</span> logics. We also extend belief shadowing, a shallow and lightweight alternative to deep and computationally demanding belief revision, to encompass agents’ motivational attitudes.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 4","pages":"855 - 876"},"PeriodicalIF":1.2000,"publicationDate":"2023-11-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09902-w.pdf","citationCount":"0","resultStr":"{\"title\":\"Modeling and shadowing paraconsistent BDI agents\",\"authors\":\"Barbara Dunin-Kęplicz, Andrzej Szałas\",\"doi\":\"10.1007/s10472-023-09902-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>The <span>Bdi</span> model of rational agency has been studied for over three decades. Many robust multiagent systems have been developed, and a number of <span>Bdi</span> logics have been studied. Following this intensive development phase, the importance of integrating <span>Bdi</span> models with inconsistency handling and revision theory have been emphasized. There is also a demand for a tighter connection between <span>Bdi</span>-based implementations and <span>Bdi</span> logics. In this paper, we address these postulates by introducing a novel, paraconsistent logical <span>Bdi</span> model close to implementation, with building blocks that can be represented as <span>Sql</span>/rule-based databases. Importantly, tractability is achieved by reasoning as querying. This stands in a sharp contrast to the high complexity of known <span>Bdi</span> logics. We also extend belief shadowing, a shallow and lightweight alternative to deep and computationally demanding belief revision, to encompass agents’ motivational attitudes.</p></div>\",\"PeriodicalId\":7971,\"journal\":{\"name\":\"Annals of Mathematics and Artificial Intelligence\",\"volume\":\"92 4\",\"pages\":\"855 - 876\"},\"PeriodicalIF\":1.2000,\"publicationDate\":\"2023-11-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://link.springer.com/content/pdf/10.1007/s10472-023-09902-w.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Annals of Mathematics and Artificial Intelligence\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s10472-023-09902-w\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Mathematics and Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10472-023-09902-w","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
The Bdi model of rational agency has been studied for over three decades. Many robust multiagent systems have been developed, and a number of Bdi logics have been studied. Following this intensive development phase, the importance of integrating Bdi models with inconsistency handling and revision theory have been emphasized. There is also a demand for a tighter connection between Bdi-based implementations and Bdi logics. In this paper, we address these postulates by introducing a novel, paraconsistent logical Bdi model close to implementation, with building blocks that can be represented as Sql/rule-based databases. Importantly, tractability is achieved by reasoning as querying. This stands in a sharp contrast to the high complexity of known Bdi logics. We also extend belief shadowing, a shallow and lightweight alternative to deep and computationally demanding belief revision, to encompass agents’ motivational attitudes.
期刊介绍:
Annals of Mathematics and Artificial Intelligence presents a range of topics of concern to scholars applying quantitative, combinatorial, logical, algebraic and algorithmic methods to diverse areas of Artificial Intelligence, from decision support, automated deduction, and reasoning, to knowledge-based systems, machine learning, computer vision, robotics and planning.
The journal features collections of papers appearing either in volumes (400 pages) or in separate issues (100-300 pages), which focus on one topic and have one or more guest editors.
Annals of Mathematics and Artificial Intelligence hopes to influence the spawning of new areas of applied mathematics and strengthen the scientific underpinnings of Artificial Intelligence.