Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic Programming and Nonmonotonic Reasoning

LPNMR 2001: Logic Programming and Nonmotonic Reasoning pp 434–438Cite as

The Smodels System

  • Conference paper
  • First Online:

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

Abstract

The Smodels system is an Answer Set Programming (ASP) implementation based on the stable model semantics of normal logic programs. The basic idea of ASP is to encode the constraints of a problem as a logic program such that the answer sets (stable models) of the program correspond to the solutions of the problem. Then we can solve the problem by letting a logic program engine to find the answer sets of the program.

This work has been funded by Academy of Finland (project no. 43963). The work of the first author has been supported by HeCSE and Tekniikan edistämissäätiö.

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. C. Aiello and F. Massacci. An executable specification language for planning attacks to security protocols. In Proc. of the IEEE Computer Security Foundations Workshop, pages 88–102, Cambridge, UK, 2000. IEEE Computer Society Press. 437

    Google Scholar 

  2. T. Aura, M. Bishop, and D. Sniegowski. Analyzing single-server network inhibition. In Proc. of the IEEE Computer Security Foundations Workshop, pages 108–117, Cambridge, UK, July 2000. IEEE Computer Society Press. 437

    Google Scholar 

  3. M. Balduccini, M. Barry, M. Gelfond, M. Nogueira, and R. Watson. An A-Prolog decision support system for the space shuttle. In Proc. of the Third International Symposium on Practical Aspects of Declarative Languages. Springer-Verlag, 2001. 436

    Google Scholar 

  4. Y. Dimopoulos, B. Nebel, and J. Koehler. Encoding planning problems in nonmonotonic logic programs. In Proceedings of the Fourth European Conference on Planning, pages 169–181, Toulouse, France, September 1997. Springer-Verlag. 436

    Google Scholar 

  5. K. Heljanko and I. Niemelä. Bounded LTL model checking with stable models. In Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, Vienna, Austria, September 2001. Springer-Verlag. 437

    Google Scholar 

  6. M. Hietalahti, F. Massacci, and I. Niemelá. DES: a challenge problem for nonmonotonic reasoning systems. In Proc. of the 8th International Workshop on Non-Monotonic Reasoning, Breckenridge, Colorado, USA, April 2000. cs.AI/0003039. 437

    Google Scholar 

  7. T. Janhunen, I. Niemelä, P. Simons, and J. You. Unfolding partiality and disjunctions in stable model semantics. In Proceedings of the Seventh International Conference on Principles of Knowledge Representation and Reasoning, pages 411–419, Breckenridge, Colorado, USA, April 2000. Morgan Kaufmann Publishers. 437

    Google Scholar 

  8. I. Niemelä and P. Simons. Extending the Smodels system with cardinality and weight constraints. In Jack Minker, editor, Logic-Based Artificial Intelligence, chapter 21, pages 491–521. Kluwer Academic Publishers, 2000. 435

    Google Scholar 

  9. P. Simons. Extending and implementing the stable model semantics. Research Report 58, Helsinki University of Technology, Helsinki, Finland, 2000. 436

    Google Scholar 

  10. T. C. Son, C. Baral, and S. McIlraith. Extending answer set planning with sequence, conditional, loop, non-deterministic choice, and procedure constructs. In Proceedings of the AAAI Spring 2001 Symposium on Answer Set Programming, pages 202–209, Stanford, USA, March 2001. AAAI Press. 436

    Google Scholar 

  11. T. Syrjánen. Omega-restricted logic programs. In Proc. of the 6th Intl. Conference on Logic Programming and Nonmonotonic Reasoning. Springer-Verlag, 2001. 435, 436

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science and Eng., Laboratory for Theoretical Computer Science, Helsinki University of Technology, P.O.Box 5400, FIN-02015 HUT, Finland

    Tommi Syrjänen & Ilkka Niemelä

Authors
  1. Tommi Syrjänen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ilkka Niemelä
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informationssysteme, Vienna University of Technology, 1040, Wien, Austria

    Thomas Eiter

  2. Institut für Informationssysteme, Vienna University of Technology, 1040, Wien, Austria

    Wolfgang Faber

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

    Miros law Truszczyński

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Syrjänen, T., Niemelä, I. (2001). The Smodels System. In: Eiter, T., Faber, W., Truszczyński, M.l. (eds) Logic Programming and Nonmotonic Reasoning. LPNMR 2001. Lecture Notes in Computer Science(), vol 2173. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45402-0_38

Download citation

  • DOI: https://doi.org/10.1007/3-540-45402-0_38

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42593-9

  • Online ISBN: 978-3-540-45402-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation