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:20260423T133000
DTEND;TZID=America/Chicago:20260423T153000
DTSTAMP:20260430T212412Z
SUMMARY:Sergio Servantez Final Defense April 23: Large Language Models as Legal Reasoners
UID:641502@northwestern.edu
TZID:America/Chicago
DESCRIPTION:The legal system is built upon complex bodies of written text that function as operative rules governing rights\, obligations\, and outcomes. Recent advances in natural language processing have created new opportunities to automate aspects of legal analysis using language models (LMs). However\, these models remain fundamentally probabilistic systems optimized for statistical prediction rather than faithful rule application. As a result\, they often generate fluent legal language while failing to perform the precise\, multi-step reasoning required to correctly interpret and apply legal rules. This dissertation investigates how language models can be improved and rigorously evaluated as legal reasoners through the integration of symbolic representations and methods grounded in legal domain knowledge.  Focusing on a tractable subset of legal tasks termed computational legal reasoning\, this work develops neurosymbolic approaches that structure legal interpretation\, rule application\, and evaluation. First\, it introduces a system for transforming natural language contracts into machine-readable representations through the extraction of Obligation Logic Graphs (OLGs)\, enabling contractual obligations to be represented as structured logical relationships and translated into executable code. Second\, it presents Chain of Logic\, a prompting method designed to improve rule-based reasoning in language models by decomposing compositional rules into their constituent elements before recombining the results to reach a final conclusion. Third\, it introduces OpenExempt\, a dynamic framework and benchmark that generates natural language legal tasks and their solutions from expert-crafted encodings of statutes and case facts\, enabling fine-grained diagnostic evaluation of model behavior across controlled variations in reasoning complexity and task structure. Together\, these contributions advance the study of language models as legal reasoners by introducing methods that improve interpretability\, reliability\, and diagnostic evaluation.
LOCATION:Mudd Hall ( formerly Seeley G. Mudd Library)\, 3501\, 2233 Tech Drive\, Evanston\, IL 60208
TRANSP:OPAQUE
URL:https://planitpurple.northwestern.edu/event/641502
CREATED:20260408T050000Z
STATUS:CONFIRMED
LAST-MODIFIED:20260409T184703Z
PRIORITY:0
BEGIN:VALARM
TRIGGER:-PT10M
ACTION:DISPLAY
DESCRIPTION:Reminder
END:VALARM
END:VEVENT
END:VCALENDAR