{'fraction_non_alphanumeric': 0.03985507246376811, 'fraction_numerical': 0.0, 'mean_word_length': 4.940860215053763, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
BDI^ATL : An Alternating-Time BDI Logic for Multiagent Systems

Many logics for modelling beliefs, desires and intentions of agents, such as Rao and Georgeff’s BDI logic and Wooldridge’s LORA, are based on temporal logics like CTL/CTL∗ (Computational Tree Logic) in which the structure of time is branching in the future and linear in the past. Recently, many attempts have been made to define logics for BDI agents by using extensions of CTL. In this paper, we discuss BDI that is obtained by substituting ATL∗ (Alternating-Time Temporal Logic) to CTL∗ in Rao and Georgeff’s logic. One of the main advantages of our approach is that in BDI we can express new commitment strategies that are more realistic than those proposed by Rao and Georgeff (and that could not be defined in their logic), since they take collaboration among agents into account. In particular, in this paper we discuss three variants of Rao and Georgeff’s “open minded” commitment: “independent open minded”, “optimistic open minded”, and “pessimistic open minded”, whose definition exploits the new features that ATL∗ adds to CTL∗.