BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Eventi DIAG
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:STANDARD
DTSTART:20231029T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20240331T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.27385.field_data.0@www.glad.uniroma1.it
DTSTAMP:20260405T093529Z
CREATED:20231120T191027Z
DESCRIPTION:Abstract: Fully Observable Non-deterministic (FOND) is an elabo
 ration of classical planning that has attracted much attention in recent y
 ears. It has been linked to the long-standing program synthesis problem an
 d has been used as a way to solve other types of problems such as probabil
 istic planning\, LTL synthesis\, and generalized planning. In FOND plannin
 g\, solutions are no longer linear sequence of actions\, but structures wi
 th conditionals and loops. In this talk I will give an overview of three p
 roblems in the areas of AI knowledge representation for reasoning about dy
 namic systems. I will start with the problem of AI planning with actions t
 hat have non-deterministic effects and whose solutions rely on some sort o
 f fairness assumptions in the environment. I will then present the problem
  of automatically synthesising plans for complex programs build from many 
 declarative goals. Finally\, I will discuss how AI planning can be used to
  provide a crisp approach to goal/intention recognition\, the inverse of p
 lanning that aims to understand the goal of an agent from its behaviour. T
 he aim of the talk is not to provide a detailed description or analysis of
  any of these problems\, but rather a general overview that could potentia
 lly trigger discussion and possible collaborations. Bio: Sebastian Sardina
  is a Professor at RMIT University within the School of Computing Technolo
 gies. He completed his PhD and M.Sc in the Cognitive Robotics Group at the
  University of Toronto (Canada) and\, before that\, a BSc in Computer Scie
 nce at South National University in Bahia Blanca (Argentina).  Sebastian's
  research falls in the intersection between knowledge representation for r
 easoning for action and change\, automated planning\, and intelligent agen
 ts. In a nutshell\, his research seeks better representation models and al
 gorithms for programming intelligent controllers operating in complex and 
 dynamic environments. Beyond research\, he is also interested in bringing 
 Computational Thinking (and programming) to the community\, particularly t
 o children and youth\; by delivering hands-on workshops and talks to stude
 nts and educators. He has recently been part of the panel at VCAA conducti
 ng the study design review for the new Algorithmics (HESS) VCE program.
DTSTART;TZID=Europe/Paris:20231123T120000
DTEND;TZID=Europe/Paris:20231123T120000
LAST-MODIFIED:20231120T191845Z
LOCATION:Aula Magna
SUMMARY:From Non-deterministic Planning to Agent Planning Programs and Goal
  Recognition - Prof. Sebastian Sardina
URL;TYPE=URI:http://www.glad.uniroma1.it/node/27385
END:VEVENT
END:VCALENDAR