{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:10:54Z","timestamp":1726409454467},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319300238"},{"type":"electronic","value":"9783319300245"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-30024-5_6","type":"book-chapter","created":{"date-parts":[[2016,3,2]],"date-time":"2016-03-02T22:53:01Z","timestamp":1456959181000},"page":"95-111","source":"Crossref","is-referenced-by-count":0,"title":["Equivalence Between Answer-Set Programs Under (Partially) Fixed Input"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"Bliem","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,4]]},"reference":[{"issue":"12","key":"6_CR1","doi-asserted-by":"publisher","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. Communications of the ACM 54(12), 92\u2013103 (2011)","journal-title":"Communications of the ACM"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science (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. 2923, pp. 87\u201399. Springer, Heidelberg (2003)"},{"key":"6_CR3","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. 2916, pp. 224\u2013238. Springer, Heidelberg (2003)"},{"issue":"1\u20132","key":"6_CR4","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1080\/11663081.2013.799318","volume":"23","author":"T Eiter","year":"2013","unstructured":"Eiter, T., Fink, M., P\u00fchrer, J., Tompits, H., Woltran, S.: Model-based recasting in answer-set programming. J. Appl. Non-Classical Logics 23(1\u20132), 75\u2013104 (2013). \n                      http:\/\/dx.org\/10.1080\/11663081.2013.799318","journal-title":"J. Appl. Non-Classical Logics"},{"key":"6_CR5","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 2005), pp. 695\u2013700. AAAI Press (2005)"},{"issue":"3","key":"6_CR6","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 Trans. Comput. Log. 8(3), 1\u201353 (2007). \n                      http:\/\/doi.acm.org\/10.1145\/1243996.1244000","journal-title":"ACM Trans. Comput. Log."},{"issue":"2\u20133","key":"6_CR7","doi-asserted-by":"publisher","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 Programm. 11(2\u20133), 171\u2013202 (2011)","journal-title":"Theory Pract. Logic Programm."},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science (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. 3229, pp. 174\u2013186. Springer, Heidelberg (2004)"},{"key":"6_CR9","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). \n                      http:\/\/dx.org\/10.1613\/jair.2810","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"issue":"3","key":"6_CR10","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 Trans. Comput. Log. 7(3), 499\u2013562 (2006)","journal-title":"ACM Trans. Comput. Log."},{"issue":"3\u20134","key":"6_CR11","doi-asserted-by":"publisher","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":"4","key":"6_CR12","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 Trans. Comput. Logic 2(4), 526\u2013541 (2001)","journal-title":"ACM Trans. Comput. Logic"},{"key":"6_CR13","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 (2006)"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science (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":"DJ Pearce","year":"2003","unstructured":"Pearce, D.J., Valverde, A.: Uniform equivalence for equilibrium logic and logic programs. In: Lifschitz, V., Niemel\u00e4, I. (eds.) LPNMR 2004. LNCS (LNAI), vol. 2923, pp. 194\u2013206. Springer, Heidelberg (2003)"},{"key":"6_CR15","doi-asserted-by":"crossref","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, USA (1988)"},{"issue":"6","key":"6_CR16","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). \n                      http:\/\/dx.org\/10.1017\/S1471068409990159","journal-title":"TPLP"},{"issue":"4\u20135","key":"6_CR17","first-page":"602","volume":"3","author":"H Turner","year":"2003","unstructured":"Turner, H.: Strong equivalence made easy: nested expressions and weight constraints. Theor. Pract. Logic Program. 3(4\u20135), 602\u2013622 (2003)","journal-title":"Theor. Pract. Logic Program."},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science (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. 3229, pp. 161\u2013173. Springer, Heidelberg (2004)"},{"issue":"2","key":"6_CR19","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). \n                      http:\/\/dx.org\/10.1017\/S1471068407003250","journal-title":"TPLP"}],"container-title":["Lecture Notes in Computer Science","Foundations of Information and Knowledge Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-30024-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T12:46:31Z","timestamp":1559393191000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-30024-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319300238","9783319300245"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-30024-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}