{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T20:47:57Z","timestamp":1725655677128},"publisher-location":"Berlin, Heidelberg","reference-count":55,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642242052"},{"type":"electronic","value":"9783642242069"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-24206-9_7","type":"book-chapter","created":{"date-parts":[[2012,1,27]],"date-time":"2012-01-27T08:23:02Z","timestamp":1327652582000},"page":"106-119","source":"Crossref","is-referenced-by-count":1,"title":["Equivalence between Extended Datalog Programs \u2014 A Brief Survey"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Woltran","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","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 (2002)"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","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 Computing Surveys\u00a033(3), 374\u2013425 (2001)","journal-title":"ACM Computing Surveys"},{"issue":"3","key":"7_CR3","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":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1007\/978-3-642-04238-6_75","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Denecker","year":"2009","unstructured":"Denecker, M., Vennekens, J., Bond, S., Gebser, M., Truszczynski, M.: The Second Answer Set Programming Competition. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 637\u2013654. Springer, Heidelberg (2009)"},{"issue":"2-4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/s10472-008-9086-5","volume":"51","author":"T. Eiter","year":"2007","unstructured":"Eiter, T., Faber, W., Fink, M., Woltran, S.: Complexity Results for Answer Set Programming with Bounded Predicate Arities and Implications. Annals of Mathematics and Artificial Intelligence\u00a051(2-4), 123\u2013165 (2007)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"7_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":"7_CR7","first-page":"340","volume-title":"Proc. KR 2006","author":"T. Eiter","year":"2006","unstructured":"Eiter, T., Fink, M., Tompits, H., Traxler, P., Woltran, S.: Replacements in Non-Ground Answer-Set Programming. In: Proc. KR 2006, pp. 340\u2013351. AAAI Press, Menlo Park (2006)"},{"key":"7_CR8","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\u2013458. AAAI Press, Menlo Park (2004)"},{"key":"7_CR9","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)"},{"key":"7_CR10","first-page":"695","volume-title":"Proc. AAAI 2005","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: Proc. AAAI 2005, pp. 695\u2013700. AAAI Press, Menlo Park (2005)"},{"key":"7_CR11","first-page":"330","volume-title":"Proc. IJCAI 2007","author":"T. Eiter","year":"2007","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: Complexity Results for Checking Equivalence of Stratified Logic Programs. In: Proc. IJCAI 2007, pp. 330\u2013335. AAAI Press, Menlo Park (2007)"},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/1243996.1244000","volume":"8","author":"T. Eiter","year":"2007","unstructured":"Eiter, T., Fink, M., Woltran, S.: Semantical Characterizations and Complexity of Equivalences in Answer Set Programming. ACM Transactions on Computational Logic\u00a08(3), pages 53 (2007)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"1-3","key":"7_CR13","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0168-0072(95)00033-X","volume":"78","author":"T. Eiter","year":"1996","unstructured":"Eiter, T., Gottlob, G., Gurevich, Y.: Normal Forms for Second-Order Logic over Finite Structures, and Classification of NP Optimization Problems. Annals of Pure and Applied Logic\u00a078(1-3), 111\u2013125 (1996)","journal-title":"Annals of Pure and Applied Logic"},{"issue":"3","key":"7_CR14","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(3), 364\u2013418 (1997)","journal-title":"ACM Transactions on Database Systems"},{"key":"7_CR15","unstructured":"Eiter, T., Tompits, H., Woltran, S.: On Solution Correspondences in Answer Set Programming. In: Proc. IJCAI 2005, pp. 97\u2013102. Professional Book Center (2005)"},{"issue":"5-6","key":"7_CR16","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1017\/S1471068408003323","volume":"8","author":"W. Faber","year":"2008","unstructured":"Faber, W., Pfeifer, G., Leone, N., Dell\u2019Armi, T., Ielpa, G.: Design and Implementation of Aggregate Functions in the DLV System. Theory and Practice of Logic Programming\u00a08(5-6), 545\u2013580 (2008)","journal-title":"Theory and Practice of Logic Programming"},{"key":"7_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/3-540-56039-4_49","volume-title":"Database Theory - ICDT \u201992","author":"T. Feder","year":"1992","unstructured":"Feder, T., Saraiya, Y.: Decidability and Undecidability of Equivalence for Linear Datalog with Applications to Normal-Form Optimizations. In: Hull, R., Biskup, J. (eds.) ICDT 1992. LNCS, vol.\u00a0646, pp. 297\u2013311. Springer, Heidelberg (1992)"},{"key":"7_CR18","unstructured":"Fink, M.: A General Framework for Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There. CoRR, abs\/1006.3021 (2010) (to appear); Theory and Practice of Logic Programming"},{"key":"7_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-72200-7_12","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Fink","year":"2007","unstructured":"Fink, M., Pichler, R., Tompits, H., Woltran, S.: Complexity of Rule Redundancy in Non-Ground Answer-Set Programming over Finite Domains. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol.\u00a04483, pp. 123\u2013135. Springer, Heidelberg (2007)"},{"issue":"3","key":"7_CR20","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1145\/174130.174142","volume":"40","author":"H. Gaifman","year":"1993","unstructured":"Gaifman, H., Mairson, H., Sagiv, Y., Vardi, M.: Undecidable Optimization Problems for Database Logic Programs. Journal of the ACM\u00a040(3), 683\u2013713 (1993)","journal-title":"Journal of the ACM"},{"key":"7_CR21","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-72200-7_3","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2007","unstructured":"Gebser, M., Liu, L., Namasivayam, G., Neumann, A., Schaub, T., Truszczynski, M.: The First Answer Set Programming System Competition. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol.\u00a04483, pp. 3\u201317. Springer, Heidelberg (2007)"},{"key":"7_CR22","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/3-540-45632-5_16","volume-title":"Computational Logic: Logic Programming and Beyond","author":"M. Gelfond","year":"2002","unstructured":"Gelfond, M.: Representing Knowledge in A-Prolog. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol.\u00a02408, pp. 413\u2013451. Springer, Heidelberg (2002)"},{"issue":"1-2","key":"7_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0004-3702(02)00207-2","volume":"138","author":"M. Gelfond","year":"2002","unstructured":"Gelfond, M., Leone, N.: Logic Programming and Knowledge Representation - The A-Prolog Perspective. Artificial Intelligence\u00a0138(1-2), 3\u201338 (2002)","journal-title":"Artificial Intelligence"},{"key":"7_CR24","first-page":"1070","volume-title":"Proc. ICLP 1988","author":"M. Gelfond","year":"1988","unstructured":"Gelfond, M., Lifschitz, V.: The Stable Model Semantics for Logic Programming. In: Proc. ICLP 1988, pp. 1070\u20131080. MIT Press, Cambridge (1988)"},{"key":"7_CR25","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"},{"issue":"5","key":"7_CR26","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1145\/502102.502104","volume":"48","author":"A. Halevy","year":"2001","unstructured":"Halevy, A., Mumick, I., Sagiv, Y., Shmueli, O.: Static Analysis in Datalog Extensions. Journal of the ACM\u00a048(5), 971\u20131012 (2001)","journal-title":"Journal of the ACM"},{"key":"7_CR27","first-page":"1","volume-title":"Proc. PODS 1991","author":"G. Hillebrand","year":"1991","unstructured":"Hillebrand, G., Kanellakis, P., Mairson, H., Vardi, M.: Tools for Datalog Boundedness. In: Proc. PODS 1991, pp. 1\u201312. ACM Press, New York (1991)"},{"key":"7_CR28","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)"},{"issue":"3","key":"7_CR29","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N. Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV System for Knowledge Representation and Reasoning. ACM Transactions on Computational Logic\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM Transactions on Computational Logic"},{"key":"7_CR30","first-page":"171","volume-title":"Proc. VLDB 1993","author":"A. Levy","year":"1993","unstructured":"Levy, A., Sagiv, Y.: Queries Independent of Updates. In: Proc. VLDB 1993, pp. 171\u2013181. Morgan Kaufmann, San Francisco (1993)"},{"key":"7_CR31","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0004-3702(02)00186-8","volume":"138","author":"V. Lifschitz","year":"2002","unstructured":"Lifschitz, V.: Answer Set Programming and Plan Generation. Artificial Intelligence\u00a0138, 39\u201354 (2002)","journal-title":"Artificial Intelligence"},{"issue":"4","key":"7_CR32","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":"7_CR33","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-72200-7_17","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"V. Lifschitz","year":"2007","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: A Characterization of Strong Equivalence for Logic Programs with Variables. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol.\u00a04483, pp. 188\u2013200. Springer, Heidelberg (2007)"},{"key":"7_CR34","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":"7_CR35","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1613\/jair.2131","volume":"28","author":"F. Lin","year":"2007","unstructured":"Lin, F., Chen, Y.: Discovering Classes of Strongly Equivalent Logic Programs. Journal of Artificial Intelligence Research\u00a028, 431\u2013451 (2007)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"7_CR36","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1613\/jair.2009","volume":"27","author":"L. Liu","year":"2006","unstructured":"Liu, L., Truszczynski, M.: Properties and Applications of Programs with Monotone and Convex Constraints. Journal of Artificial Intelligence Research\u00a027, 299\u2013334 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"7_CR37","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1016\/B978-0-934613-40-8.50020-8","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"M. Maher","year":"1988","unstructured":"Maher, M.: Equivalences of Logic Programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 627\u2013658. Morgan Kaufmann, San Francisco (1988)"},{"key":"7_CR38","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-642-60085-2_17","volume-title":"The Logic Programming Paradigm \u2013 A 25-Year Perspective","author":"V. Marek","year":"1999","unstructured":"Marek, V., Truszczy\u0144ski, M.: Stable Models and an Alternative Logic Programming Paradigm. In: Apt, K., Marek, V.W., Truszczy\u0144ski, M., Warren, D.S. (eds.) The Logic Programming Paradigm \u2013 A 25-Year Perspective, pp. 375\u2013398. Springer, Heidelberg (1999)"},{"key":"7_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01530759","volume":"12","author":"J. Minker","year":"1994","unstructured":"Minker, J.: Overview of Disjunctive Logic Programming. Annals of Mathematics and Artificial Intelligence\u00a012, 1\u201324 (1994)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3-4","key":"7_CR40","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I. Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic Programming with Stable Model Semantics as Constraint Programming Paradigm. Annals of Mathematics and Artificial Intelligence\u00a025(3-4), 241\u2013273 (1999)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"7_CR41","doi-asserted-by":"crossref","unstructured":"Nogueira, M., Balduccini, M., Gelfond, M., Watson, R., Barry, M.: An A-Prolog Decision Support System for the Space Shuttle. In: Gupta, G. (ed.) PADL 1999. LNCS, vol.\u00a01551, pp. 169\u2013183. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-45241-9_12"},{"key":"7_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-540-89982-2_49","volume-title":"Logic Programming","author":"J. Oetsch","year":"2008","unstructured":"Oetsch, J., Tompits, H.: Program Correspondence under the Answer-Set Semantics: The Non-ground Case. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 591\u2013605. Springer, Heidelberg (2008)"},{"key":"7_CR43","first-page":"412","volume-title":"Proc. ECAI 2006","author":"E. Oikarinen","year":"2006","unstructured":"Oikarinen, E., Janhunen, T.: Modular Equivalence for Normal Logic Programs. In: Proc. ECAI 2006, pp. 412\u2013416. IOS Press, Amsterdam (2006)"},{"issue":"5","key":"7_CR44","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1017\/S147106840999010X","volume":"9","author":"D. Pearce","year":"2009","unstructured":"Pearce, D., Tompits, H., Woltran, S.: Characterising Equilibrium Logic and Nested Logic Programs: Reductions and Complexity. Theory and Practice of Logic Programming\u00a09(5), 565\u2013616 (2009)","journal-title":"Theory and Practice of Logic Programming"},{"key":"7_CR45","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":"7_CR46","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1016\/B978-0-934613-40-8.50021-X","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"Y. Sagiv","year":"1988","unstructured":"Sagiv, Y.: Optimising DATALOG Programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 659\u2013698. Morgan Kaufmann, San Francisco (1988)"},{"key":"7_CR47","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/978-3-642-04238-6_73","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Schaub","year":"2009","unstructured":"Schaub, T.: Making Your Hands Dirty Inspires Your Brain! Or How to Switch ASP into Production Mode. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS (LNAI), vol.\u00a05753, pp. 631\u2013633. Springer, Heidelberg (2009)"},{"key":"7_CR48","first-page":"237","volume-title":"Proc. PODS 1987","author":"O. Shmueli","year":"1987","unstructured":"Shmueli, O.: Decidability and Expressiveness Aspects of Logic Queries. In: Proc. PODS 1987, pp. 237\u2013249. ACM Press, New York (1987)"},{"issue":"6","key":"7_CR49","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1017\/S1471068409990159","volume":"9","author":"M. Truszczynski","year":"2009","unstructured":"Truszczynski, M., Woltran, S.: Relativized Hyperequivalence of Logic Programs for Modular Programming. Theory and Practice of Logic Programming\u00a09(6), 781\u2013819 (2009)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"4-5","key":"7_CR50","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"},{"key":"7_CR51","first-page":"137","volume-title":"Proc. STOC 1982","author":"M. Vardi","year":"1982","unstructured":"Vardi, M.: The Complexity of Relational Query Languages (Extended Abstract). In: Proc. STOC 1982, pp. 137\u2013146. ACM, New York (1982)"},{"key":"7_CR52","first-page":"266","volume-title":"Proc. PODS 1995","author":"M. Vardi","year":"1995","unstructured":"Vardi, M.: On the Complexity of Bounded-Variable Queries. In: Proc. PODS 1995, pp. 266\u2013276. ACM Press, New York (1995)"},{"key":"7_CR53","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-30227-8_16","volume-title":"Logics in Artificial Intelligence","author":"S. Woltran","year":"2004","unstructured":"Woltran, S.: Characterizations for Relativized Notions of Equivalence in Answer Set Programming. In: Alferes, J.J., Leite, J. (eds.) JELIA 2004. LNCS (LNAI), vol.\u00a03229, pp. 161\u2013173. Springer, Heidelberg (2004)"},{"issue":"2","key":"7_CR54","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1017\/S1471068407003250","volume":"8","author":"S. Woltran","year":"2008","unstructured":"Woltran, S.: A common view on Strong, Uniform, and other Notions of Equivalence in Answer-Set Programming. Theory and Practice of Logic Programming\u00a08(2), 217\u2013234 (2008)","journal-title":"Theory and Practice of Logic Programming"},{"key":"7_CR55","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1613\/jair.2472","volume":"31","author":"K.-S. Wong","year":"2008","unstructured":"Wong, K.-S.: Sound and Complete Inference Rules for SE-Consequence. Journal of Artificial Intelligence Research\u00a031, 205\u2013216 (2008)","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","Datalog Reloaded"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-24206-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T17:19:40Z","timestamp":1556212780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-24206-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642242052","9783642242069"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-24206-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}