JPS61206036A - Predicate logical type language processing system - Google Patents

Abstract

PURPOSE:To call a predicate logical language program in another processor as if the program is the same as the predicate logical language program in the self-processor by inserting the message into the identifying information of the process. CONSTITUTION:A connecting device 14 monitors the message which flows at a local area network (LAN) 1. When the message is the one for a self-processor 10, the interruption is loaded to a program OS 13 to control the communication between networks, and the message is read. When an OS 13 gives a message sending request to the connecting device 14, the connecting device 14 monitors the empty condition of the LAN 1, and at the time of the empty condition, the interruption is loaded to the OS 13, and the message is sent together with the opponent processor identifying information. The connecting device 24 and an OS 23 have the same function.

Description

[Detailed Description of the Invention] [Field of Application of the Invention] The present invention relates to a group of processors that execute a plurality of predicate logic languages connected by a communication line or a network, and particularly relates to a group of processors that execute a plurality of predicate logic languages that are This paper relates to a predicate logical language processing method suitable for utilizing acquired knowledge.

[Background of the invention]

Traditionally, predicate logic languages express relationships between things using predicate names and predicates with O or more arguments, and express one fact or general rule using Horn clauses (hereinafter referred to as clauses) that combine them. In response to formal questions, solutions are sought by repeating substitutions (reductions) while unifying the arguments of the predicate.

For example, the following is a simple example of a program that specifically calculates siblings based on parent-child relationship facts and sibling definition rules.

A1: Parents (Yoshio, Abe).

A2: Parent (Yoshio 1st division).

A3: Brothers (X, Y) knee A4: Parent (Z, X).

A5: II (Z, Y).

A6: Different (X, Y).

Here, X, Y, and Z are variables.

A1 is the fact that Yoshio is the parent of Abe, A2 is the fact that Yoshio is the parent of Shishi, and A3 to A6 are the facts.
is a rule that provides the definition that if different X and Y have the same parent 2, then X and Y are siblings. Here A7: Brothers (Abe, W).

When given the question, first, clauses starting with the predicate name "brother" are searched in order from A1, clause A3 is selected, and X, fat part,
Y and W are unified. That is, the bold part is substituted for X, and Y and W become variables representing the same thing. Continued A
The right side of 3 (to the right of knee) becomes a new question, A1 is selected for A4, and 2 and Yoshio are unified. Since A1 does not have the right side, A1 is selected again for A5 and Y
and the thick part is unified. This also has no right-hand side, so next 86
is executed, but the predicate "different" is a built-in predicate prepared by the system from the beginning, and it is valid only when the two arguments are different, so since both X and Y are thick, this predicate will not hold true. At this time, the last unified content is canceled and another clause is selected (this is called backtracking). In other words, the selection of A1 for A5 is canceled and the primary one, A2, is selected.

Y and the next part are unified. Since A6 holds true, all execution ends, and the next part unified (via Y) for the variable W in the first question A7 has been found as a brother of the thick part. At this point, if there are any other siblings of Abe, the answer is no, but if there is a clause called A8: Parents (Yoshio, Sanbe), by forcibly backtracking, it becomes W. In contrast, the three parts can be found as a solution.

The New Generation Computer Technology Development Institute (ICOT) has an idea to connect multiple processors that execute the above-mentioned predicate logic language to a network such as a LAN (Local Area Network), but from a single processor,
There is no consideration given to executing a predicate logic program in another processor as if it were part of your own program.In general, a program written in a predicate logic language is knowledge data, and multiple processors connected to a network The knowledge data stored in each of the processors (for example, workstations) can be considered to accumulate specialized knowledge that differs from workstation to workstation. In other words, it is clear that if the knowledge data stored in mutualized workstations can be used between workstations, the value of use will be much greater than when the knowledge data is used by only one workstation.

[Purpose of the invention]

An object of the present invention is that when constructing a knowledge information processing system using workstations connected to a network such as a LAN or a communication line, the knowledge data accumulated in each workstation can be transferred to The purpose is to provide a means for using other workstations as if they were in one's own workstation.

[Summary of the invention]

A processor connected to the network of the present invention has a program (hereinafter referred to as O8) that manages communication between networks.
Messages can be sent from the application program to the O8 in other processors via the O8. Further, O5 can start one program as one or more separate processes within its own processor, and can restart or stop a dormant process.

As mentioned above, in a predicate logic program, it is necessary not only to find one solution, but also to find different solutions one after another.To do this, it is necessary to pause execution every time one solution is found and wait for a request for another solution. It becomes necessary to do so. Therefore, we decided to allocate one process for one predicate call, and by putting the process identification information in the message, the predicate logic language program in another processor like the one above can be treated as if it were the predicate logic language program in the own processor. You can also call it in the same way.

[Embodiments of the invention]

An embodiment of the present invention will be described below with reference to FIGS. 1 to 6.

FIG. 1 is a diagram showing an entire system, in which a processor 10 is connected via a LAN 1 connection device 14. As shown in FIG. A secondary storage device 11 is connected to the processor 10,
A predicate logical language program (hereinafter referred to as a program) is stored.

Connecting equipment as well! ! 24 via processor 20. A secondary storage device 21 is connected. The connection device W14 is a LAN
It monitors the message flowing through I, and if it is a message intended for its own processor, it interrupts 0513 to read the message. In addition, 0813 is the connection device 14
When you issue a message sending request to the connected device! 14
monitors the free state of the LANI, and when the LANI becomes free, interrupts 0813 and causes it to send a message along with the partner processor identification information. Connection device 24 and 0823
has similar functionality.

Now, according to the user's request, OS13 creates a new process 12 and uses the secondary storage! From 11.

Assume that a program is loaded into process 12 and starts execution. The program for process 12 is as shown in FIG. It is also assumed that the secondary storage device 21 stores a program as shown in FIG. At this time, if the user asks the processor 10 a question like (6,1) in FIG. 6, (4,1) in the program of process 12 (FIG. 4) is selected, and A are unified, and then the right-hand side becomes a new question. That is, first, the program of process 12 is similarly searched for r (X, Z), and (4, 2) is selected first, but unification of the first argument fails, and then (4, 3) is selected. , (4,4
), the unification was successful with (4,4), and Z and CC
The question is C2: (Z, Y), where rC2:J is a prefix that instructs to search within the program in processor C2. In this case, do not search for P (Z, Y) in program 12,
It requests 0513 to send the message 30 shown in FIG. 2 and pauses. The message 30 includes identification information 31 . Identification information 33 of the own processor 10, identification information 34 of the own process 12, control information 35 instructing to obtain the first solution. Predicate 36 (here P
CCC, Y)'), where the identification information of the partner process is not used when finding the first solution.The message 30 is sent from the oS 13 to the connecting device 14. LANI
.

It is sent to 0823 via the connection device 24.

Since the control information 35 in the message 30 is for finding the first solution, 0823 generates a new process 22 in the processor 20 and stores the secondary storage! ! Load the program in 21 (Fig. 5) and execute the process 22,
Pass the question predicate 36.

Process 22 executes in the same manner as when predicate 36 is input. That is, the program of process 22 (Fig. 5) is searched, (5, 3) is selected, and Y and CCC are searched.
is unified. Process 22 requests oS 23 to send message 4o shown in FIG. The message 4o includes identification information 41 of the other processor 10, identification information 42 of the other process 12, and identification information 43 of the own processor 20.
, identification information 44. of the own process 22. It consists of completion information 45 indicating the execution result and result 46. Completion information 45 indicates that a solution was found (YES) or that a solution was not found (No).
In any of the cases shown in FIGS. 4 to 6, the answer is YES. Further, when the completion information 45 is YES, the process 22 is suspended.

If the answer is NO, the process 22 ends and the result 46 becomes invalid. Message 40 is sent from 0823 to connecting device 2.
4, sent to 0823 via LAN1 and connection device 14. 0823 restarts the process 12 indicated by the process identification information 42 of the sent message 40,
The restarted process 12 passing the message 40 is
If the completion information 46 in the received message 40 is YES, it is understood that the question predicate 36 has been established.

Similarly, from the result 46, unification information for the question predicate 36 is obtained. That is, in the above example, process 12 can know that Y and CCC have been unified.

If backtracking occurs and a different solution for P (Z, Y) is required, the process identification information of the message 40 @
44, instruct the control information 35 to obtain the second and subsequent solutions, set the predicate that is the question at that time to 36, and set the other fields 31, 33, and 34 the same as above. and sends it to the processor 20. 0823, which received this message, restarts the process 22 indicated by the process identification information 32, since the control information 35 in the message 30 is for finding the second and subsequent solutions.
The restarted process 22 passing the message 30 is
Force backtracking, find the next solution, and return the result to process 12 using the means described above. When 0823 attempts to restart process 22, if the process does not exist, 0S23 generates message 40 and returns it to processor 10. At this time, the completion information 45 of message 40 is set to No.

Completion information 45 of message 40 received by process 12
When is No, it can be seen that the question statement 1136 is not satisfied.

〔Effect of the invention〕

According to the present invention, even if a program written in a predicate logical language is distributed among multiple processors connected to a network such as a LAN, one processor can read the program in another processor as if it were connected to its own processor. It can be called as if it were in the system, and it is also possible to correctly obtain another solution when backtracking.

This function enables the decentralization of knowledge information and is an essential function for the construction of advanced knowledge information processing systems.

In the example, one process in each of two processors was described, but the same can be achieved among multiple processes in three or more processors because uniform identification information is given to the processes in each processor. it is obvious. Also, as a method of passing the result, a string representing the predicate is passed.

It is clear that various methods can be considered, such as passing only unification information for variables.

[Brief explanation of drawings]

Fig. 1 is a block diagram of an embodiment of the present invention, Fig. 2 is a block diagram showing the format of a message when calling a program in another processor according to the present invention, and Fig. 3 is a block diagram showing the format of a message when a result is returned. FIG. 4 is an explanatory diagram showing an example of a program on the calling side in the present invention. FIG. 5 is a diagram showing an example of a program on the called side in the present invention. FIG. FIG. 3 is a diagram showing an example of a question. 1...Network, 10.20...Processor,
11.21...Secondary storage device 91, 12.22...Process, 13.23...O8, 14, 24...Network Figure 1 Figure 2 f13 Mouth Figure 4 (4, 1) l (X,'() 2 -?
(X, ri, C2: fO!, 'r') (4
・22 and (ku, aq). H-3)? (b, bb) (4, → ) (Cp cc) Fig. 5
:tcc

Claims (1)

[Claims] 1. A plurality of processors each having a built-in program that executes a predicate logic language can mutually start a program in another processor as a process or start a dormant process by exchanging messages. In a predicate logic type language processing system connected to a network that has a function of resuming execution or stopping a process, a first process in a first processor to a second processor , first processor identification information, first process identification information, a predicate consisting of a predicate name and zero or more arguments, and when the predicate is used as a question goal clause, do you want to find the first solution or the second? Control information indicating whether to obtain subsequent solutions, and if the control information indicates that the second or subsequent solutions are to be obtained, a second
A predicate logic type language processing method, characterized in that a message including identification information of a second process in a processor is sent. 2. In the second processor, find the solution to the question goal clause, and then send the second processor identification information, the second process identification information, and the solution from the second process to the first process. By sending back a message that includes return information indicating whether the solution has been found, the result when the solution has been found, and the first process identification information, the first process can exchange the return information and the result. The predicate logical language processing method according to item 1, which makes it possible to know Gorm clauses.