Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Kawamura:1990:PSE,
author = "T. Kawamura and T. Kanamori",
title = "Preservation of stronger equivalence in unfold\slash
fold logic program transformation",
journal = j-THEOR-COMP-SCI,
volume = "75",
number = "1-2",
pages = "139--156",
day = "25",
month = sep,
year = "1990",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C1160 (Combinatorial mathematics); C4210 (Formal
logic); C4240 (Programming and algorithm theory)",
conflocation = "Tokyo, Japan; 28 Nov.-2 Dec. 1988",
conftitle = "International Conference on Fifth Generation Computer
Systems 1988",
corpsource = "Mitsubishi Electr. Corp., Central Res. Lab., Hyogo,
Japan",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "answer substitutions; equivalence classes; formal
logic; initial program; least Herbrand model; logic
programming; programming theory; Prolog programs;
semantics; stronger equivalence; Tamaki--Sato
transformation; top-level goal; unfold/fold logic
program transformation",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}