2013/02/28 by Christophe Chareton, Julien Brunel, David Chemouil
Computer Science · Mathematics · #Artificial intelligence #Computer science #Expressive power #Formalism (music) #Linear temporal logic #Logic, Reasoning, and Knowledge #Mathematics #Multi-Agent Systems and Negotiation #Programming language #Rotation formalisms in three dimensions #Semantic Web and Ontologies #Successor cardinal #Temporal logic #Theoretical computer science #cs.LO
paper · pdf · doi:10.4204/eptcs.112.14
published as EPTCS 112, 2013, pp. 91-98 · In Proceedings SR 2013, arXiv:1303.0071
openalex publication_date 2013/02/28 · arxiv created 2013/03/04 · arxiv updated 2013/03/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/06
This article is about temporal multi-agent logics. Several of these formalisms have been already presented (ATL-ATL*, ATLsc, SL). They enable to express the capacities of agents in a system to ensure the satisfaction of temporal properties. Particularly, SL and ATLsc enable several agents to interact in a context mixing the different strategies they play in a semantical game. We generalize this possibility by proposing a new formalism, Updating Strategy Logic (USL). In USL, an agent can also refine its own strategy. The gain in expressive power rises the notion of "sustainable capacities" for agents. USL is built from SL. It mainly brings to SL the two following modifications: semantically, the successor of a given state is not uniquely determined by the data of one choice from each agent. Syntactically, we introduce in the language an operator, called an "unbinder", which explicitely deletes the binding of a strategy to an agent. We show that USL is strictly more expressive than SL.