Partial deduction of logic programs wrt well-founded semantics

1994 ◽  
Vol 13 (1) ◽  
pp. 45-74 ◽  
Author(s):  
Chandrabose Aravindan ◽  
Phan Minh Dung
Keyword(s):  
Logic Programs ◽  
Partial Deduction

An Abstract Strategy for Transforming Logic Programs 1

1993 ◽  
Vol 18 (2-4) ◽  
pp. 267-286
Author(s):  
Maurizio Proietti ◽  
Alberto Pettorossi
Keyword(s):  
Program Development ◽  
Logic Programs ◽  
Mathematical Functions ◽  
Promotion Strategy ◽  
Transformation Rules ◽  
Program Derivation ◽  
Partial Deduction ◽  
Syntactic Properties

We study the problem of automating some development techniques for logic programs. These techniques are based on the application of semantics preserving transformation rules which are driven by strategies. We propose an abstract strategy which is parametrized by three mathematical functions called definition-folding, selection, and replacement. Once these three functions are supplied, our abstract strategy becomes a concrete one which can be used during program development for driving the application of the Definition, Folding, Unfolding, and Goal Replacement Rules. We show that the definition-folding function can be determined in an automatic way from the description of the syntactic properties of the program we wish to derive. We also show through some examples that many program derivation strategies described in the literature, such as the methodology for eliminating unnecessary variables, the tupling strategy, the partial deduction techniques, and the promotion strategy, can be viewed as particular instances of our abstract strategy.

scholarly journals Speedup of logic programs by binarization and partial deduction

2004 ◽  
Vol 4 (3) ◽  
pp. 355-369
Author(s):  
JAN HRŮZA ◽  
PETER šTĚPÁNEK
Keyword(s):  
Program Transformation ◽  
Logic Program ◽  
Logic Programs ◽  
Binary Logic ◽  
Partial Deduction ◽  
Binary Program ◽  
Binary Programs

Binary logic programs can be obtained from ordinary logic programs by a binarizing transformation. In most cases, binary programs obtained this way are less efficient than the original programs. (Demoen, 1992) showed an interesting example of a logic program whose computational behaviour was improved when it was transformed to a binary program and then specialized by partial deduction. The class of B-stratifiable logic programs is defined. It is shown that for every B-stratifiable logic program, binarization and subsequent partial deduction produce a binary program which does not contain variables for continuations introduced by binarization. Such programs usually have a better computational behaviour than the original ones. Both binarization and partial deduction can be easily automated. A comparison with other related approaches to program transformation is given.

scholarly journals Partial deduction of updateable definite logic programs

1994 ◽  
Vol 18 (1) ◽  
pp. 1-26 ◽  
Author(s):  
K. Benkerimi ◽  
J.C. Shepherdson
Keyword(s):  
Logic Programs ◽  
Partial Deduction

Generalized Disjunctive Well-Founded Semantics for Logic Programs

1990 ◽  
Author(s):  
Chitta Baral ◽  
Jorge Lobo ◽  
Jack Minker
Keyword(s):  
Logic Programs
Sign in / Sign up

Export Citation Format

Share Document