S. Etalle and M. Gabbrielli. Transformations of CLP modules. Theor. Comp. Sci., 166:101-146, 1996. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Specialization Technique for Deriving.. - Fioravanti.. (Correct)
....Tamaki Sato [25] Our method increases program eciency by deriving deterministic, specialized programs starting from nondeterministic, general programs. Our specialization method makes use of a set of rules for transforming constraint logic programs which are an extension of the ones presented in [6, 8, 23]. This set includes extensions of the familiar unfolding and folding rules, and an extra rule, called clause splitting, which generalizes the case splitting rule presented in [23] Given a clause H Body and a constraint c, by the clause splitting rule we generate the two clauses: H c Body and ....
....during the construction of P 0 ; Pn ; 2) the head predicate of 1 ; m does not depend on itself in Pn . Then lm(P 0 [ Defs n ; D) lm(Pn ; D) The rules listed above are an extension of the rules for transforming logic programs and constraint logic programs presented in [2, 6, 8, 14, 23, 25]. In particular, the folding rules considered in [2, 6, 8, 25] allow us to fold only one clause at a time, while by using our rule R3 we can fold m ( 1) clauses simultaneously. Our rule R3 is an adaptation to the case of CLP programs of the folding rules considered in [14, 23] Our clause ....
[Article contains additional citation context not shown here]
S. Etalle and M. Gabbrielli. Transformations of CLP modules. Theor. Comp. Sci., 166:101-146, 1996.
Specialization with Clause Splitting for Deriving.. - Fioravanti.. (2002) (Correct)
....during the construction of P0 ; Pn ; or (2) the head predicate of 1 ; m does not depend on itself in Pn . Then lm(P0 [ Defsn ; D) lm(Pn ; D) The rules listed above are an extension of the rules for transforming logic programs and constraint logic programs presented in [2] [6], 7] 12] 19] 21] In particular, the folding rules considered in [2] 6] 7] 21] allow us to fold only one clause at a time, while by using our rule R3 we can fold m ( 1) clauses simultaneously. Our rule R3 is an adaptation to the case of CLP programs of the folding rules considered in ....
....; m does not depend on itself in Pn . Then lm(P0 [ Defsn ; D) lm(Pn ; D) The rules listed above are an extension of the rules for transforming logic programs and constraint logic programs presented in [2] 6] 7] 12] 19] 21] In particular, the folding rules considered in [2] [6], 7] 21] allow us to fold only one clause at a time, while by using our rule R3 we can fold m ( 1) clauses simultaneously. Our rule R3 is an adaptation to the case of CLP programs of the folding rules considered in [12] 19] Our clause splitting rule R7 generalizes to constraint logic ....
S. Etalle and M. Gabbrielli. Transformations of CLP modules. Theor. Comp. Sci., 166:101-146, 1996.
A Transformation System for Modular CLP Programs - Sandro Etalle (1995) (3 citations) Self-citation (Etalle Gabbrielli) (Correct)
....constraints. From a particular case of this correctness result it follows that also the non modular transformation system preserves the computational behavior and the least model (on the relevant algebraic structure) of programs. The proofs of the results are contained in the extended version [7]. 2 Preliminaries: CLP programs and Modules The reader is assumed to be familiar with the terminology and the main results on the semantics of Constraint Logic Programming (CLP for short) Here we introduce some notations that we will use in the sequel. The original paper [10] by Jaffar and ....
....we immediately see that if P c Q then P Q. 3 A transformation system for CLP We are now ready to introduce the transformation system. First, it is important to notice first that all the observable properties of computations we refer to are invariant under . Moreover, it can be proven (see [7]) that the applicability conditions and the result (up to ) of the transformation operations are also invariant under . This implies that we can always replace any clause cl in a program P by a clause cl 0 , provided that cl 0 cl. This operation is often useful to clean up the ....
[Article contains additional citation context not shown here]
S. Etalle and M. Gabbrielli. Transformations of CLP Modules. CWI Technical report, 1995. Available at http://www.cwi.nl/cwi/publications/#AP.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC