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ö.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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
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
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
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
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
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
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
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
P. Simons. Extending and implementing the stable model semantics. Research Report 58, Helsinki University of Technology, Helsinki, Finland, 2000. 436
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
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
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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