Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming and Nonmonotonic Reasoning

LPNMR 2009: Logic Programming and Nonmonotonic Reasoning pp 631–633Cite as

Making Your Hands Dirty Inspires Your Brain! Or How to Switch ASP into Production Mode

  • Conference paper

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

Abstract

Rising from strong theoretical foundations in Logic Programming and Nonmonotonic Reasoning, Answer Set Programming (ASP) came to life as a declarative problem solving paradigm [1,2,3] in the late nineties. The further development of ASP was greatly inspired by the early availability of efficient and robust ASP solvers, like smodels [4] and dlv [5]. The community started modeling with ASP and a first milestone was the conception of TheoryBase [6] providing a systematic and scalable source of benchmarks stemming from combinatorial problems. Although the scalability of such benchmarks is of great value for empirically evaluating systems, the need for application-oriented benchmarks was early perceived. The demand for systematic benchmarking led to the Dagstuhl initiative and with it the creation of the web-based benchmark archive asparagus [7]. This repository has in the meantime grown significantly, mainly due to the two past ASP competitions [8,9], and contains nowadays a whole variety of different types of benchmarks, although it is still far from being comprehensive.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

References

  1. Niemelä, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25(3-4), 241–273 (1999)

    Article  MathSciNet  MATH  Google Scholar 

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

    Chapter  Google Scholar 

  3. Lifschitz, V.: Answer set planning. In: de Schreye, D. (ed.) Proceedings of ICLP 1999, pp. 23–37. MIT Press, Cambridge (1999)

    Google Scholar 

  4. Niemelä, I., Simons, P.: Evaluating an algorithm for default reasoning. In: Working Notes of the IJCAI 1995 Workshop on Applications and Implementations of Nonmonotonic Reasoning Systems, pp. 66–72 (1995)

    Google Scholar 

  5. Eiter, T., Leone, N., Mateis, C., Pfeifer, G., Scarcello, F.: A deductive system for nonmonotonic reasoning. In: Dix, J., Furbach, U., Nerode, A. (eds.) LPNMR 1997. LNCS (LNAI), vol. 1265, pp. 363–374. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  6. Cholewiński, P., Marek, V., Mikitiuk, A., Truszczyński, M.: Experimenting with nonmonotonic reasoning. In: Sterling, L. (ed.) Proceedings of ICLP 1995, pp. 267–281. MIT Press, Cambridge (1995)

    Google Scholar 

  7. Borchert, P., Anger, C., Schaub, T., Truszczyński, M.: Towards systematic benchmarking in answer set programming: The Dagstuhl initiative. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 3–7. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  8. Gebser, M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T., Truszczyński, M.: The first answer set programming system competition. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 3–17. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczyński, M.: The second answer set programming competition. In: [17] (to appear)

    Google Scholar 

  10. Nogueira, M., Balduccini, M., Gelfond, M., Watson, R., Barry, M.: An A-prolog decision support system for the space shuttle. In: Ramakrishnan, I.V. (ed.) PADL 2001. LNCS, vol. 1990, pp. 169–183. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Simons, P., Niemelä, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence 138(1-2), 181–234 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  12. Faber, W., Greco, G., Leone, N.: Magic sets and their application to data integration. Journal of Computer and System Sciences 73(4), 584–609 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  13. Mellarkod, V., Gelfond, M.: Integrating answer set reasoning with constraint solving techniques. In: Garrigue, J., Hermenegildo, M.V. (eds.) FLOPS 2008. LNCS, vol. 4989, pp. 15–31. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  14. Gebser, M., Ostrowski, M., Schaub, T.: Constraint answer set solving. In: Hill, P., Warren, D. (eds.) Proceedings of ICLP 2009, pp. 235–249. Springer, Heidelberg (2009)

    Google Scholar 

  15. Gebser, M., Kaufmann, B., Schaub, T.: Solution enumeration for projected Boolean search problems. In: van Hoeve, W., Hooker, J. (eds.) Proceedings of CPAIOR 2009, pp. 71–86. Springer, Heidelberg (2009)

    Google Scholar 

  16. Gebser, M., Kaufmann, B., Schaub, T.: The conflict-driven answer set solver clasp: Progress report. In: [17] (to appear)

    Google Scholar 

  17. Erdem, E., Lin, F., Schaub, T. (eds.): LPNMR 2009. Springer, Heidelberg (2009)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität Potsdam, August-Bebel-Str. 89, D-14482, Potsdam

    Torsten Schaub

Authors
  1. Torsten Schaub
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Engineering and Natural Sciences, Sabanci University, Orhanli, Tuzla, 34956, Istanbul, Turkey

    Esra Erdem

  2. Department of Computer Science, Hong Kong University of Science and Technology, Clear Water Bay,, Hong Kong

    Fangzhen Lin

  3. Institut für Informatik, Universität Potsdam, August-Bebel-Str. 89, D-14482, Potsdam, Germany

    Torsten Schaub

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schaub, T. (2009). Making Your Hands Dirty Inspires Your Brain! Or How to Switch ASP into Production Mode. In: Erdem, E., Lin, F., Schaub, T. (eds) Logic Programming and Nonmonotonic Reasoning. LPNMR 2009. Lecture Notes in Computer Science(), vol 5753. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04238-6_73

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04238-6_73

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04237-9

  • Online ISBN: 978-3-642-04238-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation