Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming

ICLP 2008: Logic Programming pp 83–87Cite as

Quo Vadis Answer Set Programming?

Past, Present, and Future

  • Conference paper

  • 1143 Accesses

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

Abstract

We discuss the development, current state and the future of Answer Set Programming, making predictions that are not necessarily accurate.

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. Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)

    Book  MATH  Google Scholar 

  2. Gelfond, M.: On stratified autoepistemic theories. In: Proceedings of AAAI 1987, pp. 207–211 (1987)

    Google Scholar 

  3. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the International Joint Conference and Symposium on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  4. Gelfond, M., Leone, N.: Logic Programming and Knowledge Representation – A-Prolog perspective. Artificial Intelligence 138, 3–38 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Lifschitz, V.: Twelve Definitions of a Stable model. This volume

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  8. Lin, F., Zhao, Y.: ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence Journal 157, 115–137 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Lonc, Z., Truszczyński, M.: Computing minimal models, stable models and answer sets. Theory and Practice of Logic Programming 6, 395–449 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  10. Marek, V.W., Truszczyński, M.: Nonmonotonic Logic, Context-Dependent Reasoning. Springer, Berlin (1993)

    MATH  Google Scholar 

  11. Marek, V., Truszczyński, M.: Stable Models and an Alternative Logic Programming Paradigm. In: The Logic Programming Paradigm. Series Artificial Intelligence, pp. 375–398. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

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

  13. Niemelä, I., Simons, P., Soininen, T.: Stable Model Semantics of Weight Constraint Rules. In: Gelfond, M., Leone, N., Pfeifer, G. (eds.) LPNMR 1999. LNCS, vol. 1730, pp. 317–331. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  14. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Abstract DPLL and Abstract DPLL Modulo Theories. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS, vol. 3452, pp. 36–50. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  15. Tang, C., Ternovska, E.: Model Checking Abstract State Machines with Answer Set Programming. Fundamenta Informaticae 77, 105–141 (2007)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Kentucky, Lexington, KY 40506-0046, USA

    V. W. Marek

Authors
  1. V. W. Marek
    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

Marek, V.W. (2008). Quo Vadis 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_14

Download citation

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

  • 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