Answer Set Programming Unplugged: Describing the Rules, Letting Solvers Find Solutions

A deep dive into ASP, where problems are described by rules rather than step-by-step instructions. We explore stable models, ANSProlog features (choice rules, cardinality bounds, variables, ranges, conditional literals), and how ASP solvers like SMODELS search for solutions. From graph coloring and the traveling salesman problem to natural language processing and bioinformatics, we’ll see how this expressive paradigm tackles NP-hard problems. Part 1 lays the groundwork; Part 2 dives into more applications and real-world uses.

Note:  This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any critical information.

Sponsored by Embersilk LLC