Abstract
This paper presents a partial deduction method for disjunctive logic programs. We first show that standard partial deduction in logic programming is not applicable as it is in the context of disjunctive logic programs. Then we introduce a new partial deduction technique for disjunctive logic programs, and show that it preserves the minimal model semantics of positive disjunctive programs, and the stable model semantics of normal disjunctive programs. Goal-oriented partial deduction is also presented for query optimization.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Brass, S. and Dix, J., A Disjunctive Semantics Based on Unfolding and Bottom-up Evaluation, Proc. 13th World Computer Congress'94, IFIP, GI-Workshop W2, Disjunctive Logic Programming and Disjunctive Databases, 1994.
Gelfond, M. and Lifschitz, V., The Stable Model Semantics for Logic Programming, Proc. Joint Int. Conf. and Symp. on Logic Programming, 1070–1080, 1988.
Gelfond, M. and Lifschitz, V., Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing 9, 365–385, 1991.
Komorowski, J., A Specification of an Abstract Prolog Machine and its Application to Partial Evaluation, Technical Report LSST 69, Linköping Univ., 1981.
Komorowski, J., An Introduction to Partial Deduction, Proc. 3rd Int. Workshop on Meta-programming in Logic, Lecture Notes in Computer Science 649, Springer-Verlag, 49–69, 1992.
Lloyd, J. W. and Shepherdson, J. C., Partial Evaluation in Logic Programming, J. Logic Programming 11, 217–242, 1991.
Minker, J., On Indefinite Data Bases and the Closed World Assumption, Proc. 6th Int. Conf. on Automated Deduction, Lecture Notes in Computer Science 138, Springer-Verlag, 292–308, 1982.
Przymusinski, T. C., Stable Semantics for Disjunctive Programs, New Generation Computing 9, 401–424, 1991.
Seki, H., A Comparative Study of the Well-Founded and the Stable Model Semantics: Transformation's Viewpoint, Proc. Workshop on Logic Programming and Nonmonotonic Logic, Association for Logic Programming and Mathematics Sciences Institute, Cornell University, 115–123, 1990.
Seki, H., Unfold/Fold Transformation of Stratified Programs, Theoretical Computer Science 86, 107–139, 1991.
Seki, H., Unfold/Fold Transformation of General Logic Programs for the WellFounded Semantics, J. Logic Programming 16, 5–23, 1993.
Sestoft, P. and Zamulin, A. V., Annotated Bibliography on Partial Evaluation and Mixed Computation, New Generation Computing 6, 309–354, 1988.
Tamaki, H. and Sato, T., Unfold/Fold transformation of Logic Programs, Proc. 2nd Int. Conf. on Logic Programming, 127–138, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sakama, C., Seki, H. (1994). Partial deduction of disjunctive logic programs: A declarative approach. In: Fribourg, L., Turini, F. (eds) Logic Program Synthesis and Transformation — Meta-Programming in Logic. META LOPSTR 1994 1994. Lecture Notes in Computer Science, vol 883. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58792-6_11
Download citation
DOI: https://doi.org/10.1007/3-540-58792-6_11
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58792-7
Online ISBN: 978-3-540-49104-0
eBook Packages: Springer Book Archive