{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T21:01:26Z","timestamp":1750453286372},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232421"},{"type":"electronic","value":"9783540302278"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30227-8_16","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:34:52Z","timestamp":1284860092000},"page":"161-173","source":"Crossref","is-referenced-by-count":25,"title":["Characterizations for Relativized Notions of Equivalence in Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Woltran","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0890-5401(91)90073-B","volume":"91","author":"N. Bidoit","year":"1991","unstructured":"Bidoit, N., Froidevaux, C.: General Logical Databases and Programs: Default Logic Semantics and Stratification. Information and Computation\u00a091, 15\u201354 (1991)","journal-title":"Information and Computation"},{"issue":"3","key":"16_CR2","first-page":"167","volume":"38","author":"S. Brass","year":"1999","unstructured":"Brass, S., Dix, J.: Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation. Journal of Logic Programming\u00a038(3), 167\u2013213 (1999)","journal-title":"Journal of Logic Programming"},{"key":"16_CR3","unstructured":"Cabalar, P.: A Three-Valued Characterization for Strong Equivalence of Logic Programs. In: Proc. AAAI 2002, pp. 106\u2013111. AAAI Press\/MIT Press (2002)"},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1017\/S147106840200159X","volume":"3","author":"D. Jongh de","year":"2003","unstructured":"de Jongh, D., Hendriks, L.: Characterizations of Strongly Equivalent Logic Programs in Intermediate Logics. Theory and Practice of Logic Programming\u00a03(3), 259\u2013270 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-1-4615-1567-8_4","volume-title":"Logic-Based Artificial Intelligence","author":"T. Eiter","year":"2000","unstructured":"Eiter, T., Faber, W., Leone, N., Pfeifer, G.: Declarative Problem-Solving Using the DLV System. In: Logic-Based Artificial Intelligence, pp. 79\u2013103. Kluwer Academic, Dordrecht (2000)"},{"key":"16_CR6","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)"},{"key":"16_CR7","first-page":"447","volume-title":"Proc. KR 2004","author":"T. Eiter","year":"2004","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: On Eliminating Disjunctions in Stable Logic Programming. In: Proc. KR 2004, pp. 447\u2013585. AAAI-Press, Menlo Park (2004)"},{"key":"16_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-24609-1_10","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Eiter","year":"2003","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: Simplifying Logic Programs under Uniform and Strong Equivalence. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 87\u201399. Springer, Heidelberg (2003)"},{"issue":"3\/4","key":"16_CR9","doi-asserted-by":"publisher","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 Math. and Artificial Intelligence\u00a015(3\/4), 289\u2013323 (1995)","journal-title":"Annals of Math. and Artificial Intelligence"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1145\/261124.261126","volume":"22","author":"T. Eiter","year":"1997","unstructured":"Eiter, T., Gottlob, G., Mannila, H.: Disjunctive Datalog. ACM Transactions on Database Systems\u00a022, 364\u2013418 (1997)","journal-title":"ACM Transactions on Database Systems"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M. Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: ClassicalNegation in Logic Programs and Disjunctive Databases. New Generation Computing\u00a09, 365\u2013385 (1991)","journal-title":"New Generation Computing"},{"key":"16_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-30227-8_17","volume-title":"Logics in Artificial Intelligence","author":"K. Inoue","year":"2004","unstructured":"Inoue, K., Sakama, C.: Equivalence of Logic Programs under Updates. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 174\u2013186. Springer, Heidelberg (2004)"},{"key":"16_CR13","first-page":"411","volume-title":"Proc. KR 2000","author":"T. Janhunen","year":"2000","unstructured":"Janhunen, T., Niemel\u00e4, I., Simons, P., You, J.-H.: Partiality and Disjunctions in Stable Model Semantics. In: Proc. KR 2000, pp. 411\u2013419. Morgan Kaufmann, San Francisco (2000)"},{"key":"16_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-540-24609-1_30","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Janhunen","year":"2003","unstructured":"Janhunen, T., Oikarinen, E.: LPEQ and DLPEQ - Translators for Automated Equivalence Testing of Logic Programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 336\u2013340. Springer, Heidelberg (2003)"},{"issue":"4","key":"16_CR15","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(4), 526\u2013541 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"16_CR16","unstructured":"Lifschitz, V., Turner, H.: Splitting a Logic Program. In: Proc. ICLP 1994, pp. 23\u201338 (1994)"},{"key":"16_CR17","first-page":"170","volume-title":"Proc. KR 2002","author":"F. Lin","year":"2002","unstructured":"Lin, F.: Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic. In: Proc. KR 2002, pp. 170\u2013176. Morgan Kaufmann, San Francisco (2002)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Maher, M.J.: Equivalences of Logic Programs. In: Minker [20], pp. 627\u2013658","DOI":"10.1016\/B978-0-934613-40-8.50020-8"},{"issue":"3","key":"16_CR19","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. J. of the ACM\u00a038(3), 588\u2013619 (1991)","journal-title":"J. of the ACM"},{"volume-title":"Foundations of Deductive Databases and Logic Programming","year":"1988","key":"16_CR20","unstructured":"Minker, J. (ed.): Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, San Francisco (1988)"},{"key":"16_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-540-24609-1_17","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"E. Oikarinen","year":"2003","unstructured":"Oikarinen, E., Janhunen, T.: Verifying the Equivalence of Logic programs in the Disjunctive Case. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 180\u2013193. Springer, Heidelberg (2003)"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-45607-4_4","volume-title":"Logic Based Program Synthesis and Transformation","author":"M. Osorio","year":"2002","unstructured":"Osorio, M., Navarro, J.A., Arrazola, J.: Equivalence in Answer Set Programming. In: Pettorossi, A. (ed.) LOPSTR 2001. LNCS, vol.\u00a02372, pp. 57\u201375. Springer, Heidelberg (2002)"},{"key":"16_CR23","series-title":"Lecture Notes in Artificial Intelligence","first-page":"306","volume-title":"Progress in Artificial Intelligence. Knowledge Extraction, Multi-agent Systems, Logic Programming, and Constraint Solving","author":"D. Pearce","year":"2001","unstructured":"Pearce, D., Tompits, H., Woltran, S.: Encodings for Equilibrium Logic and Logic Programs with Nested Expressions. In: Brazdil, P.B., Jorge, A.M. (eds.) EPIA 2001. LNCS (LNAI), vol.\u00a02258, pp. 306\u2013320. Springer, Heidelberg (2001)"},{"key":"16_CR24","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-24609-1_18","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"D. Pearce","year":"2003","unstructured":"Pearce, D., Valverde, A.: Uniform Equivalence for Equilibrium Logic and Logic Programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 194\u2013206. Springer, Heidelberg (2003)"},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/BF03037171","volume":"9","author":"T. Przymusinski","year":"1991","unstructured":"Przymusinski, T.: Stable Semantics for Disjunctive Programs. New Generation Computing Journal\u00a09, 401\u2013424 (1991)","journal-title":"New Generation Computing Journal"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Sagiv, Y.: Optimizing Datalog Programs. In: Minker [20], pp. 659\u2013698","DOI":"10.1145\/28659.28696"},{"issue":"3","key":"16_CR27","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0743-1066(93)90040-N","volume":"15","author":"O. Shmueli","year":"1993","unstructured":"Shmueli, O.: Equivalence of Datalog Queries is Undecidable. Journal of Logic Programming\u00a015(3), 231\u2013242 (1993)","journal-title":"Journal of Logic Programming"},{"key":"16_CR28","series-title":"Lecture Notes in Artificial Intelligence","first-page":"81","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"H. Turner","year":"2001","unstructured":"Turner, H.: Strong Equivalence for Logic Programs and Default Theories (Made Easy). In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.\u00a02173, pp. 81\u201392. Springer, Heidelberg (2001)"},{"issue":"4-5","key":"16_CR29","first-page":"602","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), 602\u2013622 (2003)","journal-title":"Theory and Practice of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30227-8_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:50:54Z","timestamp":1605761454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30227-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232421","9783540302278"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30227-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}