English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 84662/113307 (75%)
造訪人次 : 22334199      線上人數 : 641
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    政大機構典藏 > 商學院 > 資訊管理學系 > 會議論文 >  Item 140.119/75981
    請使用永久網址來引用或連結此文件: http://nccur.lib.nccu.edu.tw/handle/140.119/75981

    題名: A temporal logic for the interaction of strategies
    作者: Wang, F.;Huang, C.-H.;Yu, Fang
    貢獻者: 資管系
    關鍵詞: expressiveness;games;logic;Lower complexity;Model checking problem;Model-checking algorithms;Real world projects;turn-based;Calculations;Game theory;Intelligent agents;Multi agent systems;Specifications;Temporal logic;Model checking
    日期: 2011
    上傳時間: 2015-06-22 13:20:34 (UTC+8)
    摘要: We propose an extension to ATL (alternating-time logic), called BSIL (basic strategy-interaction logic), for the specification of interaction among the strategies of agents in a multi-agent system. BSIL allows for the specifications of one system strategy that can cooperate with several strategies of the environment for different requirements. We argue that such properties are important in practice and rigorously show that such properties are not expressible in ATL *, GL (game logic), and AMC (alternating μ-calculus). Specifically, we show that BSIL is more expressive than ATL but incomparable with ATL*, GL, and AMC in expressiveness. We show that a memoryful strategy is necessary for fulfilling a specification in BSIL. We also show that the model-checking problem of BSIL is PSPACE-complete and is of lower complexity than those of ATL*, GL, AMC, and the general strategy logics. This may imply that BSIL can be useful in closing the gap between real-world projects and the game-theoretical results. We then show the plausibility and feasibility of our techniques by reporting our implementation and experiment with our PSPACE model-checking algorithm for BSIL. Finally, we discuss an extension of BSIL. © 2011 Springer-Verlag.
    關聯: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Volume 6901 LNCS, 2011, Pages 466-481, 22nd Conference on Concurrency Theory, CONCUR 2011; Aachen; Germany; 6 September 2011 到 9 September 2011; 代碼 86492
    資料類型: conference
    DOI 連結: http://dx.doi.org/10.1007/978-3-642-23217-6_31
    DOI: 10.1007/978-3-642-23217-6_31
    顯示於類別:[資訊管理學系] 會議論文


    檔案 描述 大小格式瀏覽次數


    社群 sharing

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋