{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T12:13:32Z","timestamp":1707221612515},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2006,9,12]],"date-time":"2006-09-12T00:00:00Z","timestamp":1158019200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2006,11,9]]},"DOI":"10.1007\/s10472-006-9027-0","type":"journal-article","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T14:42:00Z","timestamp":1157985720000},"page":"43-78","source":"Crossref","is-referenced-by-count":2,"title":["Strong order equivalence"],"prefix":"10.1007","volume":"47","author":[{"given":"Wolfgang","family":"Faber","sequence":"first","affiliation":[]},{"given":"Kathrin","family":"Konczak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,9,12]]},"reference":[{"key":"9027_CR1","unstructured":"Balduccini, M., Gelfond, M.: Logic programs with consistency-restoring rules. In Doherty, P., McCarthy, J., M.-A., Williams (eds.) International Symposium on Logical Formalization of Commonsense Reasoning. AAAI 2003 Spring Symposium Series, March (2003)"},{"key":"9027_CR2","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"C. Baral","year":"2002","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge, Massachusetts (2002)"},{"key":"9027_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(51)90004-7","volume":"78","author":"N. Bidoit","year":"1991","unstructured":"Bidoit, N., Froidevaux, C.: Negation by default and unstratifiable logic programs. Theor. Comp. Sci. 78, 85\u2013112 (1991)","journal-title":"Theor. Comp. Sci."},{"key":"9027_CR4","doi-asserted-by":"crossref","unstructured":"Brass, S., Dix, J.: Disjunctive semantics based upon partial and bottom-up evaluation. In: Sterling, L. (ed.) Proceedings of the 12th Int. Conf. on Logic Programming, pp. 199\u2013213. Tokyo, June 1995, MIT Press, Cambridge, Massachusetts (1995)","DOI":"10.7551\/mitpress\/4298.003.0027"},{"issue":"1","key":"9027_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0743-1066(98)10030-4","volume":"40","author":"S. Brass","year":"1999","unstructured":"Brass, S., Dix, J.: Semantics of (disjunctive) logic programs based on partial evaluation. J. Log. Program. 40(1), 1\u201346 (1999) (Extended Abstract appeared as [4])","journal-title":"J. Log. Program."},{"key":"9027_CR6","first-page":"100","volume-title":"Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-2002)","author":"G. Brewka","year":"2002","unstructured":"Brewka, G.: Logic programming with ordered disjunction. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-2002), pp. 100\u2013105. AAAI Press, Edmonton, Canada (2002)"},{"issue":"1-2","key":"9027_CR7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0004-3702(99)00015-6","volume":"109","author":"G. Brewka","year":"1999","unstructured":"Brewka, G., Eiter, T.: Preferred answer sets for extended logic programs. Artif. Intell. 109(1-2), 297\u2013356 (1999)","journal-title":"Artif. Intell."},{"key":"9027_CR8","first-page":"867","volume-title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI-03)","author":"G. Brewka","year":"2003","unstructured":"Brewka, G., Niemel\u00e4, I., Truszczy\u0144ski, M.: Answer set optimization. In: Gottlob, G., Walsh, T. (eds.) Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI-03), pp. 867\u2013872. Morgan Kaufmann, San Francisco, California (2003)"},{"issue":"3","key":"9027_CR9","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/502807.502810","volume":"33","author":"E. Dantsin","year":"2001","unstructured":"Dantsin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3), 374\u2013425 (2001)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"9027_CR10","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1017\/S1471068402001539","volume":"3","author":"J.P. Delgrande","year":"2003","unstructured":"Delgrande, J.P., Schaub, T., Tompits, H.: A framework for compiling preferences in logic programs. Theory Pract. Logic Program. 3(2), 129\u2013187 (March 2003)","journal-title":"Theory Pract. Logic Program."},{"issue":"2","key":"9027_CR11","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1111\/j.0824-7935.2004.00240.x","volume":"20","author":"J.P. Delgrande","year":"2004","unstructured":"Delgrande, J.P., Schaub, T., Tompits, H., Wang, K.: A classification and survey of preference handling approaches in nonmonotonic reasoning. Comput. Intell. 20(2), 308\u2013334 (2004)","journal-title":"Comput. Intell."},{"key":"9027_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/978-3-540-24599-5_16","volume-title":"Logic Programming, 19th International Conference, ICLP 2003","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., Fink, M.: Uniform equivalence of logic programs under the stable model semantics. In: Palamidessi, C. (ed.) Logic Programming, 19th International Conference, ICLP 2003. Lecture Notes in Computer Science, vol. 2916, pp. 224\u2013238. Springer, Berlin Heidelberg New York (2003)"},{"key":"9027_CR13","unstructured":"Eiter, T., Fink, M., Sabbatini, G., Tompits, H.: A generic approach for knowledge-based information site selection. In: Fensel, D., Giunchiglia, F., McGuiness, D., Williams, M.-A. (eds.) Proceedings Eighth International Conference on Principles of Knowledge Representation and Reasoning (KR-02), April 22-25, Toulouse, France, pp. 459\u2013469. Morgan Kaufmann, 2002. Extended version Technical Report INFSYS RR-1843-02-09, TU Wien, 2002."},{"key":"9027_CR14","series-title":"Lecture Notes in Computer Science","first-page":"87","volume-title":"Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201904)","author":"T. Eiter","year":"2004","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: Simplifying logic programs under uniform and strong equivalence. In: Lifschitz, V., Niemel\u00e4, I (eds.) Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201904). Lecture Notes in Computer Science, vol. 2923, pp. 87\u201399. Springer, Berlin Heidelberg New York (2004)"},{"key":"9027_CR15","doi-asserted-by":"crossref","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: Simplifying logic programs under uniform and strong equivalence. In: Lifschitz, V., Niemel\u00e4, I. (eds.) Proceedings of the Seventh International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-7), number 2923 in Lecture Notes in AI (LNAI), pp. 87\u201399, Fort Lauderdale, Florida, USA, January 2004. Springer Berlin Heidelberg New York.","DOI":"10.1007\/978-3-540-24609-1_10"},{"key":"9027_CR16","first-page":"695","volume-title":"Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference (AAAI\u201905)","author":"T. Eiter","year":"2005","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: Strong and uniform equivalence in answer-set programming: Characterizations and complexity results for the non-ground case. In: Veloso, M.M., Kambhampati, S. (eds.) Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference (AAAI\u201905), pp. 695\u2013700. AAAI Press\/The MIT Press, Menlo Park, California (2005)"},{"key":"9027_CR17","doi-asserted-by":"crossref","unstructured":"Eiter, T., Fink, M., Woltran, S.: Semantical characterizations and complexity of equivalences in answer set programming. ACM Trans. Comput. Logic (in press)","DOI":"10.1145\/1243996.1244000"},{"key":"9027_CR18","unstructured":"Faber, W., Konczak, K.: Strong equivalence for logic programs with preferences. In: Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), pp. 430\u2013435, August 2005"},{"key":"9027_CR19","first-page":"1070","volume-title":"Logic Programming: Proceedings Fifth Intl Conference and Symposium","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Logic Programming: Proceedings Fifth Intl Conference and Symposium, pp. 1070\u20131080. The MIT Press, Cambridge, Massachusetts (1988)"},{"key":"9027_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/978-3-540-30227-8_17","volume-title":"Proceedings of the Ninth European Conference on Logics in Artificial Intelligence (JELIA\u201904)","author":"K. Inoue","year":"2004","unstructured":"Inoue, K., Sakama, C.: Equivalence of logic programs under updates. In: Alferes, J., Leite, J. (eds.) Proceedings of the Ninth European Conference on Logics in Artificial Intelligence (JELIA\u201904). Lecture Notes in Computer Science, vol. 3229, pp. 174\u2013186. Springer, Berlin Heidelberg New York (2004)"},{"key":"9027_CR21","unstructured":"Inoue, K., Sakama, C.: Equivalence in abductive logic. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI-05), pp. 472\u2013477 (2005)"},{"issue":"4","key":"9027_CR22","doi-asserted-by":"crossref","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 Trans. on Comput. Logic 2(4), 526\u2013541 (2001)","journal-title":"ACM Trans. on Comput. Logic"},{"key":"9027_CR23","first-page":"170","volume-title":"Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (KR\u201902)","author":"F. Lin","year":"2002","unstructured":"Lin, F.: Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: Fensel, D., Giunchiglia, F., McGuiness, D., Williams, M.-A. (eds.) Proceedings of the 8th International Conference on Principles of Knowledge Representation and Reasoning (KR\u201902), pp. 170\u2013176. Morgan Kaufmann, San Francisco, California (2002)"},{"key":"9027_CR24","unstructured":"Lin, F., Chen, Y.: Discovering classes of strongly equivalent logic programs. In: Nineteenth International Joint Conference on Artificial Intelligence (IJCAI-05), pp. 516\u2013521, August 2005."},{"key":"9027_CR25","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":"V. Marek","year":"1999","unstructured":"Marek, V., Truszczy\u0144ski, M.: Stable models and an alternative logic programming paradigm. In: The Logic Programming Paradigm: a 25-Year Perspective, pp. 375\u2013398. Springer, Berlin Heidelberg New York (1999)"},{"issue":"3","key":"9027_CR26","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/116825.116836","volume":"38","author":"V.W. Marek","year":"1991","unstructured":"Marek, V.W., Truszczy\u0144ski, M.: Autoepistemic logic. J. ACM 38(3), 588\u2013619 (1991)","journal-title":"J. ACM"},{"key":"9027_CR27","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programs with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25, 241\u2013273 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"key":"9027_CR28","series-title":"Lecture Notes in Computer Science","first-page":"57","volume-title":"Logic Based Program Synthesis and Transformation, 11th International Workshop (LOPSTR 2001)","author":"M. Osorio","year":"2001","unstructured":"Osorio, M., Navarro, J.A., Arrazola, J.: Equivalence in answer set programming. In: Logic Based Program Synthesis and Transformation, 11th International Workshop (LOPSTR 2001). Lecture Notes in Computer Science, vol. 2372, pp. 57\u201375. Springer, Berlin Heidelberg New York (2001)"},{"key":"9027_CR29","volume-title":"Computational complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational complexity. Addison-Wesley, Reading, Massachusetts (1994)"},{"key":"9027_CR30","unstructured":"Pearce, D., Valverde, A.: Some types of equivalence for logic programs and equilibrium logic. In: Proceedings of International Joint Conference on Declarative Programming, APPIA-GULP-PRODE 2003, pp. 350\u2013361. Universit\u00e1 degli Studi di Reggio Calabria (2003)"},{"key":"9027_CR31","unstructured":"plp. http:\/\/www.cs.uni-potsdam.de\/~torsten\/plp (2002)"},{"key":"9027_CR32","first-page":"82","volume-title":"Proceedings of the Joint International Conference and Symposium on Logic Programming","author":"C. Sakama","year":"1996","unstructured":"Sakama, C., Inoue, K.: Representing priorities in logic programs. In: Maher, M. (ed.) Proceedings of the Joint International Conference and Symposium on Logic Programming, pp. 82\u201396. The MIT Press, Cambridge, Massachusetts (1996)"},{"issue":"4\u20135","key":"9027_CR33","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1017\/S1471068403001844","volume":"3","author":"T. Schaub","year":"2003","unstructured":"Schaub, T., Wang, K.: A semantic framework for preference handling in answer set programming. Theory Pract. Logic Program. 3(4\u20135), 569\u2013607 (2003)","journal-title":"Theory Pract. Logic Program."},{"issue":"4\u20135","key":"9027_CR34","doi-asserted-by":"crossref","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 Pract. Logic Program. 3(4\u20135), 609\u2013622 (2003)","journal-title":"Theory Pract. Logic Program."},{"key":"9027_CR35","doi-asserted-by":"crossref","unstructured":"Wang, K., Zhou, L.: Comparisons and computation of well-founded semantics for disjunctive logic programs. ACM Trans. Comput. Logic 6(2), April (2005)","DOI":"10.1145\/1055686.1055690"},{"key":"9027_CR36","first-page":"164","volume-title":"Computational Logic - CL 2000, First International Conference, Proceedings, number 1861 in Lecture Notes in AI (LNAI)","author":"K. Wang","year":"2000","unstructured":"Wang, K., Zhou, L., Lin, F.: Alternating fixpoint theory for logic programs with priority. In: Computational Logic - CL 2000, First International Conference, Proceedings, number 1861 in Lecture Notes in AI (LNAI), pp. 164\u2013178, London, UK, July 2000 Springer, Berlin Heidelberg New York (2000)"},{"key":"9027_CR37","first-page":"161","volume-title":"Logics in Artificial Intelligence, 9th European Conference (JELIA 2004) Lecture Notes in Computer Science","author":"S. Woltran","year":"2004","unstructured":"Woltran, S.: Characterizations for relativized notions of equivalence in answer set programming. In: Alferes, J., Leite, J. (eds.) Logics in Artificial Intelligence, 9th European Conference (JELIA 2004) Lecture Notes in Computer Science, vol. 3229, pp. 161\u2013173. Springer, Berlin Heidelberg New York (2004)"},{"key":"9027_CR38","first-page":"69","volume-title":"Proceedings of the International Symposium on Logic Programming (ILPS-97)","author":"Y. Zhang","year":"1997","unstructured":"Zhang, Y., Foo, N.: Answer sets for prioritized logic programs. In: Maluszynski, J. (ed.) Proceedings of the International Symposium on Logic Programming (ILPS-97), pp. 69\u201384. The MIT Press, Cambridge, Massachusetts (1997)"}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-006-9027-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-006-9027-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-006-9027-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T11:28:02Z","timestamp":1707218882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-006-9027-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,9,12]]},"references-count":38,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2006,11,9]]}},"alternative-id":["9027"],"URL":"https:\/\/doi.org\/10.1007\/s10472-006-9027-0","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,9,12]]}}}