Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming and Nonmonotonic Reasoning

LPNMR 2015: Logic Programming and Nonmonotonic Reasoning pp 186–198Cite as

Performance Tuning in Answer Set Programming

  • Conference paper
  • First Online:

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

Abstract

Performance analysis and tuning are well established software engineering processes in the realm of imperative programming. This work is a step towards establishing the standards of performance analysis in the realm of answer set programming – a prominent constraint programming paradigm. We present and study the roles of human tuning and automatic configuration tools in this process. The case study takes place in the realm of a real-world answer set programming application that required several hundred lines of code. Experimental results suggest that human-tuning of the logic programming encoding and automatic tuning of the answer set solver are orthogonal (complementary) issues.

We would like to thank Joshua Irvin, Marius Lindauer, Peter Schüller, Benjamin Susman, Miroslaw Truszczynski, and Victor Winter for valuable discussions related to this paper as well as anonymous reviewers for their comments.

This is a preview of subscription content, 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 EPUB and 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

Learn about institutional subscriptions

Notes

  1. 1.

    http://potassco.sourceforge.net/.

  2. 2.

    Terms Concretion and Projection were coined by Gebser et al. [5].

  3. 3.

    http://www.cis.upenn.edu/~treebank/.

  4. 4.

    http://www.cs.ubc.ca/labs/beta/Projects/SMAC/.

  5. 5.

    http://www.cs.uni-potsdam.de/piclasp/.

References

  1. Ansótegui, C., Sellmann, M., Tierney, K.: A gender-based genetic algorithm for the automatic configuration of algorithms. In: Proceedings of the CP 2009, pp. 142–157 (2009)

    Google Scholar 

  2. Eiter, T., Fink, M.: Uniform equivalence of logic programs under the stable model semantics. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol. 2916, pp. 224–238. Springer, Heidelberg (2003). http://dx.doi.org/10.1007/978-3-540-24599-5_16

    Chapter  Google Scholar 

  3. Gebser, M., Jost, H., Kaminski, R., Obermeier, P., Sabuncu, O., Schaub, T., Schneider, M.: Ricochet robots: a transverse ASP benchmark. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 348–360. Springer, Heidelberg (2013). http://dx.doi.org/10.1007/978-3-642-40564-8_35

    Chapter  Google Scholar 

  4. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: A User’s Guide to gringo, clasp, clingo, and iclingo (2010). http://potassco.sourceforge.net

  5. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Challenges in answer set solving. In: Balduccini, M., Son, T.C. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. LNCS, vol. 6565, pp. 74–90. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  6. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T., Schneider, M.T., Ziller, S.: A portfolio solver for answer set programming: preliminary report. In: Delgrande, J.P., Faber, W. (eds.) LPNMR 2011. LNCS, vol. 6645, pp. 352–357. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  7. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Proceedings of 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 386–392. MIT Press (2007)

    Google Scholar 

  8. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of International Logic Programming Conference and Symposium, pp. 1070–1080 (1988)

    Google Scholar 

  9. Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507–523. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Hutter, F., Hoos, H., Leyton-Brown, K., Stützle, T.: ParamILS: an automatic algorithm configuration framework. J. Artif. Intell. Res. (JAIR) 36, 267–306 (2009)

    MATH  Google Scholar 

  11. Lierler, Y., Schüller, P.: Parsing combinatory categorial grammar via planning in answer set programming. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds.) Correct Reasoning. LNCS, vol. 7265, pp. 436–453. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  12. Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm. In: Apt, K.R., Marek, V.W., Truszczynski, M., Warren, D.S. (eds.) The Logic Programming Paradigm: a 25-Year Perspective, pp. 375–398. Springer Verlag, Berlin (1999)

    Chapter  Google Scholar 

  13. Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25, 241–273 (1999)

    Article  MATH  Google Scholar 

  14. Silverthorn, B., Lierler, Y., Schneider, M.: Surviving solver sensitivity: an asp practitioner’s guide. In: International Conference on Logic Programming (ICLP) (2012). http://www.cs.utexas.edu/users/ai-lab/pub-view.php?PubID=127153

Download references

Author information

Authors and Affiliations

  1. University of Nebraska at Omaha, Omaha, Nebraska, USA

    Matthew Buddenhagen & Yuliya Lierler

Authors
  1. Matthew Buddenhagen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuliya Lierler
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Matthew Buddenhagen .

Editor information

Editors and Affiliations

  1. University of Calabria, Rende, Italy

    Francesco Calimeri

  2. University of Calabria, Rende, Italy

    Giovambattista Ianni

  3. University of Kentucky Dept. Computer Science, Lexington, Kentucky, USA

    Miroslaw Truszczynski

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Buddenhagen, M., Lierler, Y. (2015). Performance Tuning in Answer Set Programming. In: Calimeri, F., Ianni, G., Truszczynski, M. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2015. Lecture Notes in Computer Science(), vol 9345. Springer, Cham. https://doi.org/10.1007/978-3-319-23264-5_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23264-5_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23263-8

  • Online ISBN: 978-3-319-23264-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation