Handbook of theoretical computer science (vol. B)
Deontic logic in computer science: normative system specification
Deontic logic in computer science: normative system specification
Modal logic
Alternating-time temporal logic
Journal of the ACM (JACM)
Embedding Alternating-time Temporal Logic in Strategic Logic of Agency
Journal of Logic and Computation
Towards an ontology of agency and action From STIT to OntoSTIT+
Proceedings of the 2006 conference on Formal Ontology in Information Systems: Proceedings of the Fourth International Conference (FOIS 2006)
On the logic of cooperation and propositional control
Artificial Intelligence
CTL.STIT: enhancing ATL to express important multi-agent system verification properties
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
Hi-index | 0.00 |
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.