Skip to main content
SpringerLink
Log in

Answer Set; Programming?

  • Chapter
Book cover Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning

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

Abstract

Motivated by a discussion maintained by Michael Gelfond and other researchers, this short essay contains some thoughts and refections about the following question: should ASP be considered a programming language?

This work was partially supported by Spanish MEC project TIN2009-14562-C05-04 and Xunta de Galicia project INCITE08-PXIB105159PR.

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. Alviano, M., Faber, W., Leone, N.: Disjunctive ASP with functions: Decidable queries and effective computation. Theory and Practice of Logic Programming 10(4-6), 497–512 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  2. Calimeri, F., Cozza, S., Ianni, G., Leone, N.: Computable Functions in ASP: Theory and Implementation. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol. 5366, pp. 407–424. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  3. Calimeri, F., Cozza, S., Ianni, G., Leone, N.: An ASP System with Functions, Lists, and Sets. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol. 5753, pp. 483–489. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Eiter, T., Gottlob, G.: Complexity results for disjunctive logic programming and application to nonmonotonic logics. In: Proceedings of the International Logic Programming Symposium (ILPS), pp. 266–278. MIT Press, Cambridge (1993)

    Google Scholar 

  5. Ferraris, P., Lee, J., Lifschitz, V.: A new perspective on stable models. In: Proc. of the International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 372–379 (2007)

    Google Scholar 

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

    Google Scholar 

  7. Kowalski, R.: Algorithm = logic + control. Communications of the ACM 22(7), 424–436 (1979)

    Article  MATH  Google Scholar 

  8. Marek, V., Truszczyński, M.: Stable models and an alternative logic programming paradigm, pp. 169–181. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  9. Marek, W., Truszczyński, M.: Autoepistemic logic. Journal of the ACM 38, 588–619 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  10. McCarthy, J.: Elaboration tolerance. In: Proc. of the 4th Symposium on Logical Formalizations of Commonsense Reasoning (Common Sense 1998), pp. 198–217, London, UK (1998), Updated version at http://www-formal.stanford.edu/jmc/elaboration.ps

  11. McCarthy, J., Hayes, P.: Some philosophical problems from the standpoint of artificial intelligence. Machine Intelligence Journal 4, 463–512 (1969)

    MATH  Google Scholar 

  12. McCarthy, J.: Circumscription - a form of non-monotonic reasoning. Artif. Intell. 13(1-2), 27–39 (1980)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  14. Pearce, D., Valverde, A.: Towards a First Order Equilibrium Logic for Nonmonotonic Reasoning. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 147–160. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  15. Tärnlund, S.-A.: Horn clause computability. BIT 16(2), 215–226 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  16. van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. J. ACM 23(4), 733–742 (1976)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. Computación, University of Corunna, Spain

    Pedro Cabalar

Authors
  1. Pedro Cabalar
    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

Cabalar, P. (2011). Answer Set; Programming?. 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_21

Download citation

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

  • 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

Search

Navigation