{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T11:28:36Z","timestamp":1768562916205,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540425939","type":"print"},{"value":"9783540454021","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45402-0_38","type":"book-chapter","created":{"date-parts":[[2010,11,19]],"date-time":"2010-11-19T22:10:11Z","timestamp":1290204611000},"page":"434-438","source":"Crossref","is-referenced-by-count":29,"title":["The Smodels System"],"prefix":"10.1007","author":[{"given":"Tommi","family":"Syrj\u00e4nen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilkka","family":"Niemel\u00e4","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,7,17]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"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\u2013102, Cambridge, UK, 2000. IEEE Computer Society Press. 437","DOI":"10.1109\/CSFW.2000.856928"},{"key":"38_CR2","doi-asserted-by":"crossref","unstructured":"T. Aura, M. Bishop, and D. Sniegowski. Analyzing single-server network inhibition. In Proc. of the IEEE Computer Security Foundations Workshop, pages 108\u2013117, Cambridge, UK, July 2000. IEEE Computer Society Press. 437","DOI":"10.1109\/CSFW.2000.856930"},{"key":"38_CR3","unstructured":"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"},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"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\u2013181, Toulouse, France, September 1997. Springer-Verlag. 436","DOI":"10.1007\/3-540-63912-8_84"},{"key":"38_CR5","doi-asserted-by":"crossref","unstructured":"K. Heljanko and I. Niemel\u00e4. 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","DOI":"10.1007\/3-540-45402-0_15"},{"key":"38_CR6","unstructured":"M. Hietalahti, F. Massacci, and I. Niemel\u00e1. 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"},{"key":"38_CR7","unstructured":"T. Janhunen, I. Niemel\u00e4, 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\u2013419, Breckenridge, Colorado, USA, April 2000. Morgan Kaufmann Publishers. 437"},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"I. Niemel\u00e4 and P. Simons. Extending the Smodels system with cardinality and weight constraints. In Jack Minker, editor, Logic-Based Artificial Intelligence, chapter 21, pages 491\u2013521. Kluwer Academic Publishers, 2000. 435","DOI":"10.1007\/978-1-4615-1567-8_21"},{"key":"38_CR9","series-title":"Research Report","volume-title":"Extending and implementing the stable model semantics","author":"P. Simons","year":"2000","unstructured":"P. Simons. Extending and implementing the stable model semantics. Research Report 58, Helsinki University of Technology, Helsinki, Finland, 2000. 436"},{"key":"38_CR10","unstructured":"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\u2013209, Stanford, USA, March 2001. AAAI Press. 436"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"T. Syrj\u00e1nen. Omega-restricted logic programs. In Proc. of the 6th Intl. Conference on Logic Programming and Nonmonotonic Reasoning. Springer-Verlag, 2001. 435, 436","DOI":"10.1007\/3-540-45402-0_20"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45402-0_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T08:16:20Z","timestamp":1551082580000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45402-0_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425939","9783540454021"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45402-0_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}