Partial Deduction of Disjunctive Logic Programs: A Declarative Approach

Chiaki Sakama and Hirohisa Seki

Proceedings of the 4th International Workshop on Logic Program Synthesis and Transformation (LOPSTR'94), Lecture Notes in Computer Science 883, Springer-Verlag, pp. 170-182, 1994.

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.


Full Paper (gzipped postscript 57K)