Rethinking Answer Set Programming Templates
summary
Proposes templates for Answer Set Programming that enforce predicate locality via a naming convention and automatic renaming to universally unique identifiers, so templates transpile to plain ASP without name clashes. Demonstrates concrete templates for reachability from a start node and spanning-tree + edge-removal impact, shows they compose where naive copy/rename breaks, and integrates with a Python wrapper around clingo (dumo) for unit testing with pytest. Library is on PyPI and the approach works on contest and crafted examples.
AI-written summary · about
chapters (11)
- 0:00Introduction
- 3:12ASP without isolation
- 6:22Software programming invariants
- 9:16ASP non-monotonicity
- 11:02Teamwork failure in ASP
- 16:06ASP templates concept
- 20:49Template isolation and renaming
- 22:14Fixing spanning tree with templates
- 24:22Reusing templates in contests
- 26:27Testing and library implementation
- 27:55Q&A
related talks
42mASP: Theory, Practice, and Beyond
01h 09mPlenary: Neighborhoods Banding Together: Reasoning Globally about Programs
01h 01mRethinking the Way We Do Templates in C++
15mVerification of Templated Code in C++
40mUtilizing Structure in Combinatorial Solving and Reasoning
10mSession Preview - Interview With – Katherine Rocha
48mUsing AI in Software Design: How ChatGPT Can Help With Creating a Solution Architecture
59mKEYNOTE: The Shape of a Program