BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260916T175413Z
UID:Seminar-dept-297@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20121025T160000
DTEND:20121025T170000
SUMMARY:School Seminar Series
DESCRIPTION:Prof. Hans van Ditmarsch: Refinement modal logic\n\nThis is joint work with Laura Bozzelli, Tim French, James Hales, and Sophie Pinchinat.\n\n\n\nIn this talk I will present refinement modal logic. A refinement is like a bisimulation, except that from the three relational requirements only 'atoms' and 'back' need to be satisfied. Our logic contains a new operator 'forall' in addition to the standard modalities box for each agent. The operator 'forall' acts as a quantifier over the set of all refinements of a given model. We call it the refinement operator. As a variation on a bisimulation quantifier, it can be seen as a refinement quantifier over a variable not occurring in the formula bound by the operator. The logic combines the simplicity of multi-agent modal logic with some powers of monadic second order quantification. We present a sound and complete axiomatization of multiagent refinement modal logic. There is an extension to the modal mu-calculus. It can be applied to dynamic epistemic logic: it is a form of quantifying over action models. There are results on the complexity of satisfiability, and on succinctness.\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=297
LOCATION:Ashton Lecture Theatre
END:VEVENT
END:VCALENDAR