BEGIN:VCALENDAR
VERSION:2.0
PRODID:www.dresden-science-calendar.de
METHOD:PUBLISH
CALSCALE:GREGORIAN
X-MICROSOFT-CALSCALE:GREGORIAN
X-WR-TIMEZONE:Europe/Berlin
BEGIN:VTIMEZONE
TZID:Europe/Berlin
X-LIC-LOCATION:Europe/Berlin
BEGIN:DAYLIGHT
TZNAME:CEST
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
DTSTART:19810329T030000
RRULE:FREQ=YEARLY;INTERVAL=1;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:CET
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
DTSTART:19961027T030000
RRULE:FREQ=YEARLY;INTERVAL=1;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:DSC-13611
DTSTART;TZID=Europe/Berlin:20171102T091500
SEQUENCE:1509608945
TRANSP:OPAQUE
DTEND;TZID=Europe/Berlin:20171102T101500
URL:https://dresden-science-calendar.de/calendar/en/detail/13611
LOCATION:TUD Andreas-Pfitzmann-Bau\, Nöthnitzer Straße 4601069 Dresden
SUMMARY:Zarrieß: Verification of Golog Programs over Description Logic Act
 ions
CLASS:PUBLIC
DESCRIPTION:Speaker: Dipl.-Inf. Benjamin Zarrieß\nInstitute of Speaker: In
 stitut für Theoretische Informatik\, Automatentheorie\nTopics:\nInformati
 k\n Location:\n  Name: TUD Andreas-Pfitzmann-Bau (APB 3027)\n  Street: Nö
 thnitzer Straße 46\n  City: 01069 Dresden\n  Phone: \n  Fax: \nDescriptio
 n: Golog is a powerful programming language for logic-based agents. The pr
 imitives of the language are actions whose preconditions and effects are d
 efined in a Situation Calculus action theory using first-order logic. To d
 escribe possible courses of actions the programmer can freely combine impe
 rative control structures with constructs for non-deterministic choice\, l
 eaving it to the system to resolve the non-determinism in a suitable manne
 r. Golog has been successfully used for high-level decision making in the 
 area of cognitive robotics. Obviously\, it is important to verify certain 
 properties of a Golog program before executing it on a physical robot. How
 ever\, due to the high expressiveness of the language the verification pro
 blem is in general undecidable. In this thesis\, we study the verification
  problem for Golog programs over actions defined in action languages based
  on Description Logics and explore the boundary between decidable and unde
 cidable fragments.
DTSTAMP:20260707T140547Z
CREATED:20171020T073609Z
LAST-MODIFIED:20171102T074905Z
END:VEVENT
END:VCALENDAR