{"title":"Reasoning about Plan Revision in Agent Programs","authors":"N. Alechina","doi":"10.1109/TIME.2012.23","DOIUrl":null,"url":null,"abstract":"This talk is on reasoning about agent programs written in Belief, Desire and Intention (BDI) agent programming languages. BDI programming languages (for example, [1], [2], [3]) have high-level programming primitives which correspond to the beliefs, goals and plans of an AI agent. A program contains a set of rules which allow the agent to adopt plans given its current beliefs and goals. Plans are essentially imperative programs. For example, an agent may have a rule which says that if it believes that it is currently located in room 1 and its goal is to be in room 2, then a suitable plan to adopt would be to exit room 1, turn right, move forward for 3 meters, turn right, and enter room 2.","PeriodicalId":137826,"journal":{"name":"2012 19th International Symposium on Temporal Representation and Reasoning","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 19th International Symposium on Temporal Representation and Reasoning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TIME.2012.23","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This talk is on reasoning about agent programs written in Belief, Desire and Intention (BDI) agent programming languages. BDI programming languages (for example, [1], [2], [3]) have high-level programming primitives which correspond to the beliefs, goals and plans of an AI agent. A program contains a set of rules which allow the agent to adopt plans given its current beliefs and goals. Plans are essentially imperative programs. For example, an agent may have a rule which says that if it believes that it is currently located in room 1 and its goal is to be in room 2, then a suitable plan to adopt would be to exit room 1, turn right, move forward for 3 meters, turn right, and enter room 2.