{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:27:22Z","timestamp":1725575242784},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207214"},{"type":"electronic","value":"9783540246091"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24609-1_17","type":"book-chapter","created":{"date-parts":[[2011,1,13]],"date-time":"2011-01-13T22:31:31Z","timestamp":1294957891000},"page":"180-193","source":"Crossref","is-referenced-by-count":8,"title":["Verifying the Equivalence of Logic Programs in the Disjunctive Case"],"prefix":"10.1007","author":[{"given":"Emilia","family":"Oikarinen","sequence":"first","affiliation":[]},{"given":"Tomi","family":"Janhunen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Artificial Intelligence","first-page":"439","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Balduccini","year":"2001","unstructured":"Balduccini, M., Gelfond, M., Watson, R., Nogueira, M.: The USA-advisor: A case study in answer set planning. In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.\u00a02173, pp. 439\u2013442. Springer, Heidelberg (2001)"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-540-24599-5_16","volume-title":"Logic Programming","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., Fink, M.: Uniform equivalence of logic programs under the stable model semantics. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 224\u2013238. Springer, Heidelberg (2003) (to appear)"},{"key":"17_CR3","first-page":"289","volume":"15","author":"T. Eiter","year":"1995","unstructured":"Eiter, T., Gottlob, G.: On the computational cost of disjunctive logic programming: Propositional case. Annals of Math. and AI\u00a015, 289\u2013323 (1995)","journal-title":"Annals of Math. and AI"},{"key":"17_CR4","unstructured":"Ferraris, P., Lifschitz, V.: Weight constraints as nested expressions (2003) (unpublished draft), Available at \n                    \n                      http:\/\/www.cs.utexas.edu\/users\/vl\/papers.html"},{"key":"17_CR5","first-page":"1070","volume-title":"Proc. of the 5th International Conference on Logic Programming","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proc. of the 5th International Conference on Logic Programming, Seattle, USA, August 1988, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"17_CR6","first-page":"579","volume-title":"Proc. of the 7th International Conference on Logic Programming","author":"M. Gelfond","year":"1990","unstructured":"Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: Proc. of the 7th International Conference on Logic Programming, Jerusalem, Israel, June 1990, pp. 579\u2013597. MIT Press, Cambridge (1990)"},{"key":"17_CR7","doi-asserted-by":"publisher","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 databases. New Generation Computing\u00a09, 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"key":"17_CR8","unstructured":"Gent, I., Walsh, T.: Beyond NP: the QSAT phase transition. In: Proc. of the 16th National Conference on Artificial Intelligence and the 11th Conference on Innovative Applications of Artificial Intelligence, Orlando, Florida, USA, July 1999, pp. 648\u2013653. AAAI\/MIT Press (1999)"},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0743-1066(97)10001-2","volume":"35","author":"K. Inoue","year":"1998","unstructured":"Inoue, K., Sakama, C.: Negation as failure in the head. Journal of Logic Programming\u00a035(1), 39\u201378 (1998)","journal-title":"Journal of Logic Programming"},{"key":"17_CR10","first-page":"93","volume-title":"Logic Programming and Nonmonotonic Reasoning, Proc. of the 6th International Conference","author":"T. Janhunen","year":"2001","unstructured":"Janhunen, T.: On the effect of default negation on the expressiveness of disjunctive rules. In: Logic Programming and Nonmonotonic Reasoning, Proc. of the 6th International Conference, Vienna, Austria, September 2001, pp. 93\u2013106. Springer, Heidelberg (2001)"},{"key":"17_CR11","unstructured":"Janhunen, T.: LPEQ 1.13 \u2013 a tool for testing the equivalence of logic programs. Computer Program (2002), \n                    \n                      http:\/\/www.tcs.hut.fi\/Software\/lpeq\/"},{"key":"17_CR12","unstructured":"Janhunen, T.: GnT 2 \u2013 a tool for computing disjunctive stable models. Computer Program (2003), \n                    \n                      http:\/\/www.tcs.hut.fi\/Software\/gnt\/"},{"key":"17_CR13","unstructured":"Janhunen, T., Niemel\u00e4, I., Seipel, D., Simons, P., You, J.-H.: Unfolding partiality and disjunctions in stable model semantics. CoRR: cs.AI\/0303009 (March 2003)"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/3-540-45757-7_41","volume-title":"Logics in Artificial Intelligence, Proc. of the 8th European Conference","author":"T. Janhunen","year":"2002","unstructured":"Janhunen, T., Oikarinen, E.: Testing the equivalence of logic programs under stable model semantics. In: Logics in Artificial Intelligence, Proc. of the 8th European Conference, Cosenza, Italy, September 2002, pp. 493\u2013504. Springer, Heidelberg (2002)"},{"key":"17_CR15","unstructured":"Leone, N., et al.: The DLV system for knowledge representation and reasoning. CoRR: cs.AI\/0211004 (September 2003)"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V. Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic\u00a02, 526\u2013541 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"3-4","key":"17_CR17","first-page":"369","volume":"25","author":"V. Lifschitz","year":"1999","unstructured":"Lifschitz, V., Tang, L.R., Turner, H.: Nested expressions in logic programs. Annals of Math. and AI\u00a025(3-4), 369\u2013389 (1999)","journal-title":"Annals of Math. and AI"},{"key":"17_CR18","first-page":"170","volume-title":"Principles of Knowledge Representation and Reasoning: Proc. of the 8th International Conference","author":"F. Lin","year":"2002","unstructured":"Lin, F.: Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: Fensel, D., et al. (eds.) Principles of Knowledge Representation and Reasoning: Proc. of the 8th International Conference, Tolouse, France, April 2002, pp. 170\u2013176. Morgan Kaufmann, San Francisco (2002)"},{"key":"17_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J.W. Lloyd","year":"1987","unstructured":"Lloyd, J.W.: Foundations of Logic Programming. Springer, Berlin (1987)"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1145\/116825.116836","volume":"38","author":"W. Marek","year":"1991","unstructured":"Marek, W., Truszczy\u0144ski, M.: Autoepistemic logic. Journal of the ACM\u00a038, 588\u2013619 (1991)","journal-title":"Journal of the ACM"},{"key":"17_CR21","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/978-3-642-60085-2_17","volume-title":"The Logic Programming Paradigm: a 25-Year Perspective","author":"W. Marek","year":"1999","unstructured":"Marek, W., Truszczy\u0144ski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 375\u2013398. Springer, Heidelberg (1999)"},{"issue":"3-4","key":"17_CR22","first-page":"241","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Annals of Math. and AI\u00a025(3-4), 241\u2013273 (1999)","journal-title":"Annals of Math. and AI"},{"key":"17_CR23","unstructured":"Oikarinen, E.: DLPEQ 1.9 \u2013 a tool for testing the equivalence of disjunctive logic programs. Computer Program (2003), \n                    \n                      http:\/\/www.tcs.hut.fi\/Software\/lpeq\/"},{"key":"17_CR24","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"17_CR25","first-page":"405","volume-title":"Proc. of the 18th International Conference on Logic Programming","author":"D. Pearce","year":"2002","unstructured":"Pearce, D., Sarsakov, V., Schaub, T., Tompits, H., Woltran, S.: A polynomial translation of logic programs with nested expressions into disjunctive logic programs: Preliminary report. In: Proc. of the 18th International Conference on Logic Programming, Copenhagen, Denmark, July-August 2002, pp. 405\u2013420. Springer, Heidelberg (2002)"},{"key":"17_CR26","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/3-540-45329-6_31","volume-title":"Proc. of the 10th Portuguese Conference on Artificial Intelligence","author":"D. Pearce","year":"2001","unstructured":"Pearce, D., Tompits, H., Woltran, S.: Encodings for equilibirium logic and logic programs with nested expressions. In: Proc. of the 10th Portuguese Conference on Artificial Intelligence, Porto, Portugal, December 2001, pp. 306\u2013320. Springer, Heidelberg (2001)"},{"key":"17_CR27","first-page":"459","volume-title":"Proc. of the 7th International Conference on Logic Programming","author":"T. Przymusinski","year":"1990","unstructured":"Przymusinski, T.: Extended stable semantics for normal and disjunctive logic programs. In: Proc. of the 7th International Conference on Logic Programming, pp. 459\u2013477. MIT Press, Cambridge (1990)"},{"issue":"1-2","key":"17_CR28","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P. Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence\u00a0138(1-2), 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"issue":"4-5","key":"17_CR29","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1017\/S1471068403001819","volume":"3","author":"H. Turner","year":"2003","unstructured":"Turner, H.: Strong equivalence made easy: Nested expressions and weight constraints. Theory and Practice of Logic Programming\u00a03(4-5), 609\u2013622 (2003)","journal-title":"Theory and Practice of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24609-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T15:18:45Z","timestamp":1553354325000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24609-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207214","9783540246091"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24609-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}