{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:44:13Z","timestamp":1725522253118},"publisher-location":"Berlin, Heidelberg","reference-count":13,"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_47","type":"book-chapter","created":{"date-parts":[[2008,12,14]],"date-time":"2008-12-14T22:09:15Z","timestamp":1229292555000},"page":"561-575","source":"Crossref","is-referenced-by-count":2,"title":["Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"P\u00fchrer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans","family":"Tompits","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"47_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"C. Baral","year":"2003","unstructured":"Baral, C.: Knowledge Representation, Reasoning and Declarative Problem Solving. Cambridge University Press, Cambridge (2003)"},{"key":"47_CR2","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","key":"47_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 Transactions on Computational Logic\u00a02(4), 526\u2013541 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"47_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)"},{"issue":"2","key":"47_CR5","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":"47_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1007\/978-3-540-89982-2_48","volume-title":"ICLP 2008","author":"M. Truszczy\u0144ski","year":"2008","unstructured":"Truszczy\u0144ski, M., Woltran, S.: Relativized hyperequivalence of logic programs for modular programming. In: de la Banda, M.G., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 576\u2013590. Springer, Heidelberg (2008)"},{"key":"47_CR7","series-title":"Lecture Notes in Computer Science","first-page":"87","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Eiter","year":"2007","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: Simplifying logic programs under uniform and strong equivalence. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS, vol.\u00a04483, pp. 87\u201399. Springer, Heidelberg (2007)"},{"key":"47_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)"},{"issue":"4-5","key":"47_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":"47_CR10","unstructured":"Heyting, A.: Die formalen Regeln der intuitionistischen Logik. Sitzungsberichte, physik.-math. Klasse, preu\u00dfische Akademie der Wissenschaften (1930)"},{"key":"47_CR11","first-page":"65","volume":"69","author":"K. G\u00f6del","year":"1932","unstructured":"G\u00f6del, K.: Zum intuitionistischen Aussagenkalk\u00fcl. Anzeiger Akademie der Wissenschaften in Wien, math.-naturwiss. Klasse\u00a069, 65\u201366 (1932)","journal-title":"Anzeiger Akademie der Wissenschaften in Wien, math.-naturwiss. Klasse"},{"key":"47_CR12","unstructured":"Eiter, T., Tompits, H., Woltran, S.: On solution correspondences in answer set programming. In: Proc. IJCAI 2005, pp. 97\u2013102 (2005)"},{"key":"47_CR13","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)"}],"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_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T05:53:30Z","timestamp":1551678810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89982-2_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540899815","9783540899822"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89982-2_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}