BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//IEEE Toronto Section - ECPv6.15.17//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.ieeetoronto.ca
X-WR-CALDESC:Events for IEEE Toronto Section
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Toronto
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20160313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20161106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20170312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20171105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Toronto:20170123T120000
DTEND;TZID=America/Toronto:20170123T130000
DTSTAMP:20260506T153255
CREATED:20210430T002611Z
LAST-MODIFIED:20210430T005110Z
UID:10000097-1485172800-1485176400@www.ieeetoronto.ca
SUMMARY:Abstraction in Situation Calculus Action Theories
DESCRIPTION:Monday January 23\, 2017 at 12:00 p.m. Bita Banihashemi\, PhD Candidate in Computer Science at York University\, will be presenting “Abstraction in Situation Calculus Action Theories”. \nSpeaker: Bita Banihashemi\nPhD Candidate\, Computer Science\nYork University \nDay & Time: Monday\, January 23\, 2017\n12:00 p.m. – 1:00 p.m. \nLocation: Room TRS2164\, 575 Bay Street (entrance at 55 Dundas Street West)\, Ryerson University \nContact: Maryam Davoudpour \nOrganizer: WIE\, Magnetics\, Measurement/Instrumentation-Robotics \nAbstract: We develop a general framework for agent abstraction based on the situation calculus and the ConGolog agent programming language. We assume that we have a high-level specification and a low-level specification of the agent\, both represented as basic action theories. A refinement mapping specifies how each high-level action is implemented by a low-level ConGolog program and how each high-level fluent can be translated into a low-level formula. We define a notion of sound abstraction between such action theories in terms of the existence of a suitable bisimulation between their respective models. Sound abstractions have many useful properties that ensure that we can reason about the agent’s actions (e.g.\, executability\, projection\, and planning) at the abstract level\, and refine and concretely execute them at the low level. We also characterize the notion of complete abstraction where all actions (including exogenous ones) that the high level thinks can happen can in fact occur at the low level. \nBiography: Bita Banihashemi is currently a PhD candidate in Computer Science at York University. Her research is primarily focused on agent supervision\, which is a form of control/customization of an agent’s behavior. Her research interests include Knowledge Representation and Reasoning\, Autonomous Agents and Multi-agent Systems\, and AI and the Web.
URL:https://www.ieeetoronto.ca/event/abstraction-in-situation-calculus-action-theories/
LOCATION:Room TRS2164\, 575 Bay Street (entrance at 55 Dundas Street West)\, Ryerson University
CATEGORIES:Instrumentation & Measurement,Magnetics,Women in Engineering
END:VEVENT
END:VCALENDAR