{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:45Z","timestamp":1761611205742},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439158"},{"type":"electronic","value":"9783540456070"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45607-4_4","type":"book-chapter","created":{"date-parts":[[2007,5,22]],"date-time":"2007-05-22T19:08:20Z","timestamp":1179860900000},"page":"57-75","source":"Crossref","is-referenced-by-count":20,"title":["Equivalence in Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Mauricio","family":"Osorio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan A.","family":"Navarro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Arrazola","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,7,4]]},"reference":[{"issue":"2\u2013-3","key":"4_CR1","first-page":"299","volume":"II","author":"J. Arrazola","year":"1999","unstructured":"J. Arrazola, J. Dix and M. Osorio. Confluent term rewriting systems for nonmonotonic reasoning. Computaci\u00f3n y Sistemas, II(2\u2013-3):299\u2013324, 1999.","journal-title":"Computaci\u00f3n y Sistemas"},{"key":"4_CR2","unstructured":"Y. Babovich, E. Erdem, and V. Lifschitz. Fages\u2019 theorem and answer set programming. In Proceedings of the 8th International Workshop on Non-Monotonic Reasoning, 2000."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"C. Baral and M. Gelfond. Reasoning agents in dynamic domain. In J. Minker, editor, Logic Based Artificial Intelligence, pages 257\u2013279. Kluwer, 2000.","DOI":"10.1007\/978-1-4615-1567-8_12"},{"issue":"3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0743-1066(96)00115-X","volume":"32","author":"S. Brass","year":"1997","unstructured":"S. Brass and J. Dix. Characterizations of the Disjunctive Stable Semantics by Partial Evaluation. Journal of Logic Programming, 32(3):207\u2013228, 1997.","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1005952908693","volume":"20","author":"S. Brass","year":"1998","unstructured":"S. Brass and J. Dix. Characterizations of the Disjunctive Well-founded Semantics: Confluent Calculi and Iterated GCWA. Journal of Automated Reasoning, 20(1):143\u2013165, 1998.","journal-title":"Journal of Automated Reasoning"},{"issue":"5","key":"4_CR6","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1017\/S147106840100103X","volume":"1","author":"S. Brass","year":"2001","unstructured":"S. Brass, J. Dix, B. Freitag and U. Zukowski. Transformation-based bottom-up computation of the well-founded model. Theory and Practice of Logic Programming, 1(5):497\u2013538, 2001.","journal-title":"Theory and Practice of Logic Programming"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Y. Dimopoulos, B. Nebel and J. Koehler. Encoding planning problems in nonmonotonic logic programs. In Proceedings of the Fourth European Conference on Planning, pages 169\u2013181. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63912-8_84"},{"issue":"3","key":"4_CR8","doi-asserted-by":"crossref","first-page":"257","DOI":"10.3233\/FI-1995-2234","volume":"XXII","author":"J. Dix","year":"1995","unstructured":"J. Dix. A Classification-Theory of Semantics of Normal Logic Programs: II. Weak Properties. Fundamenta Informaticae, XXII(3):257\u2013288, 1995.","journal-title":"Fundamenta Informaticae"},{"issue":"2\u20133","key":"4_CR9","first-page":"104","volume":"II","author":"J. Dix","year":"1999","unstructured":"J. Dix, J. Arrazola and M. Osorio. Confluent rewriting systems in non-monotonic reasoning. Computaci\u00f3n y Sistemas, Volume II, No. 2\u20133:104\u2013123, 1999.","journal-title":"Computaci\u00f3n y Sistemas"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0168-0072(00)00044-0","volume":"108","author":"J. Dix","year":"2001","unstructured":"J. Dix, M. Osorio and C. Zepeda. A General Theory of Confluent Rewriting Systems for Logic Programming and its Applications. Annals of Pure and Applied Logic, Volume 108, pages 153\u2013188, 2001.","journal-title":"Annals of Pure and Applied Logic"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"M. Gelfond, M. Balduccini and J. Galloway. Diagnosing Physical Systems in A-Prolog. In T. Eiter, W. Faber and M. Truszczynski, editors, Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning, pages 213\u2013226, Vienna, Austria, 2001.","DOI":"10.1007\/3-540-45402-0_16"},{"key":"4_CR12","unstructured":"M. Gelfond and V. Lifschitz. The Stable Model Semantics for Logic Programming. In R. Kowalski and K. Bowen, editors, 5th Conference on Logic Programming, pages 1070\u20131080. MIT Press, 1988."},{"key":"4_CR13","unstructured":"D. Jongh and A. Hendriks. Characterization of strongly equivalent logic programs in intermediate logics. http:\/\/turing.wins.uva.nl\/lhendrik\/ , 2001."},{"key":"4_CR14","unstructured":"V. Lifschitz. Foundations of logic programming. In Principles of Knowledge Representation, pages 69\u2013127. CSLI Publications, 1996."},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V. Lifschitz","year":"2001","unstructured":"V. Lifschitz, D. Pearce and A. Valverde. Strongly equivalent logic programs. ACM Transactions on Computational Logic, 2:526\u2013541, 2001.","journal-title":"ACM Transactions on Computational Logic"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"J. Lloyd. Foundations of Logic Programming. Springer, Berlin, 1987. 2nd edition.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"4_CR17","unstructured":"M. Osorio, J. Nieves and C. Giannella. Useful transformation in answer set programming. In A. Provetti and T. Son, editors, Answer Set Programming: Towards Efficient and Scalable Knowledge Representation and Reasoning, pages 146\u2013152. AAAI Press, Stanford, USA, 2001."},{"key":"4_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/3-540-46564-2_14","volume-title":"FolKS","author":"M. Osorio","year":"2000","unstructured":"M. Osorio and F. Zacarias. High-level logic programming. In B. Thalheim and K.-D. Schewe, editors, FolKS, LNCS 1762, pages 226\u2013240. Springer Verlag, Berlin, 2000."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"A. Pettorossi and M. Proietti. Transformation of Logic Programs. In D. Gabbay, C. Hogger and J. Robinson, editors, Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 5, pages 697\u2013787. Oxford University Press, 1998.","DOI":"10.1093\/oso\/9780198537922.003.0013"},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0743-1066(97)10001-2","volume":"35","author":"C. Sakama","year":"1998","unstructured":"C. Sakama and K. Inoue. Negation as Failure in the Head. Journal of Logic Programming, 35(1):39\u201378, 1998.","journal-title":"Journal of Logic Programming"},{"key":"4_CR21","unstructured":"P. Simons. Towards constraint satisfaction through logic programs and the stable model semantics. Technical Report 47, Helsinki University of Technology, Digital Systems Laboratory, August 1997."},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1023\/A:1018978005636","volume":"25","author":"L. Tang","year":"1999","unstructured":"L. Tang, V. Lifschitz and H. Turner. Nested expressions in logic programs. Annals of Mathematics and Artificial Intelligence, 25:369\u2013389, 1999.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"4_CR23","unstructured":"P. Taylor, J. Girard and Y. Lafont. Proofs and types. Cambridge University Press, 1989."},{"key":"4_CR24","first-page":"1","volume":"22","author":"H. Zhang","year":"1993","unstructured":"H. Zhang. Sato: A decision procedure for propositional logic. Association for Automated Reasoning Newsletter, 22:1\u20133, March 1993.","journal-title":"Association for Automated Reasoning Newsletter"}],"container-title":["Lecture Notes in Computer Science","Logic Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45607-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T23:12:14Z","timestamp":1683846734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45607-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439158","9783540456070"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45607-4_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}