BEGIN:VCALENDAR
PRODID:-//planitpurple.northwestern.edu//iCalendar Event//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
CLASS:PUBLIC
BEGIN:VTIMEZONE
TZID:America/Chicago
TZURL:http://tzurl.org/zoneinfo-outlook/America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:0
DTSTART;TZID=America/Chicago:20260708T183000
DTEND;TZID=America/Chicago:20260708T203000
DTSTAMP:20260706T122742Z
SUMMARY:Samuel Hill CS PhD Final Defense: Simulog: An Executable Ontology for Large Scale Character Simulations
UID:643064@northwestern.edu
TZID:America/Chicago
DESCRIPTION:Large-scale character simulations for real-time games such as Dwarf Fortress and  interactive experiences such as Bad News involve both large numbers of interacting sub simulations and very large numbers of entities being simulated. This complexity is hard to  achieve at scale while also operating with real-time performance constraints.  Logic programming and rule-based systems are often chosen for tasks such as social  simulation because their use of declarative rules and predicates map well to rules of social  engagement. Unfortunately\, they are often quite slow\, due in part to its heavy use of pointer chasing\, dynamic allocation\, garbage collection\, and runtime type-checking\, making it difficult to use for large numbers of characters or high-frequency updates. Bottom-up execution of logic programs can provide the declarativity of logic programming without the performance issues for appropriate tasks. We argue that large-scale character simulations are a “sweet spot” for bottomup logic programming.  Despite the benefits of using such a performant bottom-up logic programming language  for creating large-scale character simulations\, these simulations still often need to encode many of the same things – characters\, locations\, interactions\, and relationships to name a few. These regular components can be described as temporal entities (things that come into and out of existence) and most simulations must typically track the set of temporal entities that exist in the current simulation step as well as their states\, the events of these entities creation and destruction\, and\, when needed\, the set of all temporal entities that have ever existed. However\, without a standard language with which to describe temporal entities the creation of data structures and access patterns to encode for temporal entities could vary wildly depending on use case\, and maintenance of all this extra code (code not directly involved in game logic) would be an unnecessary burden on developers. In this thesis we will argue that temporal entities can be declaratively authored from an ontology-based representation while still maintaining playable framerates. We present Simulog\,  a very high-level declarative language for large scale character simulation based on ideas from the formal ontology literature. We will attempt to show that an ontology for these entities allows for the expressive and flexible creation of social simulations\, enabling one to declaratively author a simulation with these ontological statements while maintaining very good performance. \n\nWebcast Link: https://northwestern.zoom.us/j/91821105316
LOCATION:Mudd Hall ( formerly Seeley G. Mudd Library)\, 3001\, 2233 Tech Drive\, Evanston\, IL 60208
TRANSP:OPAQUE
URL:https://planitpurple.northwestern.edu/event/643064
CREATED:20260701T050000Z
STATUS:CONFIRMED
LAST-MODIFIED:20260701T050000Z
PRIORITY:0
BEGIN:VALARM
TRIGGER:-PT10M
ACTION:DISPLAY
DESCRIPTION:Reminder
END:VALARM
END:VEVENT
END:VCALENDAR