{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:46:05Z","timestamp":1742913965664,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540437246"},{"type":"electronic","value":"9783540479222"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47922-8_11","type":"book-chapter","created":{"date-parts":[[2007,5,21]],"date-time":"2007-05-21T07:27:28Z","timestamp":1179732448000},"page":"119-131","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Two-Literal Logic Programs and Satisfiability Representation of Stable Models: A Comparison"],"prefix":"10.1007","author":[{"given":"Guan-Shieng","family":"Huang","sequence":"first","affiliation":[]},{"given":"Xiumei","family":"Jia","sequence":"additional","affiliation":[]},{"given":"Churn-Jung","family":"Liau","sequence":"additional","affiliation":[]},{"given":"Jia-Huai","family":"You","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,28]]},"reference":[{"key":"11_CR1","unstructured":"Y. Babovich, E. Erdem, and V. Lifschitz. Fage\u2019s theorem and answer set programming. In Proc. Int\u2019l Workshop on Non-Monotonic Reasoning, 2000."},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01530761","volume":"14","author":"R. Ben-Eliyahu","year":"1994","unstructured":"R. Ben-Eliyahu and R. Dechter. Propositional semantics for disjunctive logic programs. Annals of Math. and Artificial Intelligence, 14:53\u201387, 1994.","journal-title":"Annals of Math. and Artificial Intelligence"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"K. L. Clark. Negation as failure. Logics and Databases, pages 293\u2013322, 1978.","DOI":"10.1007\/978-1-4684-3384-5_11"},{"issue":"7","key":"11_CR4","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5(7):394\u2013397, July 1962.","journal-title":"Communications of the ACM"},{"key":"11_CR5","unstructured":"P. Dung. A fixpoint approach to declarative semantics of logic programs. In Proc. North American Conf. on Logic Programming, pages 604\u2013625, 1989."},{"key":"11_CR6","unstructured":"M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proc. 5th ICLP, pages 1070\u20131080. MIT Press, 1988."},{"key":"11_CR7","unstructured":"T. Janhunen, I. Niemel\u00e4, P. Simons, and J. You. Unfolding partiality and disjunctions in stable model semantics. In Proc. KR 2000, pages 411\u2013424. Morgan Kaufmann, April 2000."},{"key":"11_CR8","unstructured":"N. Leone et al. DLV: a disjunctive datalog system, release 2000-10-15. At \n                    \n                      http:\/\/www.dbai.tuwien.ac.at\/proj\/dlv\/\n                    \n                    \n                  , 2000."},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"V. Lifschitz. Answer set programming. In K. R. Apt et al., editor, The Logic Programming Paradigm: A 25-Year Perspective, pages 357\u2013371. Springer, 1999.","DOI":"10.1007\/978-3-642-60085-2_16"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"V. Marek and M. Truszczy\u0144ski. Stable models and an alternative logic programming paradigm. In K. R. Apt et al., editor, The Logic Programming Paradigm: A 25-Year Perspective, pages 375\u2013398. Springer, 1999.","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"M. Moskecicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Enginerring an efficient sat solver. In Proc. 38th ACM Design Automation Conference, pages 530\u2013535, June 2000.","DOI":"10.1145\/378239.379017"},{"issue":"3\u20134","key":"11_CR12","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"I. Niemel\u00e4. Logic programs with stable model semantics as a constraint programming paradigm. Annals of Math. and Artificial Intelligence, 25(3\u20134):241\u2013273, 1999.","journal-title":"Annals of Math. and Artificial Intelligence"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"I. Niemel\u00e4 and P. Simons. Extending the Smodels system with cardinality and weight constraints, pages 491\u2013521. Kluwer Academic Publishers, 2000.","DOI":"10.1007\/978-1-4615-1567-8_21"},{"key":"11_CR14","unstructured":"C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994."},{"key":"11_CR15","series-title":"PhD thesis","volume-title":"Extending and Implementing the Stable Model Semantics","author":"P. Simons","year":"2000","unstructured":"P. Simons. Extending and Implementing the Stable Model Semantics. PhD thesis, Helsinki University of Technology, Helsinki, Finland, 2000."},{"key":"11_CR16","unstructured":"M. Truszczy\u0144ski. Computing large and small stable models. In Proc. ICLP, pages 169\u2013183. MIT Press, 1999."},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0304-3975(96)80712-2","volume":"170","author":"J. You","year":"1996","unstructured":"J. You, R. Cartwright, and M. Li. Iterative belief revision in extended logic programs. Theoretical Computer Science, 170:383\u2013406, 1996.","journal-title":"Theoretical Computer Science"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"H. Zhang. Sato: an efficient propositional prover. In Proc. CADE, pages 272\u2013275, 1997.","DOI":"10.1007\/3-540-63104-6_28"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47922-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:32:48Z","timestamp":1558258368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47922-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540437246","9783540479222"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-47922-8_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"28 May 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}