Abstract
In this paper, we study the partial deduction of updateable logic programs. Partial deduction is a transformation technique that, given a normal program P and a normal goal G, produces from P a residual program P′ wrt G. An updateable program is a normal program to which an update can be applied. An update is a sequence of additions of clauses to a program and deletions of clauses from a program. We present algorithms that, given a normal program P, a normal goal G, a residual program P′ wrt G, and an update t for P, compute the corresponding update t′ such that t′( P′) is a residual program of t( P) wrt G. Weprove the correctness of these algorithms. We also describe an application of one of the algorithms to updateable knowledge bases.
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.
