This project, which led to several publications, implements abductive reasoning with costs in First Order Horn logic using Answer Set Programming.
The specific knowledge base format and reasoning task that are supported by the framework are those in the ACCEL benchmark (Ng & Mooney, 1992), plus two further abductive cost objective functions from other papers.
Work on this project pioneered an approach for on-demand constraints in Answer Set Solving to manage reasoning in large theories. Follow-up work led to several further projects (in particular the Hexlite Solver can be counted as follow-up work) and collaborations (in particular with Francesco Ricca, Carmine Dodaro, and Bernardo Cuteri).
The tool is available at Bitbucket: bitbucket.org/knowlp/asp-fo-abduction.