Partial Deduction of Disjunctive Logic Programs: A Declarative Approach
نویسندگان
چکیده
This paper presents a partial deduction method for disjunctive logic programs. We rst 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.
منابع مشابه
NORTH- HfRLAND PARTIAL DEDUCTION IN DISJUNCTIVE LOGIC PROGRAMMING
I> This paper presents a partial deduction method in disjunctive logic programming. Partial deduction in normal logic programs is based on unfolding between normal clauses, hence it is not applicable to disjunctive logic programs in general. Then we introduce a new partial deduction technique, called disjunctive partial deduction, which preserves the minimal model semantics of positive disjunct...
متن کاملPartial Deduction in Disjunctive Logic Programming
CHIAKI SAKAMA AND HIROHISA SEKI y. This paper presents a partial deduction method in disjunctive logic programming. Partial deduction in normal logic programs is based on unfolding between normal clauses, hence it is not applicable to disjunctive logic programs in general. Then we introduce a new partial deduction technique, called disjunctive partial deduction, which preserves the minimal mode...
متن کاملCharacterizations of the Stable Semanticsby Partial
There are three most prominent semantics deened for certain subclasses of disjunctive logic programs: GCWA (for positive programs), PERFECT (for stratiied programs) and STABLE (deened for the whole class of all disjunctive programs). While there are various competitors based on 3-valued models, notably WFS and its disjunctive counterparts, there are no other semantics consisting of 2-valued mod...
متن کاملEecient Specialisation in Prolog Using a Hand-written Compiler Generator Eecient Specialisation in Prolog Using a Hand-written Compiler Generator
The so called \cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evaluation of both functional and imperative languages. This paper demonstrates that this approach is also applicable to partial evaluation of logic programming languages, also called partial deduction. Self-application has not been ...
متن کاملEfficient Specialisation in Prolog Using a Hand-Written Compiler Generator
The so called “cogen approach” to program specialisation, writing acompiler generator instead of a specialiser, has been used with consider-able success in partial evaluation of both functional and imperative lan-guages. This paper demonstrates that this approach is also applicableto partial evaluation of logic programming languages, also called partialdeduction. Self-applic...
متن کامل