## Partial Deduction of Disjunctive Logic Programs: A Declarative Approach (1994)

### Cached

### Download Links

- [www.sys.wakayama-u.ac.jp]
- [www.sys.wakayama-u.ac.jp]
- DBLP

### Other Repositories/Bibliography

Venue: | In Logic Program Synthesis and Transformation -- Meta Programming in Logic, LNCS 883 |

Citations: | 19 - 1 self |

### BibTeX

@INPROCEEDINGS{Sakama94partialdeduction,

author = {Chiaki Sakama and Hirohisa Seki},

title = {Partial Deduction of Disjunctive Logic Programs: A Declarative Approach},

booktitle = {In Logic Program Synthesis and Transformation -- Meta Programming in Logic, LNCS 883},

year = {1994},

pages = {170--182},

publisher = {Springer}

}

### OpenURL

### 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. 1 Introduction Partial deduction or partial evaluation is known as one of the optimization techniques in logic programming. Given a logic program, partial deduction derives a more specific program through performing deduction on a part of the program, while preserving the meaning of the original program. Such a specialized program is usually more efficient than the original program when executed. Partial deduction in logic programming was firstly introduced by Kom...

### Citations

1550 | The stable model semantics for logic programming - Gelfond, Lifschitz - 1988 |

223 |
Unfold/Fold transformation of logic programs, Proc. 2nd logic programming conference
- Tamaki, Sato
- 1984
(Show Context)
Citation Context ...loyd and Shepherdson [LS91] formalized partial evaluation for normal logic programs and showed its correctness with respect to Clark's program completion semantics. On the other hand, Tamaki and Sato =-=[TS84]-=- showed that partial deduction preserves the least Herbrand model semantics of definite logic programs in the context of unfold/fold transformation. The result is extended by Seki to the perfect model... |

159 | Stable Semantics for Disjunctive Programs
- Przymusinski
- 1991
(Show Context)
Citation Context .... . ; B n g " I = ; g: A normal disjunctive program has no, one, or multiple stable models in general. A program which has no stable model is called incoherent. The disjunctive stable model seman=-=tics [Prz91]-=- of a normal disjunctive programsP is defined as the set of all stable models of P (denoted by ST P ). The disjunctive stable model semantics coincides with Gelfond and Lifschitz's stable model semant... |

147 | Propositional semantics for disjunctive logic programs - Ben-Eliyahu, Dechter - 1994 |

73 |
On Indefinite Data Bases and the Closed World Assumption
- Minker
- 1982
(Show Context)
Citation Context ...minimal model of P if there is no smaller interpretation J satisfying the program. A program is consistent if it has a minimal model, otherwise a program is inconsistents. The minimal model semantics =-=[Min82]-=- of a positive disjunctive program P is defined as the set of all minimal models of P (denoted by MMP ). For a normal disjunctive program P , an interpretation I is called a stable model of P if I coi... |

48 |
Unfold/fold transformation of stratified programs
- Seki
- 1991
(Show Context)
Citation Context ... logic ? In Proceedings of the 4th International Workshop on Logic Program Synthesis and Transformation (LOPSTR'94), Lecture Notes in Computer Science 883, SpringerVerlag, pp. 170-182, 1994. programs =-=[Seki91]-=-, and the well-founded semantics for normal logic programs [Seki93]. Recent studies of logic programming extended its framework to include indefinite information in a program. Disjunctive logic progra... |

47 | Embedding negation as failure into a model generation theorem prover - Inoue, Koshimura, et al. |

45 |
An introduction to partial deduction
- Komorowski
- 1992
(Show Context)
Citation Context ... Partial deduction in logic programming was firstly introduced by Komorowski [Kom81] and has been developed by several researchers from various viewpoints (for an introduction and bibliographies, see =-=[Kom92]-=- and [SZ88], for example). From semantic points of view, Lloyd and Shepherdson [LS91] formalized partial evaluation for normal logic programs and showed its correctness with respect to Clark's program... |

45 | Disjunctive Semantics based upon Partial and Bottom-Up Evaluation - Brass, Dix - 1995 |

43 | An alternative approach to the semantics of disjunctive logic programs and deductive databases. Journal o] Automated Reasoning - Sakama, Inoue - 1994 |

42 | A Transformation System for Deductive Database Modules with Perfect Model Semantics - Maher - 1989 |

36 |
The Stable Model Semantics for Logic
- Gelfond, Lifschitz
- 1988
(Show Context)
Citation Context ...a normal disjunctive programsP is defined as the set of all stable models of P (denoted by ST P ). The disjunctive stable model semantics coincides with Gelfond and Lifschitz's stable model semantics =-=[GL88]-=- in normal logic programs. 3 Partial Deduction of Positive Disjunctive Programs Partial deduction in logic programming is usually defined as unfolding of clauses in a program. 4 For a Horn logic progr... |

35 | Stable Semantics for Disjunctive Programs. New Generation Comput - Przymusinski - 1991 |

33 | Complexity results for disjunctive logic programming and application to nonmonotonic logics - Eiter, Gottlob - 1993 |

31 | SATCHMO: A Theorem Prover Implemented - Manthey, Bry - 1988 |

30 | On positive occurrences of negation as failure - INOUE, SAKAMA - 1994 |

26 |
A Specification of An Abstract Prolog Machine and Its Application to Partial Evaluation
- Komorowski
- 1981
(Show Context)
Citation Context ...ning of the original program. Such a specialized program is usually more efficient than the original program when executed. Partial deduction in logic programming was firstly introduced by Komorowski =-=[Kom81]-=- and has been developed by several researchers from various viewpoints (for an introduction and bibliographies, see [Kom92] and [SZ88], for example). From semantic points of view, Lloyd and Shepherdso... |

23 | A disjunctive semantics based on unfolding and bottom-up evaluation
- Brass, Dix
- 1994
(Show Context)
Citation Context ...Moreover, since positive disjunctive programs are identified with first-order theories, disjunctive partial deduction has potential application to first-order theorem provers. Recently, Brass and Dix =-=[BD94]-=- independently developed a partial deduction technique for disjunctive logic programs which is equivalent to ours. They discuss several abstract properties of disjunctive logic programs and conclude p... |

23 | A Bibliography on Partial Evaluation
- Sestoft, Søndergaard
- 1988
(Show Context)
Citation Context ...uction in logic programming was firstly introduced by Komorowski [Kom81] and has been developed by several researchers from various viewpoints (for an introduction and bibliographies, see [Kom92] and =-=[SZ88]-=-, for example). From semantic points of view, Lloyd and Shepherdson [LS91] formalized partial evaluation for normal logic programs and showed its correctness with respect to Clark's program completion... |

21 |
Unfold/fold transformation of general logic programs for well-founded semantics
- Seki
- 1993
(Show Context)
Citation Context ...Program Synthesis and Transformation (LOPSTR'94), Lecture Notes in Computer Science 883, SpringerVerlag, pp. 170-182, 1994. programs [Seki91], and the well-founded semantics for normal logic programs =-=[Seki93]-=-. Recent studies of logic programming extended its framework to include indefinite information in a program. Disjunctive logic programs are such extensions of logic programming, which possibly include... |

18 | J.Dix: Characterizations of the Stable Semantics by Partial Evaluation - Brass - 1997 |

13 | Annotated Bibliography on Partial Evaluation and Mixed Computation - Sestoft, Zamulin - 1988 |

12 | Relating disjunctive logic programs to default theories - Sakama, Inoue - 1993 |

12 | On the equivalence between disjunctive and abductive logic programs - Sakama, Inoue - 1994 |

7 |
A comparative study of the well-founded and stable model semantics: Trans- formation's viewpoint
- Seki
- 1990
(Show Context)
Citation Context ...rams, normal partial deduction preserves Gelfond and Lifschitz's stable model semantics. Corollary 4.3 Let P be a normal logic program. Then ST P = STsN (P ) . 2 The above result is also presented in =-=[Seki90]-=-. 5 Connections between Normal and Disjunctive Partial Deduction In this section, we consider connections between normal and disjunctive partial deduction. We first give a sufficient condition such th... |

2 | Equivalence-Preserving First Order Unfold/Fold Transformation Systems, Theoretical Computer Science 105:57--84 - Sato - 1992 |

1 | The Effect of Partial Deduction - Sakama, Inoue - 1995 |