{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:48:40Z","timestamp":1725536920894},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642042379"},{"type":"electronic","value":"9783642042386"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04238-6_23","type":"book-chapter","created":{"date-parts":[[2009,8,31]],"date-time":"2009-08-31T08:23:01Z","timestamp":1251706981000},"page":"264-276","source":"Crossref","is-referenced-by-count":3,"title":["Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"P\u00fchrer","sequence":"first","affiliation":[]},{"given":"Hans","family":"Tompits","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"23_CR1","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":"23_CR2","unstructured":"Eiter, T., Tompits, H., Woltran, S.: On solution correspondences in answer set programming. In: IJCAI 2005, pp. 97\u2013102 (2005)"},{"key":"23_CR3","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)"},{"key":"23_CR4","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":"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.) LPNMR 2004. LNCS (LNAI), vol.\u00a02923, pp. 87\u201399. Springer, Heidelberg (2004)"},{"key":"23_CR5","first-page":"447","volume-title":"KR 2004","author":"T. Eiter","year":"2004","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: On eliminating disjunctions in stable logic programming. In: KR 2004, pp. 447\u2013458. AAAI Press, Menlo Park (2004)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/978-3-540-89982-2_47","volume-title":"Logic Programming","author":"J. P\u00fchrer","year":"2008","unstructured":"P\u00fchrer, J., Tompits, H., Woltran, S.: Elimination of disjunction and negation in answer-set programs under hyperequivalence. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 561\u2013575. Springer, Heidelberg (2008)"},{"key":"23_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":"23_CR8","unstructured":"Heyting, A.: Die formalen Regeln der intuitionistischen Logik. Sitzungsberichte, physikalisch-mathematische Klasse, preu\u00dfische Akademie der Wissenschaften (1930)"},{"issue":"4-5","key":"23_CR9","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":"23_CR10","first-page":"170","volume-title":"KR 2002","author":"F. Lin","year":"2002","unstructured":"Lin, F.: Reducing strong equivalence of logic programs to entailment in classical propositional logic. In: KR 2002, pp. 170\u2013176. Morgan Kaufmann, San Francisco (2002)"},{"issue":"3","key":"23_CR11","doi-asserted-by":"publisher","first-page":"1","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), 1\u201353 (2007)","journal-title":"ACM Transactions on Computational Logic"},{"issue":"2","key":"23_CR12","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"},{"issue":"5-6","key":"23_CR13","first-page":"717","volume":"8","author":"E. Oikarinen","year":"2008","unstructured":"Oikarinen, E., Janhunen, T.: Achieving compositionality of the stable model semantics for smodels programs. TPLP\u00a08(5-6), 717\u2013761 (2008)","journal-title":"TPLP"},{"key":"23_CR14","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":"23_CR15","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)"}],"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-642-04238-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T16:36:51Z","timestamp":1552149411000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04238-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642042379","9783642042386"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04238-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}