Abstract
This work relates Assumption-based Truth Maintenance Systems (ATMS) to the transformation of logic programs. The ATMS representation, suitably extended to deal with the non-ground case, can be interpreted as an optimised version of a logic program, comparable to that obtained by applying source-to-source transformation techniques such as partial evaluation. Moreover, the ATMS algorithm can be interpreted as an incremental transformation scheme for logic programs whenever a new clause is added.
Full Text
Published Version
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 call