{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:25:24Z","timestamp":1725686724365},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642307423"},{"type":"electronic","value":"9783642307430"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-30743-0_24","type":"book-chapter","created":{"date-parts":[[2012,6,1]],"date-time":"2012-06-01T23:49:46Z","timestamp":1338594586000},"page":"363-379","source":"Crossref","is-referenced-by-count":3,"title":["Applying Visible Strong Equivalence in Answer-Set Program Transformations"],"prefix":"10.1007","author":[{"given":"Tomi","family":"Janhunen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilkka","family":"Niemel\u00e4","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"12","key":"24_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., Truszczynski, M.: Answer set programming at a glance. Communications of the ACM\u00a054(12), 92\u2013103 (2011)","journal-title":"Communications of the ACM"},{"issue":"1\u20134","key":"24_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/SAT190014","volume":"2","author":"N. E\u00e9n","year":"2006","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Translating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation\u00a02(1\u20134), 1\u201326 (2006)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"24_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.\u00a02916, pp. 224\u2013238. Springer, Heidelberg (2003)"},{"key":"24_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":"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.\u00a02923, pp. 87\u201399. Springer, Heidelberg (2003)"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"Eiter, T., Fink, M., Woltran, S.: Semantical characterizations and complexity of equivalences in answer set programming. ACM Transactions on Computational Logic\u00a08(3) (2007)","DOI":"10.1145\/1243996.1244000"},{"key":"24_CR6","unstructured":"Eiter, T., Tompits, H., Woltran, S.: On solution correspondences in answer-set programming. In: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI 2005, pp. 97\u2013102. Professional Book Center (2005)"},{"issue":"2-3","key":"24_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 and Practice of Logic Programming\u00a011(2-3), 171\u2013202 (2011)","journal-title":"Theory and Practice of Logic Programming"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-642-04238-6_50","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M. Gebser","year":"2009","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: The Conflict-Driven Answer Set Solver clasp: Progress Report. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 509\u2013514. Springer, Heidelberg (2009)"},{"key":"24_CR9","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Proceedings of the 6th International Conference on Logic Programming, ICLP 1988, pp. 1070\u20131080 (1988)"},{"key":"24_CR10","unstructured":"Gelfond, M., Lifschitz, V.: Logic programs with classical negation. In: Proceedings of the 7th International Conference on Logic Programming, ICLP 1990, pp. 579\u2013597 (1990)"},{"key":"24_CR11","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":"1\u20132","key":"24_CR12","doi-asserted-by":"publisher","first-page":"35","DOI":"10.3166\/jancl.16.35-86","volume":"16","author":"T. Janhunen","year":"2006","unstructured":"Janhunen, T.: Some (in)translatability results for normal logic programs and propositional theories. Journal of Applied Non-Classical Logics\u00a016(1\u20132), 35\u201386 (2006)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-20832-4_8","volume-title":"Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning","author":"T. Janhunen","year":"2011","unstructured":"Janhunen, T., Niemel\u00e4, I.: Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses. In: Balduccini, M., Son, T.C. (eds.) Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning. LNCS, vol.\u00a06565, pp. 111\u2013130. Springer, Heidelberg (2011)"},{"issue":"6","key":"24_CR14","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1017\/S1471068407003031","volume":"7","author":"T. Janhunen","year":"2007","unstructured":"Janhunen, T., Oikarinen, E.: Automated verification of weak equivalence within the Smodels system. Theory and Practice of Logic Programming\u00a07(6), 697\u2013744 (2007)","journal-title":"Theory and Practice of Logic Programming"},{"key":"24_CR15","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. Journal of Artificial Intelligence Research\u00a035, 813\u2013857 (2009)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"24_CR16","unstructured":"Lifschitz, V.: Computing circumscription. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence, Los Angeles, California, USA, pp. 121\u2013127. Morgan Kaufmann (August 1985)"},{"key":"24_CR17","unstructured":"Lifschitz, V.: Answer set planning. In: Proceedings of the 16th International Conference on Logic Programming, ICLP 1999, pp. 23\u201337 (1999)"},{"issue":"4","key":"24_CR18","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":"24_CR19","unstructured":"Lifschitz, V., Turner, H.: Splitting a logic program. In: Proceedings of the 11th International Conference on Logic Programming, ICLP 1994, Santa Margherita Ligure, Italy, pp. 23\u201337. MIT Press (1994)"},{"key":"24_CR20","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1613\/jair.2009","volume":"27","author":"L. Liu","year":"2006","unstructured":"Liu, L., Truszczynski, M.: Properties and applications of programs with monotone and convex constraints. Journal of Artificial Intelligence Research\u00a027, 299\u2013334 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/0004-3702(86)90032-9","volume":"28","author":"J. McCarthy","year":"1986","unstructured":"McCarthy, J.: Applications of circumscription to formalizing commonsense knowledge. Artificial Intelligence\u00a028, 89\u2013116 (1986)","journal-title":"Artificial Intelligence"},{"issue":"5-6","key":"24_CR22","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1017\/S147106840800358X","volume":"8","author":"E. Oikarinen","year":"2008","unstructured":"Oikarinen, E., Janhunen, T.: Achieving compositionality of the stable model semantics for smodels programs. Theory and Practice of Logic Programming\u00a08(5-6), 717\u2013761 (2008)","journal-title":"Theory and Practice of Logic Programming"},{"issue":"1-2","key":"24_CR23","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10472-006-9028-z","volume":"47","author":"D. Pearce","year":"2006","unstructured":"Pearce, D.: Equilibrium logic. Annals of Mathematics and Artificial Intelligence\u00a047(1-2), 3\u201341 (2006)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"24_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-642-04238-6_23","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"J. P\u00fchrer","year":"2009","unstructured":"P\u00fchrer, J., Tompits, H.: Casting Away Disjunction and Negation under a Generalisation of Strong Equivalence with Projection. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 264\u2013276. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"24_CR25","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0004-3702(02)00187-X","volume":"138","author":"P. Simons","year":"2002","unstructured":"Simons, P., Niemel\u00e4, I., Soininen, T.: Extending and implementing the stable model semantics. Artificial Intelligence\u00a0138(1-2), 181\u2013234 (2002)","journal-title":"Artificial Intelligence"},{"key":"24_CR26","series-title":"Lecture Notes in Artificial Intelligence","first-page":"81","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"H. Turner","year":"2001","unstructured":"Turner, H.: Strong Equivalence for Logic Programs and Default Theories (Made Easy). In: Eiter, T., Faber, W., Truszczy\u0144ski, M. (eds.) LPNMR 2001. LNCS (LNAI), vol.\u00a02173, pp. 81\u201392. Springer, Heidelberg (2001)"},{"issue":"4-5","key":"24_CR27","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1017\/S1471068403001819","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), 609\u2013622 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"24_CR28","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)"},{"issue":"2","key":"24_CR29","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"}],"container-title":["Lecture Notes in Computer Science","Correct Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30743-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T05:21:39Z","timestamp":1594185699000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30743-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642307423","9783642307430"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30743-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}