{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T07:26:11Z","timestamp":1748071571825},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2002,6]]},"abstract":"<jats:p> Unfold\/fold transformation systems for logic programs have been extensively investigated. Existing unfold\/fold transformation systems for normal logic programs typically fold using a single, non-recursive clause i.e. the folding transformation is very restricted. In this paper we present a transformation system that permits folding in the presence of recursion, disjunction, as well as negation. We show that the transformations are correct with respect to various model theoretic semantics of normal logic programs including the well-founded model and stable model semantics. <\/jats:p>","DOI":"10.1142\/s0129054102001175","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T11:05:54Z","timestamp":1027767954000},"page":"387-403","source":"Crossref","is-referenced-by-count":14,"title":["BEYOND TAMAKI-SATO STYLE UNFOLD\/FOLD TRANSFORMATIONS FOR NORMAL LOGIC PROGRAMS"],"prefix":"10.1142","volume":"13","author":[{"given":"ABHIK","family":"ROYCHOUDHURY","sequence":"first","affiliation":[{"name":"Department of Computer Science, School of Computing,  National University of Singapore, S16 Level 5, 3 Science Drive 2,  Singapore 117543, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K.","family":"NARAYAN KUMAR","sequence":"additional","affiliation":[{"name":"Chennai Mathematical Institute, 92 G.N. Chetty Road,  Chennai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. R.","family":"RAMAKRISHNAN","sequence":"additional","affiliation":[{"name":"Department of Computer Science, State University  of New York at Stony Brook, Stony Brook, NY 11794, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. V.","family":"RAMAKRISHNAN","sequence":"additional","affiliation":[{"name":"Department of Computer Science, State University  of New York at Stony Brook, Stony Brook, NY 11794, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/6.1.79"},{"key":"p_7","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116838"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90013-J"},{"key":"p_18","first-page":"1785","author":"Roychoudhury A.","year":"2000","journal-title":"LNCS"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1145\/227699.227716"},{"key":"p_21","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90287-P"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054102001175","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:34:37Z","timestamp":1565192077000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054102001175"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":6,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2002,6]]}},"alternative-id":["10.1142\/S0129054102001175"],"URL":"https:\/\/doi.org\/10.1142\/s0129054102001175","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}