scholarly journals Reasoning about Knowledge and Strategies: Epistemic Strategy Logic

2014 ◽  
Vol 146 ◽  
pp. 27-33 ◽  
Author(s):  
Francesco Belardinelli
2014 ◽  
Vol 70 ◽  
pp. 10-22 ◽  
Author(s):  
Joseph Y. Halpern ◽  
Leandro C. Rêgo

Mathematics ◽  
2021 ◽  
Vol 9 (23) ◽  
pp. 3052
Author(s):  
Liping Xiong ◽  
Sumei Guo

Specification and verification of coalitional strategic abilities have been an active research area in multi-agent systems, artificial intelligence, and game theory. Recently, many strategic logics, e.g., Strategy Logic (SL) and alternating-time temporal logic (ATL*), have been proposed based on classical temporal logics, e.g., linear-time temporal logic (LTL) and computational tree logic (CTL*), respectively. However, these logics cannot express general ω-regular properties, the need for which are considered compelling from practical applications, especially in industry. To remedy this problem, in this paper, based on linear dynamic logic (LDL), proposed by Moshe Y. Vardi, we propose LDL-based Strategy Logic (LDL-SL). Interpreted on concurrent game structures, LDL-SL extends SL, which contains existential/universal quantification operators about regular expressions. Here we adopt a branching-time version. This logic can express general ω-regular properties and describe more programmed constraints about individual/group strategies. Then we study three types of fragments (i.e., one-goal, ATL-like, star-free) of LDL-SL. Furthermore, we show that prevalent strategic logics based on LTL/CTL*, such as SL/ATL*, are exactly equivalent with those corresponding star-free strategic logics, where only star-free regular expressions are considered. Moreover, results show that reasoning complexity about the model-checking problems for these new logics, including one-goal and ATL-like fragments, is not harder than those of corresponding SL or ATL*.


2013 ◽  
Vol 65 (2) ◽  
pp. 73-84 ◽  
Author(s):  
Joseph Y. Halpern ◽  
Leandro C. Rêgo

Author(s):  
Ming Dong ◽  
Jianzhong Cha ◽  
Mingcheng E

Abstract In this paper, we realize knowledge-based discrete event simulation model’s representation, reasoning and implementation by means of object-oriented(OO) frame language. Firstly, a classes library of simulation models is built by using the OO frame language. And then, behaviours of simulation models can be generated by inference engines reasoning about knowledge base. Lastly, activity cycle diagrams can be used to construct simulation network logic models by connecting the components classes of simulation models. This kind of knowledge-based simulation models can effectively solve the modeling problems of complex and ill-structure systems.


Sign in / Sign up

Export Citation Format

Share Document