Debugging non-ground ASP programs with Choice Rules, Cardinality Constraints and Weight Constraints. Polleres, A., Frühstück, M., Schenner, G., & Friedrich, G. In Cabalar, P. & Son, T. C., editors, Proceedings of the 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-2013), volume 8148, of Lecture Notes in Computer Science (LNCS), pages 452–464, Corunna, Spain, September, 2013. Springer.
Debugging non-ground ASP programs with Choice Rules, Cardinality Constraints and Weight Constraints [pdf]Paper  abstract   bibtex   
When deploying Answer Set Programming (ASP)in an industrial context, for instance for (re-)configuration (Friedrich et al., 2011), knowledge engineers need debugging support on non-ground programs. Current approaches to ASP debugging, however, do not cover extended modeling features of ASP, such as choice rules, conditional cardinality and weight constraints. To this end, we encode non-ground ASP programs using extended modeling features into normal logic progams; this encoding extends existing encodings for the case of ground programs to the non-ground case. We subsequently deploy this translation in order to extend ASP debugging for non-ground normal logic programs. We have implemented and tested the approach and provide evaluation results.

Downloads: 0