Abstract
This paper shows that Tamaki-Sato's unfold/fold transformation of Prolog programs preserves equivalence in a stronger sense that of the usual least Herbrand model semantics, which Tamaki and Sato originally showed. Conventionally, the semantics of Prolog program is defined by the least Herbrand model. However, the least Herbrand model does not always characterize what answer substitutions are returned. This paper proves that any program obtained from an initial program by applying Tamaki-Sato's transformation returns the same answer substitutions as the initial program for any given top-level goal.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
