Logic program derivation

Example 4-10 For the compress problem, the pure logic program derived from Logic Algorithm 4-3 is given in Figure 4-3. 

Definition 5-2 Let min and max be two scalars. Let LF(r) be the logic program derived from a logic algorithm LA(r), Let r(t) be an atom where the induction parameter and the auxiliary parameter(s) are ground, and all other parameters are variables. We say that LA r) is min - max deterministic iff there are between min and max ground instances of r(t) for which there exists an SLDNF refutation using LP(r). 

Stage C Derivation of a logic program (and possibly its transformation). 

This chapter is organized as follows. In Section 4.1, we discuss the elaboration of specifications. Section 4.2 is about the design of logic algorithms, whereas Section 4.3 is about their transformation. Section 4.4 describes the derivation of logic programs, whereas Section 4,5 describes their transformation. 

A.-L. Johansson. Using symmetry for the derivation of logic programs. In S.-A. Tamlund (ed), Proc. oflCLP M, pp. 243-251. 

Our first task in applying any of these rigorous tray-to-tray programs is to select logical, yet accurate specifications. This is the hit line of why you must first run a shortcut fractionation method. Why You need and must input accurate specifications such as top and bottom temperatures, heat duties, number of trays, reflux rate, and other such data. These rigorous programs simply will not converge until you input these mandatory and accurate specifications. All of this specification data is derived in the shortcut fractionation method Hdist. 

---