{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T22:41:03Z","timestamp":1708209663621},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,7,1]],"date-time":"2007-07-01T00:00:00Z","timestamp":1183248000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comput Sci Technol"],"published-print":{"date-parts":[[2007,7]]},"DOI":"10.1007\/s11390-007-9078-7","type":"journal-article","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T01:24:26Z","timestamp":1189733066000},"page":"562-568","source":"Crossref","is-referenced-by-count":2,"title":["Comparison of Semantics of Disjunctive Logic Programs Based on Model-Equivalent Reduction"],"prefix":"10.1007","volume":"22","author":[{"given":"Xi-Shun","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Yu-Ping","family":"Shen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,13]]},"reference":[{"key":"9078_CR1","unstructured":"Gogic G, Kautz H, Papadimitriou C, Selman B. The comparative linguistics of knowledge representation. In Proc. Int. Joint Conf. Artificial Intelligence (IJCAI\u201995), Montreal, Canada, 1995, pp.862\u2013869."},{"key":"9078_CR2","doi-asserted-by":"crossref","unstructured":"Janhunen T, Oikarinen E. Capturing parallel circumscription with disjunctive logic programs. In Proc. Logics in Artificial Intelligence (JELIA\u201904), Lisbon, Portugal, 2004, pp.134\u2013146.","DOI":"10.1007\/978-3-540-30227-8_14"},{"key":"9078_CR3","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/11499107_26","volume":"3569","author":"Xishun Zhao","year":"2005","unstructured":"Xishun Zhao, H Kleine B\u00fcning. Model-equivalent reductions. Lecture Notes in Computer Science, Springer, 2005, 3569: 355\u2013370.","journal-title":"Lecture Notes in Computer Science, Springer"},{"issue":"3","key":"9078_CR4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/S0747-7171(86)80028-1","volume":"2","author":"D Plaisted","year":"1986","unstructured":"Plaisted D, Greenbaum S. A structure preserving clause form transformation. Journal of Symbolic Computation, 1986, 2(3): 293\u2013304.","journal-title":"Journal of Symbolic Computation"},{"issue":"1","key":"9078_CR5","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(89)90068-4","volume":"38","author":"M Gelfond","year":"1989","unstructured":"Gelfond M, Przymusinska H, Ptzymusinki T. On the relationship between circumscription and negation as failure. Artificial Intelligence, 1989, 38(1): 75\u201394.","journal-title":"Artificial Intelligence"},{"key":"9078_CR6","doi-asserted-by":"crossref","unstructured":"Lifschitz V. Circumscription. Handbook of Logic in AI and Logic Programming, Oxford University Press, 1994, 3: 298\u2013352.","DOI":"10.1093\/oso\/9780198537472.003.0006"},{"key":"9078_CR7","doi-asserted-by":"crossref","unstructured":"Przymusinski T. On the Declarative and Procedural Semantics of Stratified Deductive Databases. Foundation of Deductive Databases and Logic Programming, Morgan Kaufman, 1988, pp.193\u2013216.","DOI":"10.1016\/B978-0-934613-40-8.50009-9"},{"issue":"3\/4","key":"9078_CR8","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF03037171","volume":"9","author":"T Przymusinski","year":"1991","unstructured":"Przymusinski T. Stable models for disjunctive programs. New Generation Computing, 1991, 9(3\/4): 401\u2013424.","journal-title":"New Generation Computing"},{"key":"9078_CR9","unstructured":"Gelfond M, Lifschitz V. The stable model semantics for logic programming. In Proc. the 5th Int. Conf. Logic Programming, Seattle, USA, The MIT Press, 1988, pp.1070\u20131080."},{"issue":"3\/4","key":"9078_CR10","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond M, Lifschitz V. Classical negation in logic programs and disjunctive database. New Generation Computing, 1991, 9(3\/4): 365\u2013386.","journal-title":"New Generation Computing"},{"key":"9078_CR11","unstructured":"Ferraris P, Lee J, Lifschitz V. A new perspective on stable models. In Proc. Int. Joint Conf. Artificial Intelligence (IJCAI\u201907), Hyderabad, India, 2007, pp.372\u2013379."},{"key":"9078_CR12","doi-asserted-by":"crossref","unstructured":"Ferraris P, Lee J, Lifschitz V. A generalization of the Lin-Zhao theorem. Annals of Mathematics and Artificial Intelligence, to appear.","DOI":"10.1007\/s10472-006-9025-2"},{"key":"9078_CR13","unstructured":"Lin F, Zhou Y. From answer set programming to circumscription via logic of GK. In Proc. International Joint Conference on Artificial Intelligence (IJCAI\u201907), Hyderabad, India, 2007, pp.441\u2013446."},{"key":"9078_CR14","unstructured":"Lin F. A study of nonmonotonic reasoning [Dissertation]. Stanford University, 1991."},{"issue":"3","key":"9078_CR15","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1093\/logcom\/2.3.397","volume":"2","author":"G Gottlob","year":"1992","unstructured":"Gottlob G. The complexity results for non-monotonic logics. J. Logic and Computation, 1992, 2(3): 397\u2013425.","journal-title":"J. Logic and Computation"},{"issue":"1\/2","key":"9078_CR16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/BF01530761","volume":"12","author":"R Ben-Eliyahu","year":"1994","unstructured":"Ben-Eliyahu R, Dechter R. Propositional semantics for disjunctive logic programs. Annals of Mathematics and Artificial Intelligence, 1994, 12(1\/2): 53\u201387.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3\/4","key":"9078_CR17","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/BF01536399","volume":"15","author":"T Eiter","year":"1995","unstructured":"Eiter T, Gottlob G. On the computational cost of disjunctive logic programming: Propositional case. Annals of Mathematics and Artificial Intelligence, 1995, 15(3\/4): 289\u2013323.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"9078_CR18","unstructured":"Egly U, Eiter T, Tompits H, Woltran S. Solving advanced reasoning tasks using quantified Boolean formulas. In Proc. National Conference on Artificial Intelligence (AAAI\u20192000), Austin, USA, 2000, pp.417\u2013422."},{"issue":"1","key":"9078_CR19","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0004-3702(87)90064-6","volume":"32","author":"T Imielinski","year":"1987","unstructured":"Imielinski T. Results on translating defaults to circumscription. Artificial Intelligence, 1987, 32(1): 131\u2013146.","journal-title":"Artificial Intelligence"},{"issue":"1\u20134","key":"9078_CR20","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1023\/A:1018915113814","volume":"27","author":"T Janhunen","year":"1999","unstructured":"Janhunen T. On the intertranslatability of non-monotonic logics. Annals of Mathematics and Artificial Intelligence, 1999, 27(1\u20134): 79\u2013128.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"1","key":"9078_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1119439.1119440","volume":"7","author":"T Janhunen","year":"2006","unstructured":"Janhunen T, Niemela I, Seipel D et al. Unfolding partiality and disjunctions in stable model semantics. ACM Trans. Computational Logic, 2006, 7(1): 1\u201337.","journal-title":"ACM Trans. Computational Logic"},{"issue":"1\/2","key":"9078_CR22","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.artint.2004.04.004","volume":"157","author":"F Lin","year":"2004","unstructured":"Lin F, Zhao Y. ASSAT: Computing answer sets of a logic program by SAT solvers. Artificial Intelligence, 2004, 157(1\/2): 115\u2013137.","journal-title":"Artificial Intelligence"},{"key":"9078_CR23","first-page":"306","volume":"2258","author":"D Pearce","year":"2001","unstructured":"Pearce D, Tompits H, Woltran S. Encodings for equilibrium logic and logic programs with nested expressions. Lecture Notes in Artificial Intelligence, 2001, 2258: 306\u2013320.","journal-title":"Lecture Notes in Artificial Intelligence"},{"issue":"3","key":"9078_CR24","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N Leone","year":"2006","unstructured":"Leone N, Pfeifer G, Faber W et al. The DLV system for knowledge representation and reasoning. ACM Trans. Computational Logic, 2006, 7(3): 499\u2013562.","journal-title":"ACM Trans. Computational Logic"},{"issue":"1\/2","key":"9078_CR25","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"13","author":"J McCarthy","year":"1986","unstructured":"McCarthy J. Circumscription \u2014 A form of non-monotonic reasoning. Artificial Intelligence, 1986, 13(1\/2): 89\u2013116.","journal-title":"Artificial Intelligence"},{"key":"9078_CR26","unstructured":"H Kleine B\u00fcning, T Lettmann. Propositional Logic: Deduction and Algorithms. Cambridge University Press, 1999."},{"key":"9078_CR27","doi-asserted-by":"crossref","unstructured":"Tseitin G S. On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic, Part II, Silenko A O (ed.), 1970, pp.115\u2013125.","DOI":"10.1007\/978-1-4899-5327-8_25"},{"issue":"2\/3","key":"9078_CR28","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0004-3702(92)90019-T","volume":"57","author":"F Lin","year":"1992","unstructured":"Lin F, Shoham Y. A logic of knowledge of justified assumptions. Artificial Intelligence, 1992, 57(2\/3): 271\u2013289.","journal-title":"Artificial Intelligence"},{"issue":"1\/2","key":"9078_CR29","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0304-3975(97)00129-1","volume":"206","author":"T Eiter","year":"1998","unstructured":"Eiter T, Leone N, Sacc\u00e0 D. Expressive power and complexity of partial models for disjunctive databases. Theoretical Computer Science, 1998, 206(1\/2): 181\u2013218.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"9078_CR30","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/0743-1066(94)00023-Y","volume":"22","author":"Jia-Huai You","year":"1995","unstructured":"Jia-Huai You, Li-Yan Yuan. On the equivalence semantics for normal logic programs. J. Logic Programming, 1995, 22(3): 211\u2013222.","journal-title":"J. Logic Programming"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9078-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-007-9078-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9078-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T22:04:34Z","timestamp":1708207474000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-007-9078-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,7]]}},"alternative-id":["9078"],"URL":"https:\/\/doi.org\/10.1007\/s11390-007-9078-7","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7]]}}}