#6 - Adam Smith on Answer Set Programming

Adam Smith talks about Answer Set Programming, and how he's used it in game design and other areas.

Visit the show's web page: thesearch.space

Show notes

| Torsten Schaub at Potsdam University

Several of his presentations contain the formula

ASP = DB + LP + KR + SMT^n

ASP: Answer Set Programming
DB: Database
LP: Logic Programming
KR: Knowledge Representation
SMT: SAT Modulo Theories

SAT solver: Boolean Satisfiability

| this refraction game that I had made a puzzle generator for

Described in Adam's dissertation.

| the Potassco tools from University of Potsdam.


| A book called Procedural Content Generation in Games


| There's this idea due to Kate Compton ... of the 10 000 bowls of oatmeal problem


| We modeled a design space of information visualizations, line plots and scatter plots and bar charts

"Formalizing Visualization Design Knowledge as Constraints: Actionable and Extensible Models in Draco"

| a Python library called Clorm .. so that you can define your problem instances with Python objects


| the concept of elaboration tolerance that when someone gives you some clarification about how your domain works, can you incorporate that change by just adding more code to add more choices or more constraints?

John McCarthy's paper on elaboration tolerance

| a paper from Google DeepMind ... describing a system called the Apperception Engine

"Making sense of sensory input", Evans et al

| taught a class called Applied ASP a few years ago

Lecture slides, programming assignments, reading assignments here: canvas.ucsc.edu/courses/1338

| Once you want to write a program that's more than 30 lines long, how do you profile it? How do you test it? How do you deploy it?

Slides from a talk about Adam's test automation framework: Unit Test Automation for ASP with Ansunit

Try ASP from your browser: https://potassco.org/clingo/run/
★ Support this podcast ★
© Holmgren Interstellar, 2020