International Conference on Logic Programming and Nonmonotonic Reasoning

LPNMR 2013: Logic Programming and Nonmonotonic Reasoning pp 452-464

Debugging Non-ground ASP Programs with Choice Rules, Cardinality and Weight Constraints

  • Axel Polleres
  • Melanie Frühstück
  • Gottfried Schenner
  • Gerhard Friedrich
Conference paper

DOI: 10.1007/978-3-642-40564-8_45

Volume 8148 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Polleres A., Frühstück M., Schenner G., Friedrich G. (2013) Debugging Non-ground ASP Programs with Choice Rules, Cardinality and Weight Constraints. In: Cabalar P., Son T.C. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2013. Lecture Notes in Computer Science, vol 8148. Springer, Berlin, Heidelberg

Abstract

When deploying Answer Set Programming (ASP) in an industrial context, for instance for (re-)configuration [5], 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 literals, cardinality and weight constraints [13]. 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 [4,10,11] to the non-ground case. We subsequently deploy this translation on top of an existing ASP debugging approach for non-ground normal logic programs [14]. We have implemented and tested the approach and provide evaluation results.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Axel Polleres
    • 1
  • Melanie Frühstück
    • 1
  • Gottfried Schenner
    • 1
  • Gerhard Friedrich
    • 2
  1. 1.Siemens AG ÖsterreichViennaAustria
  2. 2.Alpen-Adria UniversitätKlagenfurtAustria