政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/75981
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  全文笔数/总笔数 : 109927/140876 (78%)
造访人次 : 45982840      在线人数 : 666
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻
    政大機構典藏 > 商學院 > 資訊管理學系 > 會議論文 >  Item 140.119/75981


    请使用永久网址来引用或连结此文件: https://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
    显示于类别:[資訊管理學系] 會議論文

    文件中的档案:

    档案 描述 大小格式浏览次数
    index.html0KbHTML21700检视/开启


    在政大典藏中所有的数据项都受到原著作权保护.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回馈