Thu 27 Aug 2026 15:30 - 16:00 at HO221 Presidents Room - Thursday Afternoon Session 2 Chair(s): Kyle Dewey

We present a hybrid framework that combines Answer Set Programming (ASP) for baseline schedule generation with L-DINF for local, explainable adaptation under disruptions. The key technical contribution is a compilation from relevant ASP scheduling artifacts to L-DINF beliefs, intentions, feasibility conditions, and preferences. This allows agents to perform bounded local repair and inter-group delegation when the baseline schedule becomes infeasible, while preserving a fallback to ASP re-optimization for non-local changes. We present a proof-of-concept executable realization in DALI, an agent-oriented logic programming language, for the L-DINF fragment, validated through an execution trace on SICStus Prolog. The proposal is discussed on a healthcare proof-of-concept and positioned as a logic-based architecture for combining global constraint solving with local epistemic adaptation.

Thu 27 Aug

Displayed time zone: Eastern Time (US & Canada) change

15:30 - 17:30
Thursday Afternoon Session 2LOPSTR+PPDP at HO221 Presidents Room
Chair(s): Kyle Dewey California State University, Northridge
15:30
30m
Talk
From Constraints to Cognition: A Hybrid Framework for Adaptive, Explainable SchedulingRemoteBest Paper Award
LOPSTR+PPDP
Stefania Costantini Dipartimento di Ingegneria e Scienze dell'Informazione eMatematica, Univ. dell'Aquila, Valentina Pitoni Univaq, Andrea Formisano Università di Perugia , Lorenzo De Lauretis Univaq
16:00
30m
Talk
Strong and NAF Negations in Answer Set ProgrammingRemote
LOPSTR+PPDP
Yuliya Lierler University of Nebraska
16:30
30m
Talk
Convenient Algebraic Programming with Coercive Subtyping
LOPSTR+PPDP
Henry Blanchette University of Maryland at College Park, USA, Aaron Stump Boston College