We present a logic for reasoning about choice. Choice ctl (c-ctl) extends the well-known branching-time temporal logic ctl with choice modalities, "$\Diamond$" and "□". An example c-ctl formula is $\Diamond$AFhappy, asserting that there exists a choice that will lead to happiness. c-ctl is related to both stit logics and temporal cooperation logics such as atl, but has a much simpler and (we argue) more intuitive syntax and semantics. After presenting the logic, we investigate the properties of the language. We characterise the complexity of the c-ctl model checking problem, investigate some validities, and propose multi-agent extensions to the logic.
['Wiebe van der Hoek', 'Nicolas Troquard', 'Michael Wooldridge']
Reasoning about choice