JPS63138428A - Output method for logical variable - Google Patents

Abstract

PURPOSE:To preserve a logical variable name and to realize output of an item including a variable by using a means to store the logical variable names and a means to check the different logical variables of the same name and outputting these logical variables with serial numbers put after the variable names. CONSTITUTION:A node memory part 101 stores the nodes described in a logical language and a processing part 102 interprets the nodes stored in the part 101 with use of a terminal equipment 103 provided in a computer 100. Then, an area is provided to a data structure 200 which expresses a logical variable to hold the name (variable name) given from a user. Thus, the different variables having the same name are checked out of those variables in an output item and then outputted with serial numbers put after the variable names. Otherwise the variable names are outputted. Thus, it is possible to output the variables having different nodes and the same name as the different variables.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to the output function of the fjift logical language, and in particular to a method for outputting logical variables suitable for displaying logical variable names in a preserved form. .

[Conventional technology]

Traditionally, in logical languages such as prolog.

For example, when displaying or printing a logical variable, it is not possible to save the name of the logical variable.

Prolog programming, Japan Combiator Association (
1983), it was displayed or output using the 6 number as described on page 147. For example, if a user p(
When the input term is output as X).

It was output as p(-13'5).

[Problem that the invention seeks to solve]

The above conventional technology does not take into account the fact that the names given by the user to the logical variables are output, so the variable names given by the user to give them meaning are lost, resulting in meaningless names.
-I rarely had the problem of it being displayed.

An object of the present invention is to provide a method for saving names given by the user and outputting logical variables.

[Means for solving problems]

The above purpose is - to create a data structure that represents physical variables.

When you create an area to hold the name given by the user (f number name) and output one term, check whether different variables have the same name among the variables included in that term, and Output with a sequential number after the name,
Everything else is accomplished by printing the variable names.

[Effect]

The area for storing the name of the flight number is for storing the variable name assigned by 5--the. By assigning consecutive numbers to different variables that have the same variable name, variables with the same name in different sections can be output as different variables.

〔Example〕

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

FIG. 1 shows an example of the i-function configuration of the present invention. The clause storage unit 101 is! 11 Memorize clauses written in logical language. The processing unit 102 interprets and executes the clauses stored in the 0 clause storage unit. The clause storage unit 101 and the processing unit 102 are
It is configured within the computer 100 and used using the terminal device 103.

FIG. 2 is an example of a data structure in which a term output as p(X, 5(Y)) is stored in the one-section storage unit 101. Data structure 200 represents the entirety of the above terms. Data 201 expresses that the name of the 0-term functor is p. Data 201 represents that the number of zero-term arguments is two.

From data 200 and data 201, data structure 200
The term expressed by is the name of the functionor p.

Notice that there are two arguments. The data 203 is.

The first argument of this term represents a variable.

゛ The data 204 expresses that the variable name is X. undef is a predetermined symbol and means a variable. data 205 and data 2
06, it can be seen that the second argument of this term is a term in which the name of the functionor is S and there is one argument. From data 207 and data 208, it can be seen that the second argument (there is only one) is a variable and has the variable name Y.

The data structure 300 in FIG. 3 is p (q ta, Y
.

This is an example of a data structure that stores terms output as r (X) ), X). Unlike the example in Figure 2, the same variable appears in two places. From the data 301, this term is
It can be seen that the name of the functionor is p and the arguments are two terms. From the data 302, it can be seen that the first argument of this term is a term whose functionor name is q and whose arguments are three. From the data 303, it can be seen that the first argument of the term that is the first argument is an atom a (a term without an argument). From the data 304, the second argument of the first argument term has the variable name Y
It can be seen that the variables are From the data 305, it can be seen that the @3 argument of the first argument term is a term in which the function name is r and there is one argument. From the data 306, it can be seen that the argument (there is only one) of the term, which is the third argument of this first argument, is a variable with variable name X. Data 302. Data 303゜Data 304. Data 305. data 306
With.

It represents the first argument of this term. Data 307 indicates that the second argument of this term is the same as data 306. 5hare is a predetermined symbol whose value is the same as another value (unified)
Show that. After 5hare, a pointer pointing to the address of the value to be unified with that value is stored. In this case, it points to the start address of data 306.

FIG. 4 shows a data structure representing a state in which the terms shown in FIGS. 2 and 3 are unified. Data structure 400 represents the terms in FIG. 2, and data structure 401 represents the terms in FIG. By data 402.

The first argument of the data structure 4000 item is the data structure 401
It is expressed that it is unified with the first argument of the term. Data 403 expresses that the second argument of the data structure 400 term, the first argument, the third argument, and the first argument of the data structure 401 term are unified. The data 307 unifies the second argument of the term in the data structure 401 and the first argument of the 1%3 argument of the first argument, so the second argument of the data structure 400 and the WI2 argument of the data structure 401 are unified. has been done.

Different variables with the same name exist in unified terms as shown in FIG. That is, data 404 and data 405. When the processing unit 102 outputs a term including different variables having the same name, it adds a serial number after the variable name. If you output the example in Figure 4.

p (q (a, Yl, r (s (Y2J)),
s (Y2)).

According to this embodiment, even when terms that include different logical variables with the same name are unified, the logical variable names can be saved and output, so the user can obtain output results that are easy to read. There is.

〔Effect of the invention〕

According to the present invention, the logical variable names assigned by the user can be saved and terms including the variables can be output, so that the user can obtain output results that are easy to understand.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of a system that realizes the present invention.
2 and 3 are diagrams showing an example of a data structure for storing one term in the clause storage section of FIG. 1. FIG. FIG. 4 is a diagram showing an example of a data structure when the terms in FIG. 2 and the terms in FIG. 3 are unified. 10th

Claims (1)

[Claims] 1. In a logical language processing device having means for storing clauses in a logical language and means for performing language processing using the same, means for storing logical variable names and means for checking different logical variables with the same name. A method for outputting logical variables, which is characterized in that, for different logical variables with the same name, a sequential number is added after the variable name.