Skip to main content
SpringerLink
Log in
SpringerLink
Log in

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

  • Conference paper
Logic Programming and Nonmonotonic Reasoning (LPNMR 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 8148))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brain, M., De Vos, M.: Debugging logic programs under the answer set semantics. In: 3rd International Workshop on Answer Set Programming, ASP 2005. CEUR Workshop Proceedings, pp. 141–152 (2005)

    Google Scholar 

  2. Caballero, R., García-Ruiz, Y., Sáenz-Pérez, F.: A theoretical framework for the declarative debugging of datalog programs. In: Schewe, K.-D., Thalheim, B. (eds.) SDKB 2008. LNCS, vol. 4925, pp. 143–159. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczyński, M.: The second answer set programming competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 637–654. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions. Theory Pract. Log. Program. 5(1-2), 45–74 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  5. Friedrich, G., Ryabokon, A., Falkner, A.A., Haselböck, A., Schenner, G., Schreiner, H.: (Re)configuration using Answer Set Programming. In: IJCAI 2011 Workshop on Configuration, pp. 17–25 (2011)

    Google Scholar 

  6. Frühstück, M., Pührer, J., Friedrich, G.: Debugging answer-set programs with Ouroboros – extending the SeaLion plugin. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS (LNAI), vol. 8148, pp. 323–328. Springer, Heidelberg (2013)

    Google Scholar 

  7. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: A user’s guide to gringo, clasp, clingo, and iclingo (2010)

    Google Scholar 

  8. Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.: Potassco: The potsdam answer set solving collection. AI Commun. 24(2), 107–124 (2011)

    MathSciNet  MATH  Google Scholar 

  9. Gebser, M., Pührer, J., Schaub, T., Tompits, H.: A meta-programming technique for debugging answer-set programs. In: Proceedings of the 23rd National Conference on Artificial Intelligence, AAAI 2008, vol. 1, pp. 448–453. AAAI Press (2008)

    Google Scholar 

  10. Gebser, M., Schaub, T.: Answer set solving in practice (2011), http://www.cs.uni-potsdam.de/~torsten/ijcai11tutorial/asp.pdf (visited on October 18, 2012)

  11. Janhunen, T., Niemelä, I.: Compact translations of non-disjunctive answer set programs to propositional clauses. In: Balduccini, M., Son, T.C. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. LNCS, vol. 6565, pp. 111–130. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  12. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The dlv system for knowledge representation and reasoning. ACM Trans. Comput. Logic 7(3), 499–562 (2006)

    Article  MathSciNet  Google Scholar 

  13. Niemelä, I., Simons, P., Soininen, T.: Stable model semantics of weight constraint rules. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS (LNAI), vol. 1730, pp. 317–331. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  14. Oetsch, J., Pührer, J., Tompits, H.: Catching the ouroboros: On debugging non-ground answer-set programs. Theory Pract. Log. Program. 10(4-6), 513–529 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  15. Oetsch, J., Pührer, J., Tompits, H.: The sealion has landed: An IDE for answer-set programming. In: 25th Workshop on Logic Programming, WLP (2011)

    Google Scholar 

  16. Pontelli, E., Son, T.C., Elkhatib, O.: Justifications for logic programs under answer set semantics. Theory Pract. Log. Program. 9(1), 1–56 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  17. Syrjänen, T.: Cardinality constraint programs. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 187–199. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Syrjänen, T.: Debugging inconsistent answer set programs. In: Proc. NMR, vol. 6, pp. 77–83 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Siemens AG Österreich, Siemensstraße 90, 1210, Vienna, Austria

    Axel Polleres, Melanie Frühstück & Gottfried Schenner

  2. Alpen-Adria Universität, Klagenfurt, Austria

    Gerhard Friedrich

Authors
  1. Axel Polleres
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Melanie Frühstück
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gottfried Schenner
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Gerhard Friedrich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Corunna, Campus de Elviña s/n, 15071, Corunna, Spain

    Pedro Cabalar

  2. Department of Computer Science, New Mexico State University, 1290 Frenger Mall, SH 123, MSC CS, P.O. Box 30001, 88003, Las Cruces, NM, USA

    Tran Cao Son

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

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. https://doi.org/10.1007/978-3-642-40564-8_45

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40564-8_45

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40563-1

  • Online ISBN: 978-3-642-40564-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation