{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T04:54:47Z","timestamp":1768452887287,"version":"3.49.0"},"reference-count":48,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":6531,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1016\/0743-1066(94)00104-e","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:44:48Z","timestamp":1027644288000},"page":"201-217","source":"Crossref","is-referenced-by-count":22,"title":["On the correctness of unfold\/fold transformation of normal and extended logic programs"],"prefix":"10.1016","volume":"24","author":[{"given":"Chandrabose","family":"Aravindan","sequence":"first","affiliation":[]},{"given":"Dung","family":"Phan Minh","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(94)00104-E_BIB1","series-title":"Proc. of the Int. Joint Conf. and Symp. on Logic Programming","first-page":"574","article-title":"On Logic Program Semantics with Two Kinds of Negation","author":"Alferes","year":"1992"},{"key":"10.1016\/0743-1066(94)00104-E_BIB2","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"89","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/0743-1066(94)00104-E_BIB3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0743-1066(93)90023-A","article-title":"Basic Transformation Operations which Preserve Computed Answer Substitutions of Logic Programs","volume":"16","author":"Bossi","year":"1993","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(94)00104-E_BIB4","series-title":"Proc. of International Conference on Algebraic and Logic Programming","first-page":"269","article-title":"Preserving Universal Termination through Unfold\/Fold","author":"Bossi","year":"1994"},{"key":"10.1016\/0743-1066(94)00104-E_BIB5","series-title":"Proc. of the Fourth International Workshop on Meta Programming in Logic (Meta '94)","article-title":"More on Unfold\/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics","author":"Bossi","year":"1994"},{"key":"10.1016\/0743-1066(94)00104-E_BIB6","series-title":"ACM Transactions on Programming Languages and Systems","article-title":"Transforming Acyclic Programs","author":"Bossi","year":"1994"},{"key":"10.1016\/0743-1066(94)00104-E_BIB7","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0743-1066(94)90026-4","article-title":"The s-Semantics Approach: Theory and Applications","volume":"19&20","author":"Bossi","year":"1994","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(94)00104-E_BIB8","series-title":"Proc. of Joint Int. Conf. and Symp. on Logic Programming","first-page":"783","article-title":"Normal Logic Programs as Open Positive Programs","author":"Brogi","year":"1992"},{"key":"10.1016\/0743-1066(94)00104-E_BIB9","series-title":"Proc. of the Second Int. Workshop on Logic Programming and Non-Monotonic Reasoning","article-title":"An Assumption-Based Framework for Non-Monotonic Reasoning","author":"Bondarenko","year":"1993"},{"key":"10.1016\/0743-1066(94)00104-E_BIB10","series-title":"Logic and Databases","first-page":"293","article-title":"Negation as Failure","author":"Clark","year":"1978"},{"key":"10.1016\/0743-1066(94)00104-E_BIB11","series-title":"Proc. of IJCAI'77","first-page":"419","article-title":"Pedicate Logic: A Calculus for Deriving Programs","author":"Clark","year":"1977"},{"key":"10.1016\/0743-1066(94)00104-E_BIB12","series-title":"Proc. of the Eighth International Conference on Logic Programming","first-page":"3","article-title":"Negation as Hypotheses: An Abductive Foundation for Logic Programming","author":"Dung","year":"1991"},{"key":"10.1016\/0743-1066(94)00104-E_BIB13","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0304-3975(92)90285-N","article-title":"On the Relations Between Stable and Well-Founded Semantics of Logic Programs","volume":"105","author":"Dung","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0743-1066(94)00104-E_BIB14","series-title":"Proc. of the ICLP'93","article-title":"An Argumentation Semantics of Logic Programming with Explicit Negation","author":"Dung","year":"1993"},{"key":"10.1016\/0743-1066(94)00104-E_BIB15","series-title":"Proc. of IJCAI'93","article-title":"On the Acceptability of Arguments and Its Fundamental Role in Non-Monotonic Reasoning and Logic Programming","author":"Dung","year":"1993"},{"key":"10.1016\/0743-1066(94)00104-E_BIB16","series-title":"Foundations of Software Technology and Theoretical Computer Science","first-page":"78","article-title":"A Natural Semantics for Logic Programs with Negation","author":"Dung","year":"1989"},{"key":"10.1016\/0743-1066(94)00104-E_BIB17","first-page":"604","article-title":"A Fixpoint Approach to Declarative Semantics of Logic Programs","volume":"Vol. 1","author":"Dung","year":"1989"},{"key":"10.1016\/0743-1066(94)00104-E_BIB18","series-title":"Proc. of the First Int. Workshop on Logic Programming and Non-Monotonic Reasoning","first-page":"120","article-title":"Well-Founded Reasoning with Classical Negation","author":"Dung","year":"1991"},{"key":"10.1016\/0743-1066(94)00104-E_BIB19","series-title":"Computational Logic: Essays in Honor of Alan Robinson","first-page":"565","article-title":"Unfold\/Fold Transformations of Logic Programs","author":"Gardner","year":"1991"},{"key":"10.1016\/0743-1066(94)00104-E_BIB20","series-title":"Proc. of the 5th International Conf.\/Symp. on Logic Programming","first-page":"1070","article-title":"The Stable Model Semantics for Logic Programs","author":"Gelfond","year":"1988"},{"key":"10.1016\/0743-1066(94)00104-E_BIB21","series-title":"Proc. of the 7th International Conference on Logic Programming","first-page":"579","article-title":"Logic Programs with Classical Negation","author":"Gelfond","year":"1990"},{"key":"10.1016\/0743-1066(94)00104-E_BIB22","article-title":"Representing Actions in Extended Logic Programming","author":"Gelfond","year":"1992"},{"key":"10.1016\/0743-1066(94)00104-E_BIB23","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1145\/322248.322258","article-title":"Derivation of Logic Programs","volume":"28","author":"Hogger","year":"1981","journal-title":"Journal of the ACM"},{"key":"10.1016\/0743-1066(94)00104-E_BIB24","series-title":"Proc. of the 8th Int. Conf. on Logic Programming","first-page":"490","article-title":"Extended Logic Programs with Default Assumptions","author":"Inoue","year":"1991"},{"key":"10.1016\/0743-1066(94)00104-E_BIB25","series-title":"Proc. of the First Int. Workshop on Logic Programming and Non-Monotonic Reasoning","first-page":"275","article-title":"Negation as Stable Hypotheses","author":"Kakas","year":"1991"},{"key":"10.1016\/0743-1066(94)00104-E_BIB26","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0743-1066(92)90015-U","article-title":"Preferred Extensions are Partial Stable Models","volume":"14","author":"Kakas","year":"1992","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(94)00104-E_BIB27","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0304-3975(90)90065-P","article-title":"Preservation of Stronger Equivalence in Unfold\/Fold Logic Program Transformation","volume":"75","author":"Kawamura","year":"1990","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0743-1066(94)00104-E_BIB28","series-title":"Proc. of the ECAI'90","article-title":"Towards a programming Methodology Founded on Partial Deduction","author":"Komorowski","year":"1990"},{"key":"10.1016\/0743-1066(94)00104-E_BIB29","series-title":"Proc. of the 7th Int. Conf. on Logic Programming","first-page":"598","article-title":"Logic Programs with Exceptions","author":"Kowalski","year":"1990"},{"key":"10.1016\/0743-1066(94)00104-E_BIB30","series-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/0743-1066(94)00104-E_BIB31","article-title":"Correctness of a Logic Program Transformation System","author":"Maher","year":"1987"},{"key":"10.1016\/0743-1066(94)00104-E_BIB32","article-title":"Reasoning about Stable Models (and Other Unstable Semantics)","author":"Maher","year":"1990"},{"key":"10.1016\/0743-1066(94)00104-E_BIB33","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0304-3975(93)90013-J","article-title":"A Transformation System for Deductive Database Modules with Perfect Model Semantics","volume":"110","author":"Maher","year":"1993","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0743-1066(94)00104-E_BIB34","series-title":"European Conf. on AI","first-page":"102","article-title":"Well-Founded Semantics for Logic Programs with Explicit Negation","author":"Pereira","year":"1992"},{"issue":"2, 3, & 4","key":"10.1016\/0743-1066(94)00104-E_BIB35","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0743-1066(93)90032-C","article-title":"Non-Monotonic Reasoning with Logic Programming","volume":"17","author":"Pereira","year":"1993","journal-title":"Journal of Logic Programming (Special Issue on Non-Monotonic Reasoning)"},{"key":"10.1016\/0743-1066(94)00104-E_BIB36","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0743-1066(94)90028-0","article-title":"Transformation of Logic Programs: Foundations and Techniques","volume":"19&20","author":"Pettorossi","year":"1994","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(94)00104-E_BIB37","series-title":"Foundations of Deductive Databases and Logic Programming","first-page":"193","article-title":"On the Declarative Semantics of Deductive Databases and Logic Programs","author":"Przymusinski","year":"1988"},{"key":"10.1016\/0743-1066(94)00104-E_BIB38","series-title":"Proc. of DOOD'91","article-title":"Stationary Semantics for Disjunctive Logic Programs and Deductive Databases","author":"Przymusinski","year":"1991"},{"key":"10.1016\/0743-1066(94)00104-E_BIB39","series-title":"Proc. of PODS'90","first-page":"205","article-title":"Stable Models and Non-Determinism in Logic Programs with Negation","author":"Sacca","year":"1990"},{"key":"10.1016\/0743-1066(94)00104-E_BIB40","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0304-3975(92)90287-P","article-title":"Equivalence-Preserving First-Order Unfold\/Fold Transformation Systems","volume":"105","author":"Sato","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0743-1066(94)00104-E_BIB41","series-title":"Proc. of the Workshop on Logic Programming and Non-Monotonic Logic","first-page":"115","article-title":"A Comparative Study of the Well-Founded and the Stable Model Semantics: Transformation's Viewpoint (Extended Abstract)","author":"Seki","year":"1990"},{"key":"10.1016\/0743-1066(94)00104-E_BIB42","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(91)90007-O","article-title":"Unfold\/Fold Transformation of Stratified Programs","volume":"86","author":"Seki","year":"1991","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/0743-1066(94)00104-E_BIB43","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0743-1066(93)90021-8","article-title":"Unfold\/Fold Transformation of Logic Programs for the Well-Founded Semantics","volume":"16","author":"Seki","year":"1993","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(94)00104-E_BIB44","series-title":"Proc. of the Second International Conference on Logic Programming","first-page":"127","article-title":"Unfold\/Fold Transformation of Logic Programs","author":"Tamaki","year":"1984"},{"key":"10.1016\/0743-1066(94)00104-E_BIB45","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","article-title":"The Well-Founded Semantics for General Logic Programs","volume":"38","author":"Van Gelder","year":"1991","journal-title":"Journal of the ACM"},{"key":"10.1016\/0743-1066(94)00104-E_BIB46","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0743-1066(93)90030-K","article-title":"Common-Sense Axiomatizations for Logic Programs","volume":"17","author":"Van Gelder","year":"1993","journal-title":"Journal of Logic Programming"},{"key":"10.1016\/0743-1066(94)00104-E_BIB47","series-title":"Proc. of the 9th ACM Symposium on Principles of Database Systems","first-page":"172","article-title":"Three-Valued Formalization of Logic Programming: Is it Needed?","author":"You","year":"1990"},{"key":"10.1016\/0743-1066(94)00104-E_BIB48","unstructured":"You, J.-H. and Yuan, L. Y., On the Equivalence of Semantics for Normal Logic Programs, to appear in Journal of Logic Programming."}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669400104E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669400104E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T14:21:31Z","timestamp":1555424491000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074310669400104E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":48,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["074310669400104E"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(94)00104-e","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}