Skip to main content
Springer Nature Link
Log in

Challenges in Answer Set Solving

  • Chapter
Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning

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

  • 956 Accesses

Abstract

Michael Gelfond’s application of Answer Set Programming (ASP) in the context of NASA’s space shuttle has opened the door of the ivory tower. His project has not only given our community self-confidence and served us as a reference for grant agencies and neighboring fields, but ultimately it helped freeing the penguins making them exclaim “Yes, we can [fly]!”. The community has taken up this wonderful assist to establish ASP as a prime tool for declarative problem solving in the area of Knowledge Representation and Reasoning. Despite this success, however, ASP has not yet attracted broad attention outside this area. This paper aims at identifying some current challenges that our field has to overcome in the mid-run to ultimately become a full-fledged technology in Informatics.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Genesereth, M., Love, N., Pell, B.: General game playing: Overview of the AAAI competition. AI Magazine 26(2), 62–72 (2005)

    Google Scholar 

  2. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  3. Lifschitz, V., Razborov, A.: Why are there so many loop formulas? ACM Transactions on Computational Logic 7(2), 261–268 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  4. Soininen, T., Niemelä, I.: Developing a declarative rule language for applications in product configuration. In: Gupta, G. (ed.) PADL 1999. LNCS, vol. 1551, pp. 305–319. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  6. Boenn, G., Brain, M., de Vos, M., Fitch, J.: Automatic composition of melodic and harmonic music by answer set programming. In: [39], pp. 160–174

    Google Scholar 

  7. Ishebabi, H., Mahr, P., Bobda, C., Gebser, M., Schaub, T.: Answer set vs integer linear programming for automatic synthesis of multiprocessor systems from real-time parallel programs. Journal of Reconfigurable Computing (2009)

    Google Scholar 

  8. Erdem, E., Türe, F.: Efficient haplotype inference with answer set programming. In: [40], pp. 436–441

    Google Scholar 

  9. Gebser, M., Schaub, T., Thiele, S., Veber, P.: Detecting inconsistencies in large biological networks with answer set programming. Theory and Practice of Logic Programming 11(2), 1–38 (2011)

    MathSciNet  MATH  Google Scholar 

  10. Grasso, G., Iiritano, S., Leone, N., Lio, V., Ricca, F., Scalise, F.: An ASP-based system for team-building in the gioia-tauro seaport. In: Carro, M., Peña, R. (eds.) PADL 2010. LNCS, vol. 5937, pp. 40–42. Springer, Heidelberg (2010)

    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. Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic 7(3), 499–562 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lin, F., Zhao, Y.: ASSAT: computing answer sets of a logic program by SAT solvers. Artificial Intelligence 157(1-2), 115–137 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  14. Lierler, Y., Maratea, M.: Cmodels-2: SAT-based answer set solver enhanced to non-tight programs. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 346–350. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  15. Biere, A., Heule, M., van Maaren, H., Walsh, T.: Handbook of Satisfiability. Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press, Amsterdam (2009)

    MATH  Google Scholar 

  16. Nau, D., Ghallab, M., Traverso, P.: Automated Planning: Theory and Practice. Morgan Kaufmann Publishers, San Francisco (2004)

    MATH  Google Scholar 

  17. Mellarkod, V., Gelfond, M., Zhang, Y.: Integrating answer set programming and constraint logic programming. Annals of Mathematics and Artificial Intelligence 53(1-4), 251–287 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  18. Gebser, M., Ostrowski, M., Schaub, T.: Constraint answer set solving. In: [41], pp. 235–249

    Google Scholar 

  19. Drescher, C., Walsh, T.: A translational approach to constraint answer set solving. In: Theory and Practice of Logic Programming. Twenty-sixth International Conference on Logic Programming (ICLP 2010) Special Issue, vol. 10(4-6), pp. 465–480. Cambridge University Press, Cambridge (2010)

    Google Scholar 

  20. Cliffe, O., de Vos, M., Brain, M., Padget, J.: ASPVIZ: Declarative visualisation and animation using answer set programming. In: [39], pp. 724–728

    Google Scholar 

  21. de Vos, M., Schaub, T. (eds.): Proceedings of the Workshop on Software Engineering for Answer Set Programming (SEA 2007). Number CSBU-2007-05 in Department of Computer Science, University of Bath, Technical Report Series (2007) ISSN 1740-9497

    Google Scholar 

  22. de Vos, M., Schaub, T. (eds.): Proceedings of the Second Workshop on Software Engineering for Answer Set Programming (SEA 2009). Department of Computer Science, University of Bath, Technical Report Series (2009)

    Google Scholar 

  23. Brain, M., de Vos, M.: Debugging logic programs under the answer set semantics. In: de Vos, M., Provetti, A. (eds.) Proceedings of the Third International Workshop on Answer Set Programming (ASP 2005). CEUR Workshop Proceedings (CEUR-WS.org), vol. 142, pp. 141–152 (2005)

    Google Scholar 

  24. Pontelli, E., Son, T.C.: Justifications for logic programs under answer set semantics. In: Etalle, S., Truszczyński, M. (eds.) ICLP 2006. LNCS, vol. 4079, pp. 196–210. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  25. Brain, M., Gebser, M., Pührer, J., Schaub, T., Tompits, H., Woltran, S.: Debugging ASP programs by means of ASP. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 31–43. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  26. Gebser, M., Pührer, J., Schaub, T., Tompits, H.: A meta-programming technique for debugging answer-set programs. In: [40], pp. 448–453

    Google Scholar 

  27. Faber, W., Leone, N., Mateis, C., Pfeifer, G.: Using database optimization techniques for nonmonotonic reasoning. In: Proceedings of the Seventh International Workshop on Deductive Databases and Logic Programming (DDLP 1999), pp. 135–139 (1999)

    Google Scholar 

  28. Ullman, J.: Principles of Database and Knowledge-Base Systems. Computer Science Press, Rockville (1988)

    Google Scholar 

  29. http://potassco.sourceforge.net/

  30. 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 

  31. Love, N., Hinrichs, T., Haley, D., Schkufza, E., Genesereth, M.: General game playing: Game description language specification. Technical Report LG-2006-01, Stanford University (March 2008)

    Google Scholar 

  32. Giunchiglia, E., Lierler, Y., Maratea, M.: Answer set programming based on propositional satisfiability. Journal of Automated Reasoning 36(4), 345–377 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  33. Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: On the implementation of weight constraint rules in conflict-driven ASP solvers. In: [41], pp. 250–264

    Google Scholar 

  34. Eén, N., Biere, A.: Effective preprocessing in SAT through variable and clause elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 61–75. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  35. Pipatsrisawat, K., Darwiche, A.: A lightweight component caching scheme for satisfiability solvers. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol. 4501, pp. 294–299. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  36. O’Mahony, E., Hebrard, E., Holland, A., Nugent, C., O’Sullivan, B.: Using case-based reasoning in an algorithm portfolio for constraint solving. In: Bridge, D., Brown, K., O’Sullivan, B., Sorensen, H. (eds.) Proceedings of the Nineteenth Irish Conference on Artificial Intelligence and Cognitive Science, AICS 2008 (2008)

    Google Scholar 

  37. Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: SATzilla: Portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research 32, 565–606 (2008)

    MATH  Google Scholar 

  38. Ginsberg, M. (ed.): Readings in Nonmonotonic Reasoning. Morgan Kaufmann, San Francisco (1987)

    Google Scholar 

  39. Garcia de la Banda, M., Pontelli, E. (eds.): ICLP 2008. LNCS, vol. 5366. Springer, Heidelberg (2008)

    MATH  Google Scholar 

  40. Fox, D., Gomes, C. (eds.): Proceedings of the Twenty-third National Conference on Artificial Intelligence (AAAI 2008). AAAI Press, Menlo Park (2008)

    Google Scholar 

  41. Hill, P.M., Warren, D.S. (eds.): ICLP 2009. LNCS, vol. 5649. Springer, Heidelberg (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Martin Gebser, Roland Kaminski, Benjamin Kaufmann & Torsten Schaub

Authors
  1. Martin Gebser
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Roland Kaminski
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Benjamin Kaufmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Torsten Schaub
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Eastman Kodak Company, Rochester, NY, USA

    Marcello Balduccini

  2. Department of Computer Science, New Mexico State University, 88003, Las Cruces, NM, USA

    Tran Cao Son

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T. (2011). Challenges in Answer Set Solving. In: Balduccini, M., Son, T.C. (eds) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. Lecture Notes in Computer Science(), vol 6565. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20832-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20832-4_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20831-7

  • Online ISBN: 978-3-642-20832-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics