This document discusses implementing explanation-based argumentation using answer set programming. It begins with background on argumentation frameworks and their limitations in modeling real arguments. It then presents Pollock's puzzle as an example where current frameworks struggle. The document proposes an approach called explanation-based argumentation that models arguments as explanations for observations. These explanations can be generated, deleted if impossible, and evaluated based on how well they fit observations. The document concludes that answer set programming is well-suited to implement this approach due to its declarative problem modeling and search capabilities.