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}
}
Bookmark
 |
 |
 |
 |
 |
 |
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...
