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.
Work partially supported by CNR Progetto Finalizzato Sistemi Informatici e Calcolo Parallelo under grant n. 92.01606.PF69.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Bossi, M. Gabbrielli, G. Levi, and M.C. Meo. Contributions to the Semantics of Open Logic Programs. In Proceedings Int. Conf. on Fifth Generation Computer Systems. ICOT, Tokyo (J), pages 570–580, 1992.
A. Brogi, E. Lamma, and P. Mello. Open Logic Theories. In L.-H. Eriksson, P. Krueger, and P. Schroeder-Heister, editors, Proceedings of Second Workshop on Extensions of Logic Programming, Lectures Notes in Artificial Intelligence, n. 596, pages 73–88, Springer-Verlag, 1992.
A. Brogi, E. Lamma, and P. Mello. ATMS for Implementing Logic Programming. Proceedings 10th European Conference on Artificial Intelligence, B. Neumann, editor, Vienna, Austria, John Wiley & Sons, pages 114–118, 1992.
M. Bugliesi, E. Lamma, and P. Mello. Partial Deduction for Structured Logic Programming. To appear in Journal of Logic Programming, North- Holland, Special issue on Partial Deduction and Partial Evaluation, J. Komorowski, editor.
G. De Giacomo. Intensional Query Answering: An Application of Partial Evaluation. In Proceedings LOPSTR92, Manchester, UK, July 1992. To appear.
J. de Kleer. An Assumption-based TMS. Artificial Intelligence, 28: 127–162, 1986.
J. Doyle. A Truth Maintenance System. Artificial Intelligence, 12: 231–272, 1979.
H. Gaifman and E. Shapiro. Fully abstract compositional semantics for logic programs. In Proc. sixteenth POPL, pages 134–142, 1989.
A.C. Kim, S.H Lee, S.R. Maeng and J.W. Cho. A New Algorithm for Subsumption Test. In Proceedings Int. Conf on Fifth Generation Computer Systems. ICOT, Tokyo (J), pages 643–649, 1992.
A.C. Kakas and P. Mancarella. On the Relation between Truth Maintenance and Abduction. In Proc. PRICAI, pages 438–443, 1991.
A.C. Kakas, R.A. Kowalski and F. Toni. Ab duct ive Logic Programming. Technical Report, Imperial College, London, UK, 1992.
H. J. Komorowski. A specification of an abstract Prolog machine and its application to Partial Evaluation. Technical Report Dissertation, Linkop-ing University, 1981.
H. J. Komorowski. Towards a Programming Methodology Founded on Partial Deduction. In L. Carlucci Aiello, editor, Proceedings 9th European Conference on Artificial Intelligence, pages 404–409. Pitman Publishing, 1990.
H.J. Kugler, K. Benkerimi and J. Shepherdson. Partial evaluation of dynamic programs. Technical Report CS-90–27, Department of Computer Science, University of Bristol, England, 1990.
E. Lamma, and P. Mello. An Assumption-based Truth Maintenance System dealing with Non-ground Justifications. Proceedings 10th European Conference on Artificial Intelligence, B, Neumann, editor, Vienna, Austria, John Wiley & Sons, pages 119–123, 1992.
J. Lloyd. Foundations of Logic Programming. Second edition. Springer- Verlag, 1987.
J. Lloyd and J. Shepherdson. Partial evaluation in logic programming. Journal of Logic Programming, Vol. 11, No. 3 and. 4, pages 217–242, 1991.
D. Miller. A logical analysis of modules in logic programming. Journal of Logic Programming, 6: 79–108, 1989.
D. Sahlin. The Mixtus Approach to Automatic Partial Evaluation of Full Prolog. In S. Debray and M. Hermenegildo, editors, Proc. NACLP, pages 377–398. The MIT Press, 1990.
A. Takeuchi, and K. Furukawa. Partial Evaluation of Prolog Programs and its Application to Meta Programming. In Proceedings 10th World Computer Congress IFIP86, pages 415–420. North-Holland, 1986.
H. Tamaki, and T. Sato. Unfold/Fold Transformation of Logic Programs. In Proceedings 2nd..Int.I Logic Programming Conference, pages 127–138. Uppsala, 1984.
M.H. van Emden and R.A. Kowalski. The semantics of predicate logic as a programming language. Journal of the ACM, 23 (4): 733–742, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag London
About this chapter
Cite this chapter
Lamma, E., Mello, P. (1993). A Rationalisation of the ATMS in Terms of Partial Evaluation. In: Lau, KK., Clement, T.P. (eds) Logic Program Synthesis and Transformation. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3560-9_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3560-9_9
Publisher Name: Springer, London
Print ISBN: 978-3-540-19806-2
Online ISBN: 978-1-4471-3560-9
eBook Packages: Springer Book Archive