{"id":1628,"date":"2012-11-28T10:38:27","date_gmt":"2012-11-28T10:38:27","guid":{"rendered":"http:\/\/www.illc.uva.nl\/lgc\/seminar\/?p=1628"},"modified":"2012-12-04T09:17:48","modified_gmt":"2012-12-04T09:17:48","slug":"logiciclira-session-with-hans-van-ditmarsch-and-thomas-bolander","status":"publish","type":"post","link":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/2012\/11\/logiciclira-session-with-hans-van-ditmarsch-and-thomas-bolander\/","title":{"rendered":"LogiCIC\/LIRa session: Hans van Ditmarsch and Thomas Bolander"},"content":{"rendered":"<p>On December 6, we will have a we will have a long LogiCIC\/LIRa joint session with two talks by\u00a0Hans van Ditmarsch and Thomas Bolander. Please note that the session will be held from <strong>15:00 to 18:00<\/strong>.<\/p>\n<p>Everyone is cordially invited!<\/p>\n<p>FIRST TALK:<br \/>\nSpeaker: <strong>Thomas Bolander<\/strong>,\u00a0Technical University of Denmark<br \/>\nTitle: <strong>Don\u2019t Plan for the Unexpected: Planning Based on Plausibility Models<\/strong><br \/>\nDate and Time: December 6, 2012, <strong>15:00-16:30<\/strong><br \/>\nVenue: Science Park 904, Room <strong>B0.201<\/strong><br \/>\nAbstract:<br \/>\nWe present a framework for automated planning based on plausibility\u00a0models, as well as algorithms for computing plans in this framework.\u00a0Our plausibility models include postconditions, as ontic effects are\u00a0essential for most planning purposes. The framework presented extends\u00a0a previously developed framework based on dynamic epistemic logic\u00a0(DEL), without plausibilities\/beliefs. In the pure epistemic\u00a0framework, one can distinguish between strong and weak epistemic\u00a0plans for achieving some, possibly epistemic, goal. By taking all\u00a0possible outcomes of actions into account, a strong plan guarantees\u00a0that the agent achieves this goal. Conversely, a weak plan promises\u00a0only the possibility of leading to the goal. In real-life planning\u00a0scenarios where the planning agent is faced with a high degree of\u00a0uncertainty and an almost endless number of possible exogenous events,\u00a0strong epistemic planning is not computationally feasible. Weak epistemic planning is not satisfactory either, as there is no way to\u00a0qualify which of two weak plans is more likely to lead to the goal.\u00a0This seriously limits the practical uses of weak planning, as the\u00a0planning agent might for instance always choose a plan that relies on\u00a0serendipity. In the present paper we introduce a planning framework\u00a0with the potential of overcoming the problems of both weak and strong\u00a0epistemic planning. This framework is based on plausibility models,\u00a0allowing us to define different types of plausibility planning. The\u00a0simplest type of plausibility plan is one in which the goal will be\u00a0achieved when all actions in the plan turn out to have the outcomes a\u00a0priori believed most plausible by the agent. This covers many cases of\u00a0everyday planning by human agents, where we\u2014to limit our computational\u00a0efforts\u2014only plan for the most plausible outcomes of our actions.<\/p>\n<p>SECOND TALK:<br \/>\nSpeaker: <strong>Hans van Ditmarsch<\/strong>, LORIA, Nancy &amp; (associate) IMSc, Chennai<br \/>\nTitle: <strong>Refinement modal logic<\/strong><br \/>\nDate and Time: December 6, 2012, <strong>16:30-18:00<\/strong><br \/>\nVenue: Science Park 904, Room <strong>B0.201<\/strong><br \/>\nAbstract:<br \/>\nThis is joint work with Laura Bozzelli, Tim French, James Hales, and Sophie Pinchinat.In this talk I will present refinement modal logic. A refinement is like a bisimulation, except that from the three relational requirements only &#8216;atoms&#8217; and &#8216;back&#8217; need to be satisfied. Our logic contains a new operator &#8216;forall&#8217; in addition to the standard modalities box for each agent. The operator &#8216;forall&#8217; 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. We are highly interested in applications of this logic to epistemic planning.<\/p>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>On December 6, we will have a we will have a long LogiCIC\/LIRa joint session with two talks by\u00a0Hans van Ditmarsch and Thomas Bolander. Please note that the session will be held from 15:00 to 18:00.<br \/>\nEveryone is cordially invited!<br \/>\nFIRST TALK:<br \/>\nSpeaker: Thomas Bolander,\u00a0Technical University of Denmark<br \/>\nTitle: Don\u2019t Plan for the Unexpected: Planning Based on Plausibility Models<br \/>\nDate [&#8230;]<\/p>\n","protected":false},"author":11,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[14,4],"tags":[],"class_list":["post-1628","post","type-post","status-publish","format-standard","hentry","category-all","category-events"],"_links":{"self":[{"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/posts\/1628","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/users\/11"}],"replies":[{"embeddable":true,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/comments?post=1628"}],"version-history":[{"count":22,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/posts\/1628\/revisions"}],"predecessor-version":[{"id":1653,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/posts\/1628\/revisions\/1653"}],"wp:attachment":[{"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/media?parent=1628"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/categories?post=1628"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/projects.illc.uva.nl\/lgc\/seminar\/wp-json\/wp\/v2\/tags?post=1628"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}