Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming

ICLP 2008: Logic Programming pp 93–98Cite as

Here’s the Beef: Answer Set Programming !

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5366))

Abstract

At the occasion of the Third International Conference on Principles of Knowledge Representation and Reasoning [1] in 1992, Ray Reiter delivered an invited talk entitled “Twelve Years of Nonmonotonic Reasoning Research: Where (and What) Is the beef?”, reflecting the state and future of the research area of Nonmonotonic Reasoning (NMR;[2]).Ray Reiter describes it in [3] as a “flourishing subculture” making many outside researchers “wonder what on earth this stuff is good for.” Although he seemed to be rather optimistic about the future of NMR, he nonetheless saw its major contribution on the theoretical side, providing “important insights about, and solutions to, many outstanding problems, not only in AI but in computer science in general.” Among them, he lists “Logic Programming implementations of nonmonotonic reasoning”

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Nebel, B., Rich, C., Swartout, W. (eds.): Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning (KR 1992). Morgan Kaufmann, San Francisco (1992)

    Google Scholar 

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

    Google Scholar 

  3. Reiter, R.: Twelve years of nonmonotonic reasoning research: Where (and what) is the beef? In: [1], p. 789

    Google Scholar 

  4. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Proceedings of the Fifth International Conference and Symposium of Logic Programming (ICLP 1988), pp. 1070–1080. The MIT Press, Cambridge (1988)

    Google Scholar 

  5. Reiter, R.: A logic for default reasoning. Artificial Intelligence 13(1-2), 81–132 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  6. Marek, V., Truszczyński, M.: Stable semantics for logic programs and default theories. In: Lusk, E., Overbeek, R. (eds.) Proceedings of the North American Conference on Logic Programing, pp. 243–256. The MIT Press, Cambridge (1989)

    Google Scholar 

  7. Bidoit, N., Froidevaux, C.: General logical databases and programs: Default logic semantics and stratification. Information and Computation 91(1), 15–54 (1991)

    Article  MathSciNet  MATH  Google Scholar 

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

  9. http://www.tcs.hut.fi/Software/smodels

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

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

  12. Lifschitz, V.: Answer set programming and plan generation. Artificial Intelligence 138(1-2), 39–54 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  13. Gelfond, M., Leone, N.: Logic programming and knowledge representation — the A-Prolog perspective. Artificial Intelligence 138(1-2), 3–38 (2002)

    Article  MathSciNet  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  15. Tran, N., Baral, C.: Reasoning about triggered actions in AnsProlog and its application to molecular interactions in cells. In: Dubois, D., Welty, C., Williams, M. (eds.) Proceedings of the Ninth International Conference on Principles of Knowledge Representation and Reasoning (KR 2004), pp. 554–564. AAAI Press, Menlo Park (2004)

    Google Scholar 

  16. Dworschak, S., Grell, S., Nikiforova, V., Schaub, T., Selbig, J.: Modeling biological networks by action languages via answer set programming. Constraints 13(1-2), 21–65 (2008)

    Article  MathSciNet  MATH  Google Scholar 

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

  18. Leone, N., Greco, G., Ianni, G., Lio, V., Terracina, G., Eiter, T., Faber, W., Fink, M., Gottlob, G., Rosati, R., Lembo, D., Lenzerini, M., Ruzzi, M., Kalka, E., Nowicki, B., Staniszkis, W.: The INFOMIX system for advanced integration of incomplete and inconsistent data. In: Özcan, F. (ed.) Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD 2005), pp. 915–917. ACM Press, New York (2005)

    Chapter  Google Scholar 

  19. Eiter, T., Faber, W., Leone, N., Pfeifer, G.: The diagnosis frontend of the dlv system. AI Communications 12(1-2), 99–111 (1999)

    MathSciNet  Google Scholar 

  20. Erdem, E., Wong, M.: Rectilinear Steiner tree construction using answer set programming. In: [59], pp. 386–399

    Google Scholar 

  21. Beierle, C., Dusso, O., Kern-Isberner, G.: Using answer set programming for a decision support system. In: Baral, C., Greco, G., Leone, N., Terracina, G. (eds.) LPNMR 2005. LNCS, vol. 3662, pp. 374–378. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  22. Heljanko, K., Niemelä, I.: Bounded LTL model checking with stable models. Theory and Practice of Logic Programming 3(4-5), 519–550 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  23. Kavanagh, J., Mitchell, D., Ternovska, E., Manuch, J., Zhao, X., Gupta, A.: Constructing Camin-Sokal phylogenies via answer set programming. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS, vol. 4246, pp. 452–466. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  24. Brooks, D., Erdem, E., Erdogan, S., Minett, J., Ringe, D.: Inferring phylogenetic trees using answer set programming. Journal of Automated Reasoning 39(4), 471–511 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  25. Aiello, L., Massacci, F.: Verifying security protocols as planning in logic programming. ACM Transactions on Computational Logic 2(4), 542–580 (2001)

    Article  MathSciNet  Google Scholar 

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

  27. Balduccini, M., Gelfond, M.: Model-based reasoning for complex flight systems. In: Proceedings of the Fifth AIAA Conference on Aviation, Technology, Integration, and Operations (ATIO 2005) (2005)

    Google Scholar 

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

  29. 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  Google Scholar 

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

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

  32. Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set solving. In: Veloso, M. (ed.) Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 386–392. AAAI Press/The MIT Press (2007)

    Google Scholar 

  33. Brachman, R., Schmolze, J.: An overview of the kl-one knowledge representation system. Cognitive Science 9(2), 189–192 (1985)

    Article  Google Scholar 

  34. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7, 201–215 (1960)

    Article  MathSciNet  MATH  Google Scholar 

  35. Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM 5, 394–397 (1962)

    Article  MathSciNet  MATH  Google Scholar 

  36. Clarke, E., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Formal Methods in System Design 19(1), 7–34 (2001)

    Article  MATH  Google Scholar 

  37. Baader, F., Horrocks, I., Sattler, U.: Description logics as ontology languages for the semantic web. In: Hutter, D., Stephan, W. (eds.) Mechanizing Mathematical Reasoning, pp. 228–248. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  38. Gomes, C., Kautz, H., Sabharwal, A., Selman, B.: Satisfiability solvers. In: Lifschitz, V., van Hermelen, F., Porter, B. (eds.) Handbook of Knowledge Representation. Elsevier, Amsterdam (2008)

    Google Scholar 

  39. Syrjänen, T.: Omega-restricted logic programs. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS, vol. 2173, pp. 267–279. Springer, Heidelberg (2001)

    Google Scholar 

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

    Chapter  Google Scholar 

  41. Leone, N., Perri, S., Scarcello, F.: Backjumping techniques for rules instantiation in the DLV system. In: Delgrande, J., Schaub, T. (eds.) Proceedings of the Tenth International Workshop on Nonmonotonic Reasoning (NMR 2004), pp. 258–266 (2004)

    Google Scholar 

  42. Gebser, M., Schaub, T., Thiele, S.: GrinGo: A new grounder for answer set programming. In: [60], pp. 266–271

    Google Scholar 

  43. Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic 2(4), 526–541 (2001)

    Article  MathSciNet  Google Scholar 

  44. Turner, H.: Strong equivalence made easy: nested expressions and weight constraints. Theory and Practice of Logic Programming 3(4-5), 609–622 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  45. 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)

    Chapter  Google Scholar 

  46. Eiter, T., Fink, M., Tompits, H., Woltran, S.: Simplifying logic programs under uniform and strong equivalence. In: Lifschitz, V., Niemelä, I. (eds.) LPNMR 2004. LNCS, vol. 2923, pp. 87–99. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  47. Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: Brewka, G., Coradeschi, S., Perini, A., Traverso, P. (eds.) Proceedings of the Seventeenth European Conference on Artificial Intelligence (ECAI 2006), pp. 412–416. IOS Press, Amsterdam (2006)

    Google Scholar 

  48. 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), pp. 141–152 (2005)

    Google Scholar 

  49. Syrjänen, T.: Debugging inconsistent answer set programs. In: Dix, J., Hunter, A. (eds.) Proceedings of the Eleventh International Workshop on Nonmonotonic Reasoning (NMR 2006), Clausthal University of Technology, Institute for Informatics, pp. 77–83 (2006)

    Google Scholar 

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

    Chapter  Google Scholar 

  51. Brain, M., Gebser, M., Pührer, J., Schaub, T., Tompits, H., Woltran, S.: Debugging ASP programs by means of ASP. In: [60], pp. 31–43

    Google Scholar 

  52. Kautz, H., Selman, B.: Planning as satisfiability. In: Neumann, B. (ed.) Proceedings of the Tenth European Conference on Artificial Intelligence (ECAI 1992), pp. 359–363. Wiley, Chichester (1992)

    Google Scholar 

  53. Eén, N., Sörensson, N.: Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Computer Science 89(4) (2003)

    Google Scholar 

  54. Claessen, K., Sörensson, N.: New techniques that improve MACE-style finite model finding. In: Baumgartner, P., Fermüller, C. (eds.) Proceedings of the Workshop on Model Computation — Principles, Algorithms, Applications (2003)

    Google Scholar 

  55. Gebser, M., Kaminski, R., Kaufmann, B., Ostrowski, M., Schaub, T., Thiele, S.: Engineering an incremental ASP solver. In: Dovier, A., Garcia de la Banda, M., Pontelli, E. (eds.) Proceedings of the Twenty-fourth International Conference on Logic Programming (ICLP 2008) (to appear, 2008)

    Google Scholar 

  56. Elkabani, I., Pontelli, E., Son, T.: Smodels with CLP and its applications: A simple and effective approach to aggregates in ASP. In: [59], pp. 73–89

    Google Scholar 

  57. Baselice, S., Bonatti, P., Gelfond, M.: Towards an integration of answer set and constraint solving. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol. 3668, pp. 52–66. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  58. Mellarkod, V., Gelfond, M.: Integrating answer set reasoning with constraint solving techniques. In: Garrigue, J., Hermenegildo, M. (eds.) Proceedings of the Ninth International Symposium of Functional and Logic Programming, pp. 15–31. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  59. Demoen, B., Lifschitz, V. (eds.): ICLP 2004. LNCS, vol. 3132. Springer, Heidelberg (2004)

    MATH  Google Scholar 

  60. Baral, C., Brewka, G., Schlipf, J. (eds.): LPNMR 2007. LNCS, vol. 4483. Springer, Heidelberg (2007)

    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, Germany

    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. Clayton School of Information Technology, Monash University, Australia

    Maria Garcia de la Banda

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

    Enrico Pontelli

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schaub, T. (2008). Here’s the Beef: Answer Set Programming !. In: Garcia de la Banda, M., Pontelli, E. (eds) Logic Programming. ICLP 2008. Lecture Notes in Computer Science, vol 5366. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89982-2_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89982-2_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89981-5

  • Online ISBN: 978-3-540-89982-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation