{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:44:43Z","timestamp":1740123883310,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2017,11,10]],"date-time":"2017-11-10T00:00:00Z","timestamp":1510272000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["Y698"],"award-info":[{"award-number":["Y698"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10472-017-9567-5","type":"journal-article","created":{"date-parts":[[2017,11,10]],"date-time":"2017-11-10T01:50:28Z","timestamp":1510278628000},"page":"277-295","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Equivalence between answer-set programs under (partially) fixed input"],"prefix":"10.1007","volume":"83","author":[{"given":"Bernhard","family":"Bliem","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1594-8972","authenticated-orcid":false,"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,10]]},"reference":[{"issue":"12","key":"9567_CR1","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczy\u0144ski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"issue":"4","key":"9567_CR2","doi-asserted-by":"crossref","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 Trans. Comput. Log. 2(4), 526\u2013541 (2001)","journal-title":"ACM Trans. Comput. Log."},{"issue":"4-5","key":"9567_CR3","first-page":"602","volume":"3","author":"H Turner","year":"2003","unstructured":"Turner, H.: Strong equivalence made easy: nested expressions and weight constraints. Theory Pract. Logic Program. 3(4-5), 602\u2013622 (2003)","journal-title":"Theory Pract. Logic Program."},{"doi-asserted-by":"crossref","unstructured":"Sagiv, Y.: Optimizing datalog programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 659\u2013698. Morgan Kaufmann, Burlington (1988)","key":"9567_CR4","DOI":"10.1016\/B978-0-934613-40-8.50021-X"},{"doi-asserted-by":"crossref","unstructured":"Eiter, T., Fink, M.: Uniform equivalence of logic programs under the stable model semantics. In: Palamidessi, C. (ed.) Proceedings of the 19th International Conference on Logic Programming (ICLP\u201903). number 2916 in LNCS, pp. 224\u2013238. Springer, Berlin (2003)","key":"9567_CR5","DOI":"10.1007\/978-3-540-24599-5_16"},{"issue":"2\u20133","key":"9567_CR6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1017\/S1471068410000542","volume":"11","author":"M Fink","year":"2011","unstructured":"Fink, M.: A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there. Theory Pract. Logic Program. 11(2\u20133), 171\u2013202 (2011)","journal-title":"Theory Pract. Logic Program."},{"doi-asserted-by":"crossref","unstructured":"Inoue, K., Sakama, C.: Equivalence of logic programs under upyears. In: Alferes, J.J., Leite, J.A. (eds.) Proceedings of the 9th European Conference on Logics in Artificial Intelligence, JELIA\u201904, vol. 3229 of LNCS, pp. 174\u2013186. Springer, Berlin (2004)","key":"9567_CR7","DOI":"10.1007\/978-3-540-30227-8_17"},{"doi-asserted-by":"crossref","unstructured":"Woltran, S.: Characterizations for relativized notions of equivalence in answer set programming. In: Alferes, J.J., Leite, J.A. (eds.) Proceedings of the 9th European Conference on Logics in Artificial Intelligence, JELIA\u201904, vol. 3229 of LNCS, pp. 161\u2013173. Springer (2004)","key":"9567_CR8","DOI":"10.1007\/978-3-540-30227-8_16"},{"issue":"3","key":"9567_CR9","doi-asserted-by":"crossref","first-page":"17: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 Trans. Comput. Log 8(3), 17:1\u201317:53 (2007)","journal-title":"ACM Trans. Comput. Log"},{"issue":"2","key":"9567_CR10","first-page":"217","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. TPLP 8(2), 217\u2013234 (2008)","journal-title":"TPLP"},{"issue":"6","key":"9567_CR11","first-page":"781","volume":"9","author":"M Truszczynski","year":"2009","unstructured":"Truszczynski, M., Woltran, S.: Relativized hyperequivalence of logic programs for modular programming. TPLP 9(6), 781\u2013819 (2009)","journal-title":"TPLP"},{"doi-asserted-by":"crossref","unstructured":"Pearce, D., Valverde, A.: Uniform equivalence for equilibrium logic and logic programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR\u201904). vol. 2923 of LNCS, pp. 194\u2013206. Springer, Berlin (2004)","key":"9567_CR12","DOI":"10.1007\/978-3-540-24609-1_18"},{"key":"9567_CR13","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1613\/jair.2810","volume":"35","author":"T Janhunen","year":"2009","unstructured":"Janhunen, T., Oikarinen, E., Tompits, H., Woltran, S.: Modularity aspects of disjunctive stable models. J. Artif. Intell. Res. (JAIR) 35, 813\u2013857 (2009)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"unstructured":"Oikarinen, E., Janhunen, T.: Modular equivalence for normal logic programs. In: Proceedings of the 17th European Conference on Artificial Intelligence (ECAI 2006), pp. 412\u2013416. IOS Press, Amsterdam (2006)","key":"9567_CR14"},{"doi-asserted-by":"crossref","unstructured":"Eiter, T., Fink, M., Tompits, H., Woltran, S.: Simplifying logic programs under uniform and strong equivalence. In: Lifschitz, V., Niemel\u00e4, I. (eds.) Proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR-7). vol. 2923 of LNCS, pp. 87\u201399. Springer, Berlin (2004)","key":"9567_CR15","DOI":"10.1007\/978-3-540-24609-1_10"},{"issue":"1\u20132","key":"9567_CR16","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1080\/11663081.2013.799318","volume":"23","author":"T Eiter","year":"2013","unstructured":"Eiter, T., Fink, M., Pu\u0307hrer, J., Tompits, H., Woltran, S.: Model-based recasting in answer-set programming. J. Appl. Non-Classical Logics 23(1\u20132), 75\u2013104 (2013)","journal-title":"J. Appl. Non-Classical Logics"},{"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: Proceedings of the 20th national conference on artificial intelligence (AAAI\u201905), pp. 695\u2013700. AAAI Press (2005)","key":"9567_CR17"},{"doi-asserted-by":"crossref","unstructured":"Bliem, B., Woltran, S.: Equivalence between answer-set programs under (partially) fixed input. In: Gyssens, M., Simari, G.R. (eds.) Proceedings of the 9th International Symposium on Foundations of Information and Knowledge Systems (FoIKS\u201916). vol. 9616 of LNCS, pp. 95\u2013111. Springer, Berlin (2016)","key":"9567_CR18","DOI":"10.1007\/978-3-319-30024-5_6"},{"issue":"3\u20134","key":"9567_CR19","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1023\/A:1018978005636","volume":"25","author":"V Lifschitz","year":"1999","unstructured":"Lifschitz, V., Tang, L., Turner, H.: Nested expressions in logic programs. Ann. Math. Artif. Intell. 25(3\u20134), 369\u2013389 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"issue":"3","key":"9567_CR20","doi-asserted-by":"crossref","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 Trans. Comput. Log. 7(3), 499\u2013562 (2006)","journal-title":"ACM Trans. Comput. Log."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-017-9567-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-017-9567-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-017-9567-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T19:39:45Z","timestamp":1570304385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-017-9567-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,10]]},"references-count":20,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["9567"],"URL":"https:\/\/doi.org\/10.1007\/s10472-017-9567-5","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"type":"print","value":"1012-2443"},{"type":"electronic","value":"1573-7470"}],"subject":[],"published":{"date-parts":[[2017,11,10]]}}}