{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T10:47:07Z","timestamp":1758278827268},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540899815"},{"type":"electronic","value":"9783540899822"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89982-2_49","type":"book-chapter","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T03:09:15Z","timestamp":1229310555000},"page":"591-605","source":"Crossref","is-referenced-by-count":7,"title":["Program Correspondence under the Answer-Set Semantics: The Non-ground Case"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Oetsch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Tompits","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"49_CR1","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 TOCL\u00a07(3), 499\u2013562 (2006)","journal-title":"ACM TOCL"},{"issue":"1","key":"49_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1119439.1119440","volume":"7","author":"T. Janhunen","year":"2006","unstructured":"Janhunen, T., Niemel\u00e4, I., Seipel, D., Simons, P.: Unfolding Partiality and Disjunctions in Stable Model Semantics. ACM TOCL\u00a07(1), 1\u201337 (2006)","journal-title":"ACM TOCL"},{"issue":"4","key":"49_CR3","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 TOCL\u00a02(4), 526\u2013541 (2001)","journal-title":"ACM TOCL"},{"key":"49_CR4","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":"49_CR5","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.J. Maher","year":"1988","unstructured":"Maher, M.J.: Equivalences of logic programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 627\u2013658. Morgan Kaufmann, San Francisco (1988)"},{"key":"49_CR6","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.: Optimizing Datalog Programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 659\u2013698. Morgan Kaufmann, San Francisco (1988)"},{"key":"49_CR7","series-title":"Lecture Notes in Computer Science","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, vol.\u00a03229, pp. 161\u2013173. Springer, Heidelberg (2004)"},{"key":"49_CR8","unstructured":"Eiter, T., Tompits, H., Woltran, S.: On Solution Correspondences in Answer-Set Programming. In: 19th International Joint Conference on Artificial Intelligence, pp. 97\u2013102 (2005)"},{"key":"49_CR9","first-page":"412","volume-title":"17th European Conference on Artificial Intelligence","author":"E. Oikarinen","year":"2006","unstructured":"Oikarinen, E., Janhunen, T.: Modular Equivalence for Normal Logic Programs. In: 17th European Conference on Artificial Intelligence, pp. 412\u2013416. IOS Press, Amsterdam (2006)"},{"key":"49_CR10","series-title":"Lecture Notes in Computer Science","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, vol.\u00a03229, pp. 174\u2013186. Springer, Heidelberg (2004)"},{"key":"49_CR11","first-page":"170","volume-title":"8th International Conference on Principles of Knowledge Representation and Reasoning","author":"F. Lin","year":"2002","unstructured":"Lin, F.: Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic. In: 8th International Conference on Principles of Knowledge Representation and Reasoning, pp. 170\u2013176. Morgan Kaufmann, San Francisco (2002)"},{"key":"49_CR12","first-page":"695","volume-title":"20th National Conference on Artificial Intelligence","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: 20th National Conference on Artificial Intelligence, pp. 695\u2013700. AAAI Press, Menlo Park (2005)"},{"key":"49_CR13","series-title":"Lecture Notes in Computer Science","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, vol.\u00a04483, pp. 188\u2013200. Springer, Heidelberg (2007)"},{"key":"49_CR14","first-page":"458","volume-title":"22nd National Conference on Artificial Intelligence","author":"J. Oetsch","year":"2007","unstructured":"Oetsch, J., Tompits, H., Woltran, S.: Facts do not Cease to Exist Because They are Ignored: Relativised Uniform Equivalence with Answer-Set Projection. In: 22nd National Conference on Artificial Intelligence, pp. 458\u2013464. AAAI Press, Menlo Park (2007)"},{"key":"49_CR15","unstructured":"Ferraris, P., Lee, J., Lifschitz, V.: A New Perspective on Stable Models. In: 20th International Joint Conference on Artificial Intelligence, pp. 372\u2013379 (2007)"},{"key":"49_CR16","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":"4-5","key":"49_CR17","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":"49_CR18","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/28659.28685","volume-title":"6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems","author":"O. Shmueli","year":"1987","unstructured":"Shmueli, O.: Decidability and Expressiveness Aspects of Logic Queries. In: 6th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 237\u2013249. ACM, New York (1987)"},{"issue":"3","key":"49_CR19","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"},{"key":"49_CR20","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: Complexity Results for Checking Equivalence of Stratified Logic Programs. In: 20th International Joint Conference on Artificial Intelligence, pp. 330\u2013335 (2007)"},{"key":"49_CR21","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","volume":"13","author":"J. McCarthy","year":"1980","unstructured":"McCarthy, J.: Circumscription\u2014A Form of Non-Monotonic Reasoning. Artificial Intelligence\u00a013, 27\u201339 (1980)","journal-title":"Artificial Intelligence"},{"key":"49_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/11562931_16","volume-title":"Logic Programming","author":"H. Tompits","year":"2005","unstructured":"Tompits, H., Woltran, S.: Towards Implementations for Advanced Equivalence Checking in Answer-Set Programming. In: Gabbrielli, M., Gupta, G. (eds.) ICLP 2005. LNCS, vol.\u00a03668, pp. 189\u2013203. Springer, Heidelberg (2005)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89982-2_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T12:25:01Z","timestamp":1551702301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89982-2_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540899815","9783540899822"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89982-2_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}