JPS60163132A - Predicate logical program execution device - Google Patents

Abstract

PURPOSE:To decrease the execution time of a predicate logical program by distinguishing a predicate different in character from other predicates and executing the result by other device. CONSTITUTION:Suppose that an inquiry of ''like (Taro, X)'' to a Prolog program in the figure and the 3rd rule in the figure is executed. The 2nd processing unit makes execution of the predicate of ''like (Taro, X)'' at first. Then a predicate ''plant (flower, X)'' is executed and it is detected that a predicate ''plant (flower, X)'' is an external predicate. Then, the next predicate is ''color (X, red)'' and since this is a predicate of an external predicate name, the execution of ''plant (flower, X)'' and ''color (X, red)'' is requested to the 1st processing unit. When this processing unit executes the ''plant (flower, X)'', three results of ''(flower, chrysanthemum)'', ''(flower, tulip)'', ''(flower, morning glory)'' are obtained, and two parameter pairs of ''(flower, tulip)'' and ''(flower, morning glory)'' are obtained as the result of further verification and the result is sent to the 2nd processing unit.

Description

[Detailed description of the invention]

[Technical Field] The present invention relates to a processing device that executes a predicate logic program typified by the Prolog language. [Common technology] In the Prolog language, which is a representative predicate logical language, 61 predicates are called predicate names (quotes).

[・, argument, ..., argument). When it has the form P, Q, R,... as predicates,
The assertion is P. Q. It is 1 in the form R1, which means that the predicates P, Q, and R are faithful. Also, the rule is P knee Q, It. It is written in the form , and when both predicate Q and general are true, it means that predicate P is true. Also, the alignment (comm5Lnd) is knee P, Q, R,. It has the form , and indicates that the predicates P, Q, and R are all direct. Figure 1 shows the first example of a fact and rule program, and 2
Figure 2 shows the adjustment program and output results for the facts, denials, and rules in Figure 1. The program example shown in Figure 1 is a simple one, but what about a more specific application program? It is God. For example, as in the second example shown in FIG. 3, when W5 introduces predicates such as plants and animals, the number of programs increases enormously. At this time, when the rule shown in the chain diagram 3 executes the predicate, a process is performed to search for data that satisfies these conditions from the eyebrows. [Ke: Next technology] This process is executed by a conventional predicate logic program 1
Accommodation (for example, DECSystem-10 Prolog by De Wallen et al. of Nishinburgh University, UK: Pere
iraru, , Pereira, F., and Wa.
rren, D., ``U-set's Guide
to DECSystem-10Prolog”. Dept, AI Re5earch, Edinburgh
gh Univ, 1978) has the disadvantage that it requires a large amount of execution memory and execution time because it is achieved by a unification mechanism. [Object of the Invention] An object of the present invention is to provide a predicate logic program execution device that solves these drawbacks and processes a predicate logic program as shown in FIG. 3 at high speed. [Structure of the Invention] The device of the present invention includes a storage means for storing a predicate logic program consisting of a predicate name and an argument that can distinguish between a first type of predicate name and a second type of predicate name. and a first processing means for processing a predicate of a first type of predicate name supplied and outputting one or more processed seeds at a time, and a first type of predicate name supplied from the storage means. and a predicate having a second type of predicate name, supplying the predicate having the first type of predicate name to the first processing means, and supplying the processing result from the first processing means. and a second processing means for processing the predicate having the second type of predicate name. [Example] Next, an example of the present invention will be described in detail with reference to page 1. FIG. 5 is a block diagram showing one embodiment of the present invention.
The predicate logic program execution device shown in FIG.
(described later) and passes the execution results in sequential format or batch note format, and executes the predicate of the internal predicate name (described later) from the first processing bag N1 that receives the execution result from the first processing bag fil. It is composed of a second processing device 2 that performs the processing, and a storage device 3 that stores the predicate program. In this embodiment, predicates indicating facts that are often talked about as shown in FIG. 3 are stored in the first processing device l. This first processing device 1 executes predicates such as plants (flowers, (For example, Earl Nibstein: Epstein, R.
,,et,al,:the IDM500-Commu
nication l5sues with Back
-end Processors, COMPCON, P
P., 112-114° 1981). Therefore, the predicates stored in the first processing device 1 are distinguished as external predicate names, and the rules shown in FIG. 3 are expressed as rejection rules shown in FIG. 4. That is, in FIG. 4, external predicate names are distinguished by predicate names starting with Y. The first processing device 1 executes a predicate consisting of a predicate name and a plurality of parameters, and performs processing to quickly find a parameter pair that satisfies this predicate. realizable. Unlike the conventional relational algebra @q4 system, if there are several results that satisfy the predicate, control outputs parameter pairs one by one in a sequential format in order to perform execution efficiently. A function is provided to control parameter pairs to be put into a list format, which will be described later, and output in a batch format.゜The second processing device 2 is composed of a normal Pholog program processing device,
Regarding the execution of the external predicate name, the execution result is obtained from the first processing bag w1 in a sequential format or a -talk format, and the predicate of the internal predicate base is executed using it. The storage device 3 stores predicate logic type programs and is composed of a main memory device of eight general-purpose devices. Next, the operation of this embodiment will be explained using a specific example. Assume that the Prolog program shown in Fig. 4 is subjected to make-up knee-like (fat section, ×), and the third rule in Fig. 4 is executed.
Figure 6 shows changes in the data area used to control execution, Figure 7
The figure shows an operation flow diagram corresponding to FIG. First, the second processing device 2 secures a data area for the predicate of its choice (bold section, x) and moves to execution of the predicate on the right side (step 10 in FIGS. 6(a) and 7). Similarly, the data area for executing the predicate f plant (flower, ×) is secured in step 20 of FIGS.
) Detects that the predicate name (flower, ×) is an external predicate name. Next, when we look at the following predicate, it becomes one color (×, red), and similarly, because it is a predicate with an external predicate name, ￥ plant (flower, ×) and γ color (×, red) are combined. The execution request is made to the first processing device 1 including the execution of the predicate. First processing] Device 1 first executes the child plant (flower,
We get three results: Next, we move on to the execution of the Y color (x, red), which is the first result of the lid cover (flower, ×) (flower,
η), and by mapping the variables ×, × is determined to be η, and Y
We will verify whether the colors (chrysanthemum, red) match the facts. As a result of the necessary verification of the Jingeihon Sashisha Makiban, it was found that the requirements were not met. Next, moving on to (flower, tulip), a similar verification is performed, and since (chee-lip, red) exists,
test RIl] is established. Similarly, this is also done for (flower, morning glory), and it is verified that it holds true. As a result, the first
As a result of ``processing equipment'', (flowers, chee-lips) and (
Two parameter pairs (flower, morning glory) are determined and passed to the second processing device 2. The second processing device 2 receives this result from the first processing device 1 and continues processing, but there are two types of responses to the PHolog program's queries: a mode in which only one answer is given, and a mode in which all answers are given. , the execution behavior differs depending on its format. First, we will explain the mode in which only one answer is produced (3).
, and the second processing device 2 creates a data area representing this (step 31 in FIG. 6(C) and FIG. 7). Next, the second processing device 2 uses the first data (flower, chee-lip) to make a tulip correspondence (referred to as Prolog teld unificacon), and finds a tulip as an x. If further results are required, a similar process (flower,
A morning glory) is received from the first processing device, and a morning glory is received as an x. Next, the mode that gives all answers will be explained. In this case, the first processing device 1 receives (flower, tulip) and (flower, morning glory), and the second processing device 2 creates a data area v indicating this (Fig. 6(d) and 7). Step 32 in the figure). Next, the second processing device 2 performs unification using (flower, tulip), places a tulip as ×, performs unification using (flower, morning glory), uses morning glory as ×, and unifies ×. As an answer, I give Chee Lip and Morning Glory. As described above, in this embodiment, the first processing device 1 can execute the predicates with external predicate names such as \Plant and Y color at high speed. However, it can be processed in the same way even if they are not consecutive. A simple example was shown in l'r?K, but for example, the external predicate name corresponds to the data translated by machine drunkenness 1, and the first processing device 1 converts it at high speed. [Effects of the Invention] The present invention has a method for improving a predicate logic program by distinguishing predicates with different characteristics from other predicates and having another predicate execute the predicates at high speed. This has the effect of significantly reducing execution time.

[Brief explanation of drawings]

Figure 1 shows the first set of facts and rules for the Prolog program.
Figure 2 is a diagram showing an example of the timing of the P1'/010g program in the first example, Figure 3 is a diagram showing an example of the 21010g program.
A diagram showing a second example of program facts and rules, Figure 4U
Figure 5 is a block diagram showing an example of the Prolog program used in the example, and Figures 6(a) to 6(d) are Prolog program examples.
A conceptual diagram showing a data area when a program is executed, FIG. 7 is a diagram showing an operation flow corresponding to FIG. 6. 1...First processing device, 2...Second processing device, 3...Storage device. 21st concave 2nd figure 3rd figure 74 figure 6- figure 6 figure (a) (b) (C) Iwao'712!1 1s2.7

Claims (1)

[Scope of Claims] Storage means for storing a predicate diagnosis machine program consisting of predicate names and arguments that can distinguish between a first type of predicate name and a second type of predicate name; a first processing means for processing predicates of a type and outputting one or more processing results at a time; and a second processing means for receiving the result from the first processing means and processing the predicate having the second type of predicate name. Execution device 1゜