This repository contains the system t-asprin for temporal ASP with Preferences.
t-asprin combines asprin with meta-programming in clingo.
The approach is described in this short paper for TAASP'25.
To illustrate the usage of t-asprin, we model three classic planning problems — dinner, monkey, and travel — drawing from two foundational papers:
-
Bienvenu, M., Fritz, C., & McIlraith, S. A. (2011). Specifying and computing preferred plans. Artificial Intelligence, 175(7–8), 1308–1345.
🔗 ScienceDirect -
Son, T. C., & Pontelli, E. (2006). Planning with preferences using logic programming. Theory and Practice of Logic Programming, 6(5), 559–607.
🔗 Cambridge University Press
For a full walkthrough and explanation, check out the accompanying Jupyter notebook: 👉 Launch on Binder