{"title":"一种认知策略逻辑(扩展摘要)","authors":"Xiaowei Huang, R. V. D. Meyden","doi":"10.4204/EPTCS.146.5","DOIUrl":null,"url":null,"abstract":"The paper presents an extension of temporal epistemic logic with operators that quantify over strategies. The language also provides a natural way to represent what agents would know were they to be aware of the strategies being used by other agents. Some examples are presented to motivate the framework, and relationships to several variants of alternating temporal epistemic logic are discussed. The computational complexity of model checking the logic is also characterized.","PeriodicalId":53035,"journal":{"name":"Hkhmt m`Sr","volume":"16 3 1","pages":"35-41"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"An Epistemic Strategy Logic (Extended Abstract)\",\"authors\":\"Xiaowei Huang, R. V. D. Meyden\",\"doi\":\"10.4204/EPTCS.146.5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper presents an extension of temporal epistemic logic with operators that quantify over strategies. The language also provides a natural way to represent what agents would know were they to be aware of the strategies being used by other agents. Some examples are presented to motivate the framework, and relationships to several variants of alternating temporal epistemic logic are discussed. The computational complexity of model checking the logic is also characterized.\",\"PeriodicalId\":53035,\"journal\":{\"name\":\"Hkhmt m`Sr\",\"volume\":\"16 3 1\",\"pages\":\"35-41\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Hkhmt m`Sr\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.146.5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Hkhmt m`Sr","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.146.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The paper presents an extension of temporal epistemic logic with operators that quantify over strategies. The language also provides a natural way to represent what agents would know were they to be aware of the strategies being used by other agents. Some examples are presented to motivate the framework, and relationships to several variants of alternating temporal epistemic logic are discussed. The computational complexity of model checking the logic is also characterized.