Modal Logic for Strategic Reasoning in AI
The overall aim of this course is to develop intellectual and practical skills in the use of modal logics for knowledge representation and automated reasoning in Artificial Intelligence.
The first part of the course will focus on general modal logic: modal and temporal operators, Kripke frames and models, and the basics of the model theory of modal logics, including the notions of satisfaction and validity, their computational complexity, as well as invariance under bisimulation.
This part is meant to lay the foundations of the specification of strategic behaviours of agents in multi-agent systems (MAS), which will be covered in the second part. We will introduce the language of Alternating-time Temporal Logic (ATL), an extension of the temporal logics CTL and LTL, which allows to express game-theoretical notions such as the existence of a winning strategy for a group of agents.
Along the lectures we will analyse the various assumptions that can be made about the reasoning capabilities of autonomous agents: agents can have perfect observability on the environment in which they are interacting with the other agents, or they might only have partial observability; they might remember all the sequence of events leading to their current state, or their memory might be limited in some way. The students will learn the consequences in terms of valid/satisfiable formulas of these modelling assumptions, as well as will become capable of recognising in what cases these different modeling choices are appropriate given a particular MAS scenario.
Moreover, we will investigate how the complexity of the model checking problem for ATL depends on these modeling choices. Model checking algorithms will be illustrated for all cases in which the problem is decidable, while undecidable cases will also be explained shortly.
At the end of this course the students will acquire the ability to
- Recognise and demonstrate understanding of the distinctive features of modal operators.
- Understand and recall the definitions of the logics and logical systems presented in the course, and the ideas of the main proofs.
- Appreciate the differences in the various logics, and their expressive power and limitations.
- Model concrete examples of multi-agent systems (MAS) by using the framework of concurrent game structures.
- Translate informal specifications of strategic abilities of agents in MAS, expressed in the English language, into formulas of temporal logics LTL and CTL, and Alternating-time Temporal Logic ATL.
- Recognise the differences in modeling agents having perfect/imperfect information about the environment and the other agents, as well as agents having perfect/imperfect recall of past events.
- Apply the model checking algorithms underpinning the verification of ATL properties in concurrent game structures.
The overall structure of the course can be outlined as follows:
- Basic Concepts
- Modal Languages
- Kripke Models and Frames
- Modal Consequence Relations, Decision Problems, Validity
- Normal Modal Logics
- Invariance Results, Bisimulations
- Standard Translation
- Characterization and Definability
- Simulation and Safety
- Frame Definability and Second-Order Logic
- Definable and Undefinable Properties
- Finite Frames
- Automatic First-Order Correspondence
- Reasoning about Systems
- Multi-Agent Systems
- The Role of Logics for MAS
- Formal Verification
- Reasoning about Time and Change
- Temporal Logics
- Linear Temporal Logic (LTL)
- Computation Tree Logic (CTL)
- Complexity of Model Checking Temporal Logics
- Reasoning about Strategic Abilities
- Concurrent Game Structures
- Alternating-Time Temporal Logic
- Agents, Systems, Games
- Verification of Strategic Ability
- Properties of Alternating-time Temporal Logic (validity and satisfiability problems)
- Model Checking ATL
- Model Checking ATL*
- Abilities under Imperfect Information
- Strategies and Knowledge
- Properties of ATL under imperfect information (validity and satisfiability problems)
- The Subjective Interpretation
Familiarity with propositional logic and classic first-order predicate logic, e.g. the contents of course COMP40003 Logic, or COMP40012 Logic And Reasoning.
COMP60022 Systems Verification is useful, but not essential.
7 weeks of 3 hours of lecture + 1 hours of tutorial
End of course wrap up and revision lectures (2 hours)
On week 2 and 4 we will give the students a sheet containing exercises slightly more challenging compared to the tutorials, which basically require some research in the provided references.
Students will have two weeks to complete each coursework, but our target is that each sheet can be completed in a single week. They will be allowed to work in pairs.
This is intended to make sure that everyone is keeping pace with the course, and to give the students regular feedback about their progress.
Each coursework will be submitted through CATe.
Submissions will subsequently be marked by TAs.
Our aim is to return each marked coursework within two weeks.
This should be achievable with the course leaders plus a single TAs.