Information processing system, data structure, information processing method, program, and non-transitory recording medium

Abstract

To provide an information processing system, a data structure, an information processing method, a program, and a non-transitory recording medium for supporting the creation of a curriculum for education or the like.SOLUTION: In an information processing system, the following steps are performed by at least one processor. An acquisition step A1 acquires a graph network representing the relationships between a plurality of tasks included in a predetermined curriculum. A designation step A3 designates one of the undetermined nodes whose attributes are undetermined or in the initial state as a designated node. A question output step A4 outputs a question for the designated node whose attribute is undetermined or in the initial state. A first setting step A7 sets the attribute state or the like of the designated node corresponding to question information in accordance with a user answer to the output question, thereby making it possible to form a subgraph corresponding to a user individual curriculum.SELECTED DRAWING: Figure 5

Description

[Technical field]

[0001] The present invention relates to an information processing system, a data structure, an information processing method, a program, and a non-transitory recording medium. [Background technology]

[0002] Patent Document 1 discloses an education support system that supports education on the operation of an operation object so that it is effectively performed according to the condition of the subject. The education support system includes a data extraction unit that acquires operation performance data of a personal computer, a first evaluation unit that judges pass / fail for each of predetermined evaluation items based on the operation performance data, a second evaluation unit that judges whether or not the subject needs to retake the joint education based on the pass / fail judgment result of the first evaluation unit, and a curriculum setting unit that sets an individual education curriculum by referring to the evaluation items judged as fail by the first evaluation unit when the second evaluation unit judges that retaking the education is necessary. [Prior art documents] [Patent documents]

[0003] [Patent Document 1] JP 2011-048280 A Summary of the Invention [Problem to be solved by the invention]

[0004] However, there is still room for improvement in the above conventional techniques. [Means for solving the problem]

[0005] According to one aspect of the present invention, an information processing system is provided. The information processing system includes at least one processor capable of executing a program to perform the following steps. In the acquisition step, information on a data structure configured to be expressible by a graph network representing the relationships between a plurality of tasks included in a predetermined curriculum is acquired. The data structure includes a plurality of nodes corresponding to each of the tasks and a plurality of directed edges representing the relationships between the tasks. Each of the plurality of nodes is associated with a first attribute and a second attribute. The first attribute indicates the nature of the task in the curriculum. The second attribute indicates a user's recognition of the task. Here, each of the first attribute and the second attribute is configured to take one of a first state, a second state, and a third state, and the third state indicates that the state of the attribute is undetermined or an initial state. Each of the plurality of directed edges indicates the relationships between the tasks by connecting the plurality of nodes together. In the designation step, one of the undetermined nodes, which is a node including an attribute taking the third state, is designated as a designated node. In the question output step, question information corresponding to an attribute of the specified node that takes a third state is output, and the question information indicates a question about a task corresponding to the specified node and is associated with each of the first attribute and the second attribute. In the first setting step, the state of the attribute of the specified node that corresponds to the question information is set to one of the first state and the second state according to the answer from the user to the output question. In the second setting step, when the state of the specified node is set to the first state, the state of at least one node having a directed path ending at the specified node is set to the first state. When the state of the specified node is set to the second state, the state of at least one node having a directed path starting at the specified node is set to the second state. This makes it possible to form a subgraph corresponding to the individual curriculum of the user when a predetermined termination condition for an undetermined node that can be designated as a specified node is satisfied. The subgraph is composed of a specific node that is a node whose first attribute takes the first state and whose second attribute takes the second state, and a specific directed edge that is a directed edge connecting the specific nodes.

[0006] Such a configuration can provide a better technique. [Brief description of the drawings]

[0007] [Figure 1] 1 is a configuration diagram illustrating an information processing system 1. [Diagram 2] 2 is a block diagram showing a hardware configuration of an information processing device 2. FIG. [Diagram 3] FIG. 2 is a block diagram showing a hardware configuration of a user terminal 3. [Figure 4] 2 is a diagram for explaining a configuration example of a database DB1 and a data structure D1 stored in the database DB1. FIG. [Diagram 5] 2 is an activity diagram showing an example of the flow of information processing executed in the information processing system 1. FIG. [Figure 6] FIG. 2 is a conceptual diagram showing an example of state transition of a data structure D1. [Figure 7] FIG. 13 is a conceptual diagram for explaining an example of a method for extracting a subgraph G4. [Figure 8] FIG. 13 is a diagram showing an example of a question screen 4 which is a screen including question information output in activity A4. [Figure 9] FIG. 13 is a diagram showing an example of a result screen 5 which is a screen for presenting an individual curriculum in activity A12. [Figure 10] FIG. 13 is a diagram showing a conceptual diagram of a graph G5 as another example of the data structure D1. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0008] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, embodiments of the present invention will be described with reference to the drawings. Various characteristic features shown in the following embodiments can be combined with each other.

[0009] Incidentally, the program for realizing the software appearing in this embodiment may be provided as a non-transitory computer-readable recording medium, or may be provided so as to be downloadable from an external server, or may be provided so that the program is started on an external computer and its functions are realized on a client terminal (so-called cloud computing).

[0010] In this embodiment, the term "unit" may include, for example, a combination of hardware resources implemented by a circuit in the broad sense and software information processing that can be specifically realized by these hardware resources. In addition, this embodiment handles various information, which may be represented by, for example, physical values ​​of signal values ​​representing voltage and current, high and low signal values ​​as a binary bit set consisting of 0 or 1, or quantum superposition (so-called quantum bits), and communication and calculation may be performed on a circuit in the broad sense.

[0011] In addition, a circuit in the broad sense is a circuit realized by at least appropriately combining a circuit, circuitry, a processor, and a memory, etc. In other words, it includes an application specific integrated circuit (ASIC), a programmable logic device (e.g., a simple programmable logic device (SPLD), a complex programmable logic device (CPLD), and a field programmable gate array (FPGA)), etc.

[0012] 1. Hardware Configuration This section describes the hardware configuration.

[0013] <Information Processing System 1> FIG. 1 is a configuration diagram showing an information processing system 1. The information processing system 1 includes a database DB1, an information processing device 2, and a user terminal 3. The information processing device 2 and the user terminal 3 are configured to be able to communicate with each other via a telecommunications line. In one embodiment, the information processing system 1 is made up of one or more devices or components. For example, if the information processing system 1 is made up of only the information processing device 2, the information processing system 1 can be the information processing device 2. These components will be described below.

[0014] <Information processing device 2> 2 is a block diagram showing a hardware configuration of the information processing device 2. The information processing device 2 includes a communication unit 21, a storage unit 22, and at least one processor 23, and these components are electrically connected via a communication bus 20 inside the information processing device 2. Each component will be further described.

[0015] The communication unit 21 is preferably a wired communication means such as USB, IEEE1394, Thunderbolt (registered trademark), wired LAN network communication, etc., but may also include wireless LAN network communication, mobile communication such as 3G / LTE / 5G, BLUETOOTH (registered trademark) communication, etc. as necessary. In other words, it is more preferable to implement it as a collection of multiple communication means. In other words, the information processing device 2 may communicate various information from the outside via the communication unit 21 and the network.

[0016] The storage unit 22 stores various information defined by the above description. This can be implemented, for example, as a storage device such as a solid state drive (SSD) that stores various programs and the like related to the information processing device 2 executed by the processor 23, or as a memory such as a random access memory (RAM) that stores temporarily required information (arguments, arrays, etc.) related to the program calculations. The storage unit 22 stores various programs, variables, etc. related to the information processing device 2 executed by the processor 23.

[0017] The processor 23 processes and controls the overall operations related to the information processing device 2. The processor 23 is, for example, a central processing unit (CPU) not shown. The processor 23 realizes various functions related to the information processing device 2 by reading out a predetermined program stored in the storage unit 22. That is, information processing by software stored in the storage unit 22 can be specifically realized by the processor 23, which is an example of hardware, and executed as each functional unit included in the processor 23. The processor 23 is not limited to being single, and may be implemented with multiple processors 23 for each function. Also, a combination of these may be used.

[0018] The processor 23 is configured to be able to acquire information from the user terminal 3, the database DB1, etc. as an acquisition unit. The processor 23 is configured to be able to acquire various pieces of information by reading out various pieces of information stored in a storage area that is at least a part of the memory unit 22, and writing the read out information in a working area that is at least a part of the memory unit 22. The storage area is, for example, an area of ​​the memory unit 22 that is implemented as a storage device such as an SSD. The working area is, for example, an area that is implemented as a memory such as a RAM. Note that acquisition by the processor 23 includes acquiring output results of each functional unit included in the processor 23.

[0019] The processor 23 is configured to be able to display various information as a display processing unit. The information can be presented to the user via the display unit 34 of the user terminal 3 or another device. In such a case, for example, the processor 23 controls the display unit 34 of the user terminal 3 to display visual information such as a screen, an image including a still image or a video, an icon, a message, etc. The processor 23 may generate only rendering information for displaying the visual information on the user terminal 3. The processor 23 may present the output information to the user without going through the user terminal 3 or another device user.

[0020] <User terminal 3> 3 is a block diagram showing a hardware configuration of the user terminal 3. The user terminal 3 includes a communication unit 31, a storage unit 32, a processor 33, a display unit 34, and an input unit 35, and these components are electrically connected via a communication bus 30 inside the user terminal 3. Descriptions of the communication unit 31, the storage unit 32, and the processor 33 are omitted because they are similar to the descriptions of the respective units in the information processing device 2.

[0021] The display unit 34 may be included in the housing of the user terminal 3 or may be externally attached. The display unit 34 displays a screen of a graphical user interface (GUI) that can be operated by the user. This is preferably implemented by using display devices such as a CRT display, a liquid crystal display, an organic EL display, and a plasma display according to the type of the user terminal 3.

[0022] The input unit 35 is configured to be able to accept input from a user. The input unit 35 may be included in the housing of the user terminal 3, or may be externally attached. For example, the input unit 35 may be implemented as a touch panel integrated with the display unit 34. If it is a touch panel, the user can input a tap operation, a swipe operation, or the like. Of course, instead of a touch panel, a switch button, a mouse, a QWERTY keyboard, a voice recognition device, a gesture detection device, a gaze detection device, a biosignal detection device, an imaging device, or the like may be adopted. That is, the input unit 35 accepts an operation input made by a user. In response, the input unit 35 transfers a signal corresponding to the operation input to the processor 33 via the communication bus 30. The processor 33 can execute a predetermined control or calculation as necessary.

[0023] <Database DB1> FIG. 4 is a diagram for explaining a configuration example of the database DB1 and the data structure D1 stored in the database DB1. The data structure D1 is configured so as to be expressible by a graph network that represents the relationships between a plurality of tasks included in a predetermined curriculum. For example, the data structure D1 constructs a knowledge network that includes information about tasks that may be included in an educational program related to programming learning that may be provided to a user, and information about the relationships between the tasks. In this embodiment, the graph network includes a graph that is configured by a directed acyclic graph. With such a configuration, the order relationship of the tasks included in the curriculum can be more accurately expressed. The data stored as the data structure D1 can also be said to be data having a structure according to the data structure D1.

[0024] Specifically, the data structure D1 is composed of a first graph G1, a second graph G2, and a third graph G3. Each of the graphs G1 to G3 includes a plurality of nodes N and a plurality of directed edges E. Each of the nodes N in each of the graphs G1 to G3 corresponds to a plurality of tasks. Each of the directed edges E in each of the graphs G1 to G3 represents the relationship between the tasks by connecting the plurality of nodes N to each other. Each of the nodes N and the directed edges E in the third graph G3 are in one-to-one correspondence with the nodes N and the directed edges E in the first graph G1. Similarly, each of the nodes N and the directed edges E in the third graph G3 are in one-to-one correspondence with the nodes N and the directed edges E in the second graph G2. That is, the first graph G1, the second graph G2, and the third graph G3 are in one-to-one correspondence. Hereinafter, for convenience of explanation, the first graph G1 may be named and expressed as "Need_graph", the second graph G2 as "Known_graph", and the third graph G3 as "All_graph" in the drawings.

[0025] Each of the nodes N in the first graph G1 is associated with a first attribute and a first question information. The first attribute represents the nature of a task in the curriculum.

[0026] The first attribute may include, for example, the necessity of the task in the curriculum, the importance of the task, the priority of the task, and the like. The first attribute is configured to take any one of a first state, a second state, and a third state. The third state indicates that the state of the attribute is undetermined or an initial state. In this embodiment, the first attribute may include an attribute indicating whether the task is required in the curriculum. Therefore, the first attribute of the node N of the first graph G1 being in the first state indicates that the task corresponding to the node N is required in the curriculum. The first attribute of the node N of the first graph G1 being in the second state indicates that the task corresponding to the node N is not required in the curriculum. Hereinafter, for convenience of explanation, a variable indicating the first attribute is referred to as a first variable. The first variable may take any one of "Necessary" corresponding to the first state, "Unnecessary" corresponding to the second state, and "Nil" corresponding to the third state.

[0027] The first question information indicates a question regarding a task corresponding to the node N, and is associated with a first attribute. In other words, the first question information indicates information regarding a question regarding the task corresponding to the node N, based on a viewpoint corresponding to the first attribute. For example, the first question information indicates information regarding a question confirming whether or not the task associated with the node N is necessary in relation to a purpose desired by the user.

[0028] Each of the directed edges E of the first graph G1 indicates, for example, a necessary relationship between tasks corresponding to each node N. The directed edge E of the first graph G1 may indicate, for example, that a task corresponding to a starting node N is a necessary condition for the achievement of a task corresponding to a terminal node N.

[0029] Each of the nodes N of the second graph G2 is associated with a second attribute and second question information. The second attribute represents the user's recognition of the task. The second attribute is configured to take any one of a first state, a second state, and a third state, similar to the first attribute. The second attribute indicates, for example, the user's understanding or proficiency with respect to the task. In this embodiment, the second attribute may include an attribute indicating whether the user has already performed the task. Therefore, the second attribute of a certain node N being in the first state indicates that the user has already achieved the task corresponding to the node N. The second attribute of a certain node N being in the first state indicates that the user has not yet achieved the task corresponding to the node N. With this configuration, it is possible to reduce the waste of the user's man-hours due to unnecessary tasks or tasks that have already been performed being incorporated into the curriculum. Hereinafter, for convenience of explanation, the variable indicating the second attribute is referred to as the second variable. The second variable can take any one of "Known" corresponding to the first state, "Unknown" corresponding to the second state, and "Nil" corresponding to the third state. For convenience of explanation, a node N including an attribute taking the third state is referred to as an undetermined node N3. In this embodiment, a node N in which the first variable is "Nil" in the first graph G1 and a node N in which the second variable is "Nil" in the second graph G2 are each an undetermined node N3.

[0030] The second question information indicates a question regarding the task corresponding to the node N, and is associated with the second attribute. In other words, the second question information indicates information regarding a question regarding the task corresponding to the node N, based on a viewpoint corresponding to the second attribute. For example, the second question information includes information regarding a question asking whether the user is familiar with the task associated with the node N.

[0031] Each of the directed edges E of the second graph G2 indicates, for example, a necessary relationship of the tasks corresponding to each node N, similar to the directed edge E of the first graph G1. The directed edge E of the first graph G1 may indicate, for example, that the task corresponding to the starting node N is a necessary condition for accomplishing the task corresponding to the end node N. In terms of the second attribute, the directed edge E may indicate a dependency relationship that assumes that the user has accomplished the task corresponding to the starting node N if the user has already accomplished the task corresponding to the end node N. In the context of an educational curriculum, the directed edge E indicates that the learning item corresponding to the task corresponding to the starting node N is essential for the learning item corresponding to the end node N.

[0032] The node N of the third graph G3 is configured to be editable, such as by deletion, based on a first attribute of the node N of the first graph G1 and a second attribute of the node N of the second graph G2. The node N of the third graph G3 is associated with one of the nodes N of the first graph G1 and one of the nodes N of the second graph G2, which correspond to the same task. The node N of the third graph G3 may include information regarding the contents of the task. The information may be included in the node N of the first graph G1 or the node N of the second graph G2.

[0033] 2. Information processing In this section, the information processing executed in the above-mentioned information processing system 1 will be described.

[0034] 2.1. Information processing flow 5 is an activity diagram showing an example of the flow of information processing executed in the information processing system 1. The information processing may include any exception processing not shown. Exception processing includes interruption of the information processing and omission of each process. Selection or input performed in the information processing may be based on a user operation or may be performed automatically without relying on a user operation.

[0035] [Activity A1] First, in activity A1, the processor 23 obtains information about the data structure D1. For example, the processor 23 reads the data structure D1 from the database DB1 and defines variables related to the first graph G1, the second graph G2, and the third graph G3.

[0036] [Activity A2] Next, in activity A2, the processor 23 executes an initialization process for the acquired data structure D1. This initializes each variable in the acquired data structure D1, and the first variable and the second variable are set to "Nil." As a result, all nodes N included in the first graph G1 and the second graph G2 are set to undetermined nodes N3.

[0037] [Activity A3] Next, in activity A3, the processor 23 queries one of the undetermined nodes N3. Querying a node N is an example of designating a node N. Hereinafter, for convenience of explanation, the queried node N will be referred to as a designated node QN. In particular, when all nodes N are undetermined nodes N3, the processor 23 may designate the undetermined node N3 corresponding to a question regarding the user's purpose as the designated node QN. In other words, the processor 23 may designate the undetermined node N3 (particularly the first undetermined node N3) based on the question information of the undetermined node N3. With such a configuration, a partial network more suitable for the user's purpose can be constructed.

[0038] [Activity A4] Next, in the activity A4, the processor 23 outputs question information corresponding to the designated node QN. When the undetermined node N3 of the first graph G1 is queried, the processor 23 outputs first question information corresponding to the designated node QN. When the undetermined node N3 of the second graph G2 is queried, the processor 23 outputs second question information corresponding to the designated node QN. In other words, the processor 23 outputs question information corresponding to an attribute of the designated node QN that takes a third state. The question information is presented to the user, for example, through a question screen 4 (see FIG. 8) displayed on the display unit 34. The user inputs an answer to the presented question through the question screen 4. In response to an input from the user, the user terminal 3 generates answer information indicating the answer from the user to the output question, and transmits the answer information to the information processing device 2. In this embodiment, the answer information may include any one of a first command to set the state of the designated node QN to a first state and a second command to set the state of the designated node QN to a second state.

[0039] [Activity A5] Next, in activity A5, the processor 23 acquires the answer information transmitted from the user terminal 3.

[0040] [Activity A6] Next, in activity A6, the processor 23 sets the state of the designated node QN based on the acquired answer information. For example, the processor 23 updates the value of the corresponding variable so that the state of the attribute of the designated node QN becomes the first state when the answer information includes a first command, and so that the state of the attribute of the designated node QN becomes the second state when the answer information includes a second command. In other words, the processor 23 sets the state of the attribute of the designated node QN corresponding to the question information to either the first state or the second state, depending on the answer from the user to the output question.

[0041] [Activity A7] When the state of the specified node QN is set to the first state, in activity A7, the processor 23 sets the states of all nodes N having a directed path ending at the specified node QN to the first state. Hereinafter, for convenience of explanation, a set constituted by nodes N having a directed path ending at the specified node QN may be referred to as an upstream node set. Note that the processor 23 may set, for example, the attribute of a node N included in the upstream node set, in which a directed path from the specified node QN satisfies a predetermined condition (for example, the number of directed edges E, the number of branches, etc.), to the first state. In other words, the processor 23 sets the state of at least one node N among the nodes N having a directed path ending at the specified node QN to the first state. Thereafter, the process proceeds to activity A9.

[0042] [Activity A8] On the other hand, when the state of the specified node QN is set to the second state, in activity A6, the processor 23 sets the states of all nodes N having a directed path starting from the specified node QN to the second state. Hereinafter, for convenience of explanation, a set constituted by nodes N having a directed path starting from the specified node QN may be referred to as a downstream node set. In this embodiment, the processor 23 sets the states of all nodes N included in the downstream node set to the second state. Note that the processor 23 may set, for example, the attributes of nodes N included in the downstream node set, whose directed path from the specified node QN satisfies a predetermined condition (for example, the number of directed edges E, the number of branches, etc.), to the first state. In other words, the processor 23 sets the state of at least one node N among the nodes N having a directed path starting from the specified node QN to the second state. Thereafter, the process proceeds to activity A9.

[0043] Here, the state transition of the data structure D1 due to the processing of the activities A6, A7, and A8 will be described. FIG. 6 is a conceptual diagram showing an example of the state transition of the data structure D1. Here, the state transition of the first graph G1 and the second graph G2 are similar, so the state transition of the data structure D1 will be described with a focus on the state transition of the first graph G1. Note that the first graph G1 and the second graph G2 before the state transition are in an initial state in which each node N is set to an undetermined node N3. In addition, in FIG. 6, the node N marked with "T" indicates the first node N1, which is a node N that takes the first state, the node N marked with "F" indicates the second node N2, which is a node N that takes the second state, and the blank node N indicates the undetermined node N3.

[0044] The processor 23 designates one of the undetermined nodes N3 as a designated node QN, and changes the first variable of the designated node QN from "Nil" to another value based on the answer from the user. As a result, the state of the first graph G1 transitions to either G1a or G1b. Specifically, when the first variable of the designated node QN is set to "Necessary", the first variables of the three undetermined nodes N3 included in the upstream node set of the designated node QN are set to "Necessary". As a result, a total of four undetermined nodes N3 transition to the first node N1, and the state of the first graph G1 reaches G1a. On the other hand, when the first variable of the designated node QN is set to "Unnecessary", the first variables of the two undetermined nodes N3 included in the downstream node set of the designated node QN are set to "Unnecessary". As a result, a total of three undetermined nodes N3 transition to the second node N2, and the state of the second graph G2 reaches G1b. In this way, the number of undetermined nodes N3 is reduced by the processing of activities A6 to A8, and an individual curriculum is designed from the data structure D1 based on the user's response information.

[0045] [Activity A9] After the processing of activity A7 or activity A8, in activity A9, the processor 23 calculates the score of each of the undetermined nodes N3 included in the latest data structure D1. For example, the score is configured to be larger as the number of undetermined nodes N3 that is reduced when the state of the undetermined node N3 is set to the first state or when the state is set to the second state increases. The score is also configured to be larger as the weighted average (e.g., expected value) of the number of undetermined nodes N3 reduced when the state of the undetermined node N3 is set to the first state and the number of undetermined nodes N3 reduced when the state of the undetermined node N3 is set to the second state increases. In this embodiment, the score can be set based on the number of nodes N whose state changes due to the processing of activity A7 and activity A8 (e.g., the number of elements in the upstream node set or the downstream node set) and the change in the number of undetermined nodes N3 that can be designated (in other words, the number of candidates for the designated node QN) due to the processing of activity A7 and activity A8. With such a configuration, it is possible to preferentially designate the undetermined nodes N3 that can more efficiently reduce the number of undetermined nodes N3 that can be designated. Thereafter, the processor 23 determines whether a predetermined termination condition for the undetermined node N3 that can be designated as the designated node QN is satisfied. The termination condition is a condition for determining whether to extract a subgraph G4 described later, and may include, for example, that the maximum score is equal to or less than a predetermined value. In this embodiment, the termination condition is configured to be satisfied when the maximum score is zero, that is, when there is no candidate for the designated node QN.

[0046] [Activity A10] If it is determined that the termination condition is not satisfied, the process proceeds to activity A10, and the processor 23 designates one of the undetermined nodes N3 as a designated node QN based on the score of each of the undetermined nodes N3 calculated in activity A9. At this time, it is preferable that the processor 23 does not designate, as a designated node QN, an undetermined node N3 corresponding to a node N whose first attribute is in the second state or whose second attribute is in the first state, among the undetermined nodes N3. With this configuration, even if one of the task property and the user property remains in an undetermined state, the range of undetermined nodes N3 to be designated can be narrowed efficiently based on the property of the other, so that the calculation time when extracting a curriculum suitable for the user can be further reduced. For example, when the second variable of a node N in the second graph G2 corresponding to the same task as an undetermined node N3 in the first graph G1 is set to "Known" or when the first variable of a node N in the first graph G1 corresponding to the same task as an undetermined node N3 in the second graph G2 is set to "Unnecessary", the processor 23 does not designate the corresponding undetermined node N3 as a designated node QN. In other words, the processor 23 excludes such an undetermined node N3 from candidates for the designated node QN. This can reduce the wasteful man-hours of checking whether a task that is found to be unnecessary for the curriculum is known by the user. After the processing of activity A10, the processor 23 outputs question information corresponding to a new designated node QN again in activity A4.

[0047] [Activity A11] On the other hand, if it is determined that the termination condition is satisfied, the designated node QN of the undetermined node N3 is terminated, and the process proceeds to activity A11. In this manner, the designation of the designated node QN and the update of the state of the undetermined node N3 are repeated until the termination condition is satisfied. As a result, when the termination condition is satisfied, a subgraph G4 corresponding to the individual curriculum of the user is formed. The subgraph G4 is composed of a specific node N4, which is a node N whose first attribute takes a first state and whose second attribute takes a second state, and a specific directed edge E1, which is a directed edge E connecting the specific nodes N4. With this configuration, when presenting an appropriate curriculum according to the user's purpose and level of understanding from among the tasks included in the data structure D1, both the nature of the task and the nature of the user can be taken into consideration.

[0048] In the activity A11, the processor 23 extracts a subgraph G4 from the third graph G3 based on the first attribute of each node N in the first graph G1 and the second attribute of each node N in the second graph G2. FIG. 7 is a conceptual diagram for explaining an example of a method for extracting the subgraph G4. All the nodes N in the first graph G1 and the second graph G2 are set to the first node N1 or the second node N2. At this time, the processor 23 reflects the state of the node N in the first graph G1 and the node N in the second graph G2 corresponding to the same task as the node N, for each node N in the third graph G3. As a result, the node N in the third graph G3 is associated with any one of the states of (first variable, second variable)=(Necessary, Known), (Necessary, Unknown), (Unnecessary, Known), and (Unnecessary, Unknown). Among these, the node N associated with (Necessary, Unknown) is the specific node N4. Here, the specific node N4 indicates a task that is essential in the curriculum and is unachieved by the user (for example, a task that the user has not learned). Hereinafter, for convenience of explanation, among the nodes N of the third graph G3, the nodes N other than the specific node N4 may be referred to as excluded nodes N5. Note that the node N of the third graph G3 may also be associated with (first variable, second variable)=(Unnecessary, Nil) or (Nil, Known) other than the above states.

[0049] The processor 23 identifies a specific node N4 and a specific directed edge E1, which is a directed edge E connecting the specific nodes N4, from the third graph G3 reflecting the states of the first graph G1 and the second graph G2 in this way. For ease of explanation, hereinafter, among the directed edges E included in the third graph G3, a directed edge E other than the specific directed edge E1 may be referred to as an excluded edge E2. The excluded edge E2 is a directed edge E that starts or ends at the excluded node N5.

[0050] Then, the processor 23 removes the excluded node N5 and the excluded edge E2 from the third graph G3 included in the read data structure D1, and generates a subgraph consisting of the specific node N4 and the specific directed edge E1. In this way, the processor 23 edits the third graph G3 included in the read data structure D1 into a subgraph G4 corresponding to the individual curriculum to be presented to the user. Note that the data structure D1 as the master data stored in the database DB1 is not edited.

[0051] [Activity A12] 5, after the processing of activity A11, in activity A12, processor 23 presents to the user an individual curriculum of the user shown by subgraph G4 via display unit 34. In other words, when the number of undetermined nodes N3 that can be designated as a designated node QN satisfies a termination condition, processor 23 causes a curriculum including a task corresponding to a specific node N4 included in subgraph G4 and an order of accomplishing the task to be presented to the user. With such a configuration, a curriculum suitable for the user can be presented.

[0052] 2.2. Example of a screen for information processing Next, an example of a screen output to the user in this information processing will be described. Fig. 8 is a diagram showing an example of a question screen 4, which is a screen including question information output in activity A4. The question screen 4 includes a question area 41, an answer area 42, and an auxiliary area 43.

[0053] The question area 41 is an area for presenting question information corresponding to a specified node QN to a user as a question sentence (for example, "Have you acquired a skill called XX?"). It is preferable that the question sentence is a question that can be answered by a choice (particularly, a two-choice question).

[0054] The answer area 42 is an interface that allows input of an answer to a question presented in the question area 41. The answer area 42 in this embodiment is configured to selectively allow two-choice answers to be given to a question. When one of the choices (e.g., "YES") is selected, the processor 23 generates answer information including a first command, and when the other of the choices (e.g., "NO") is selected, the processor 23 generates an answer including a second command. In other words, the processor 23 may output question information that is configured by a multiple-choice question. The multiple-choice question is configured to be answerable by a choice that represents an answer corresponding to a first state and a choice that represents an answer corresponding to a second state. With this configuration, it is possible to improve the interpretability of the subgraph G4 (in other words, the individual curriculum) while reducing the answering burden on the user.

[0055] In the auxiliary area 43, auxiliary information that further assists in understanding the content or intent of the question is displayed. The auxiliary area 43 may include, for example, a term included in the question sentence in the question area 41 and a sentence indicating the meaning of the term. In this embodiment, the question screen 4 is configured so that the answer area 42 and the auxiliary area 43 can be viewed at a glance. In other words, the processor 23 outputs the question screen 4 as visual information that can view the answer area in which an answer to a question can be input and auxiliary information that further assists in understanding the content or intent of the question. With this configuration, the accuracy of the answer to the question by the user can be improved. Note that the question screen 4 may be further configured so that the question area 41 can be viewed at a glance with the answer area 42 or the auxiliary area 43.

[0056] 9 is a diagram showing an example of a result screen 5 which is a screen for presenting an individual curriculum in the activity A 12. The result screen 5 includes a curriculum presentation area 51 and a curriculum information area 52.

[0057] In the curriculum presentation area 51, tasks (tasks 1 to 5) corresponding to a specific node N4 of the extracted subgraph G4 and the order of the tasks corresponding to a specific directed edge E1 are visually displayed. The order of the tasks is expressed, for example, by using an arrow-shaped object between objects corresponding to the tasks. In the curriculum presentation area 51, a plurality of parallel curricula (tasks 1 to 3 and tasks 4 and 5) may be displayed in parallel. In this case, the tasks displayed in parallel are configured to be able to proceed in random order or in parallel. In other words, when there are a plurality of independent subgraphs G4, the processor 23 may present each of the subgraphs G4 in parallel as information on tasks that are not in order. This makes it possible to present a more efficient task progress plan to the user.

[0058] In curriculum information area 52, information about the contents of the tasks displayed in curriculum presentation area 51 is displayed. Curriculum presentation area 51 and curriculum information area 52 are configured to be viewable in result screen 5. This can improve the visibility of the curriculum for the user.

[0059] 3.Other The information processing system 1 and the like may adopt the following aspects.

[0060] The data structure D1 as master data stored in the database DB1 is not limited to being defined by a plurality of graphs such as the first graph G1, the second graph G2, and the third graph G3. For example, the data structure D1 may be a data structure D2 defined by a single graph G5. FIG. 10 is a diagram showing a conceptual diagram of a graph G5 as another example of the data structure D1. The graph G5 includes a plurality of nodes N and a plurality of directed edges E, similar to the first graph G1 and the like. Here, each of the nodes N of the graph G5 is associated with a first attribute associated with the node N of the first graph G1, a second attribute associated with the node N of the second graph G2, question information associated with each attribute (in other words, the first question information and the second question information), and the contents of the task. In other words, the graph G5 is a graph that integrates the first graph G1, the second graph G2, and the third graph G3. The processor 23 may acquire a data structure D2 including a graph G5 from the database DB1 in the activity A1, and generate the first graph G1, the second graph G2, and the third graph G3 based on the graph G5. The processor 23 may also directly set the state of each attribute of the acquired graph G5 without going through the first graph G1, etc., and directly edit the graph G5.

[0061] To summarize the above, based on the above data structures D1, D2, etc., for example, the following data structure can be conceived. The data structure is configured to be expressible by a graph network representing the relationships between a plurality of tasks included in a predetermined curriculum, and includes a plurality of nodes N corresponding to each of the tasks and a plurality of directed edges E representing the relationships between the tasks. Each of the plurality of nodes N is associated with a first attribute, a second attribute, and question information associated with each of the first attribute and the second attribute. The first attribute represents the nature of the task in the curriculum. The second attribute represents the user's recognition of the task. Here, each of the first attribute and the second attribute is configured to take any one of a first state, a second state, and a third state, and the third state indicates that the state of the attribute is undetermined or an initial state. The question information represents information regarding a question for the user regarding the task corresponding to the node N.

[0062] Moreover, the data structure can cause at least one computer, such as the information processing device 2 and the user terminal 3, to execute the above-mentioned information processing. That is, the data structure D1 is configured to cause at least one computer to execute each of the following steps. In the designation step, one of the undetermined nodes N3, which is a node N including an attribute taking a third state, is designated as a designated node QN. In the question output step, question information corresponding to the attribute taking the third state among the attributes of the designated node QN is output. In the first setting step, the state of the attribute of the designated node QN corresponding to the question information is set to one of the first state and the second state according to the answer from the user to the output question. In the second setting step, when the state of the attribute corresponding to the question information is set to the first state, the state of the attribute corresponding to the question information among the attributes of the node N having a directed path ending at the designated node QN is set to the first state. In the second setting step, when the state of the attribute corresponding to the question information is set to the second state, the state of the attribute corresponding to the question information among the attributes of the node N having a directed path starting from the designated node QN is set to the second state. In the extraction step, when a predetermined termination condition for an undetermined node N3 that can be designated as a designated node QN is satisfied, an individual curriculum for the user is extracted from the graph network based on a subgraph G4 that is composed of a specific node N4 that is a node N whose first attribute takes a first state and whose second attribute takes a second state, and a specific directed edge E1 that is a directed edge E connecting the specific nodes N4. With this configuration, when presenting an appropriate curriculum according to the user's purpose and level of understanding from among the tasks included in the data structures D1 and D2, both the nature of the task and the nature of the user can be taken into consideration.

[0063] The third state is arbitrary as long as it can be distinguished from the first state and the second state set based on the answer information in the activities A7 and A8. For example, the third state may be the first state or the second state set by the initialization process. In this case, the processor 23 may distinguish the first state or the second state set by the initialization process from the first state or the second state set based on the answer information based on a management variable indicating that the state was set by the initialization process. In such a case, the first state or the second state set by the initialization process is an example of the third state. In other words, the third state is a state different from the first state and the second state set based on the answer information.

[0064] The processor 23 may not set the states of all the nodes N to the third state by the initialization process. For example, the processor 23 may set some of the nodes N to a predetermined first state or second state by the initialization process, and set the states of the other nodes N to the third state. In other words, the initial states of all the nodes N included in the data structures D1 and D2 may not be the undetermined nodes N3. For example, when the processor 23 newly outputs an individual curriculum for a user, the processor 23 may set the second attribute of the task corresponding to the node N, for example, as the initial state based on a past answer by the user. Specifically, the processor 23 may acquire answer information from the user indicating that a certain task has been accomplished in the past, and when the second variable corresponding to the task is set to "Known" corresponding to the first state, the processor 23 may set the initial state of the node N corresponding to the task to a state different from the third state and the same as the state previously set (here, "Known" which is the first state). This can save the user the trouble of answering.

[0065] The number of attributes associated with the node N is not limited to two, and may be three or more. In this case, the processor 23 may separately construct a new graph G corresponding to the third attribute. The data structure D1 may further include a graph G corresponding to the third attribute. The specific node N4 may further be set based on the third attribute.

[0066] In the activity A10, the processor 23 may query one of the undetermined nodes N3 as the designated node QN regardless of the score. For example, the processor 23 may randomly query one of the undetermined nodes N3 as the designated node QN.

[0067] The graph network is not limited to an acyclic graph and may have any structure. For example, the graph network may partially have a cyclic graph. In this case, the processor 23 may be configured not to update the state when an undetermined node N3 included in the cyclic graph is designated as a designated node QN and the state to be changed includes a node that is not the third state. The processor 23 may also treat the nodes N constituting the cyclic graph as one node N. This allows each node N constituting the cyclic graph to be treated equally.

[0068] The input method of the answer information is not limited to a multiple-choice format, and may be a free-description format in which the user can answer by inputting any character string. In this case, the processor 23 may perform a predetermined natural language processing on the character string to perform a morphological element analysis, and then input the analyzed character string to a trained model that can function as a pre-trained classifier. The trained model can be generated by machine learning based on teacher data that is composed of data including question information including a predetermined question sentence, a character string related to a natural language that expresses an answer to the question sentence, and information on a first command or a second command that is specified as an output. The trained model generated in this way can output a first command or a second command based on input data including question information including a predetermined question sentence and a character string related to a natural language that expresses an answer to the question sentence. The trained model can be stored in, for example, the database DB1, the storage unit 22, etc.

[0069] This information processing may include only the processing that causes the state transition of each graph included in the data structure D1. For example, the processing related to the output of the question screen 4, the result screen 5, etc. does not need to be included in this information processing. If the processing related to the output is performed, the processing may be performed as a separate information processing independent of the processing related to the state transition.

[0070] The output destination of information or data (hereinafter referred to as "information, etc.") may be another device, a display, a memory unit (including a built-in memory unit and an external memory unit), etc. Acquisition of information, etc. includes acquiring information, etc. generated by the device itself, in addition to acquiring information, etc. transmitted from another device. The table in which parameters are associated is not limited to the table shown in the figure, and the number of parameters may be reduced or increased. Also, information, etc. corresponding to parameters may be obtained by a formula, a conditional formula, etc. without using a table.

[0071] At least one of the devices included in the information processing system 1 may be installed outside Japan.

[0072] The information processing device 2 may be an on-premise type or a cloud type. As the information processing device 2 in the cloud type, the above-mentioned functions and processes may be provided in the form of, for example, SaaS (Software as a Service) or cloud computing.

[0073] In the above embodiment, the information processing device 2 performs various storage and control, but multiple external devices may be used instead of the information processing device 2. That is, various information and programs may be distributed and stored in multiple external devices using block chain technology or the like.

[0074] The above-described embodiment may be an information processing method. The information processing method includes each step executed by the information processing system 1. The above-described embodiment may be a program or a non-transitory recording medium storing the program. The program causes at least one computer to execute each step of the information processing system 1.

[0075] The information processing system 1 and the like may be provided in the following aspects.

[0076] (1) An information processing system, comprising at least one processor capable of executing a program to perform each of the following steps: an acquisition step acquires information on a data structure configured to be expressible by a graph network representing relationships between a plurality of tasks included in a predetermined curriculum, the data structure includes a plurality of nodes corresponding to each of the tasks and a plurality of directed edges representing the relationships between the tasks, each of the plurality of nodes being associated with a first attribute and a second attribute, the first attribute indicating a nature of the task in the curriculum, and the second attribute indicating a user's recognition of the task, wherein each of the first attribute and the second attribute is configured to take any one of a first state, a second state, and a third state, the third state indicating that the state of the attribute is undetermined or an initial state, each of the plurality of directed edges indicating the relationships between the tasks by connecting the plurality of nodes together, and a designation step designates one of the undetermined nodes, which is a node including an attribute taking the third state, as a designated node. In the question output step, question information corresponding to an attribute of the specified node that takes the third state is output, and the question information indicates a question regarding the task corresponding to the specified node and is associated with each of the first attribute and the second attribute. In the first setting step, a state of the attribute of the specified node that corresponds to the question information is set to one of the first state and the second state according to a user's answer to the output question. In the second setting step, when the state of the specified node is set to the first state, a state of at least one node having a directed path with the specified node as an end point is set to the first state, and when the state of the specified node is set to the second state, a state of at least one node having a directed path with the specified node as a start point is set to the second state, thereby making it possible to form a subgraph corresponding to an individual curriculum of the user when a predetermined termination condition for an undetermined node that can be designated as the specified node is satisfied, and in this case, the subgraph is a subgraph in which the first attribute takes the first state, andan information processing system including specific nodes, which are nodes whose second attribute takes the second state, and specific directed edges, which are directed edges connecting the specific nodes;

[0077] With this configuration, when presenting an appropriate curriculum from among the tasks included in the data structure according to the user's purpose and level of understanding, both the characteristics of the task and the characteristics of the user can be taken into consideration.

[0078] (2) In the information processing system described in (1) above, in the designation step, an undetermined node among the undetermined nodes that corresponds to a node whose first attribute takes a second state or whose second attribute takes a first state is not designated as the designated node.

[0079] With this configuration, even if either the task characteristics or the user characteristics remain undetermined, the range of undetermined nodes to be specified can be efficiently narrowed based on the characteristics of the other, thereby further reducing the calculation time required to extract a curriculum suitable for the user.

[0080] (3) In the information processing system described in (1) or (2) above, in the designation step, one of the undetermined nodes is designated as the designated node based on the score of each of the undetermined nodes, and the score is set based on the number of nodes whose state changes through the processing of the first setting step and the second setting step, and the change in the number of the undetermined nodes that can be designated through the processing of the first setting step and the second setting step.

[0081] According to such a configuration, it is possible to preferentially specify undetermined nodes that can more efficiently reduce the number of undetermined nodes that can be specified.

[0082] (4) In the information processing system according to any one of (1) to (3) above, in the designation step, when all nodes are undetermined nodes, the undetermined node corresponding to a question regarding the user's purpose is designated as the designated node.

[0083] With this configuration, a partial network that is more suited to the user's purpose can be constructed.

[0084] (5) In the information processing system described in any one of (1) to (4) above, in the question output step, question information constituted by a multiple-choice question is output, and the multiple-choice question is configured to be answerable by options representing answers corresponding to the first state and options representing answers corresponding to the second state.

[0085] According to such a configuration, it is possible to improve the interpretability of the subgraph while reducing the burden on the user in providing answers.

[0086] (6) In the information processing system described in any one of (1) to (5) above, the first attribute includes an attribute indicating whether the task is mandatory in the curriculum, the first attribute of a node being in the first state indicates that the task corresponding to the node is mandatory in the curriculum, the first attribute of a node being in the second state indicates that the task corresponding to the node is not mandatory in the curriculum, the second attribute includes an attribute indicating whether the user has performed the task, the second attribute of a node being in the first state indicates that the user has completed the task corresponding to the node, and the second attribute of a node being in the first state indicates that the user has not completed the task corresponding to the node.

[0087] With this configuration, it is possible to reduce the waste of user effort caused by incorporating unnecessary tasks or tasks that have already been performed into the curriculum.

[0088] (7) The information processing system according to any one of (1) to (6) above, wherein the graph network includes a graph configured of a directed acyclic graph.

[0089] With this configuration, the order of tasks included in the curriculum can be expressed more accurately.

[0090] (8) In the information processing system described in any one of (1) to (7) above, in a first presentation step, when the number of undetermined nodes that can be designated as the specified node satisfies the termination condition, the information processing system presents to a user a curriculum including tasks corresponding to specific nodes included in the subgraph and an order in which the tasks are to be completed.

[0091] With this configuration, a curriculum suited to the user can be presented.

[0092] (9) In the information processing system described in any one of (1) to (8) above, in the question output step, visual information is output that shows, at a glance, an answer area in which an answer to the question can be input, and auxiliary information that assists in understanding the content or intent of the question.

[0093] With this configuration, the accuracy of answers to questions posed by users can be improved.

[0094] (10) A data structure, configured to be expressible by a graph network representing relationships between a plurality of tasks included in a predetermined curriculum, including a plurality of nodes corresponding to each of the tasks and a plurality of directed edges representing the relationships between the tasks, each of the plurality of nodes being associated with a first attribute, a second attribute, and question information associated with each of the first attribute and the second attribute, the first attribute indicating a nature of the task in the curriculum, and the second attribute indicating a user's recognition of the task, each of the first attribute and the second attribute being configured to take any one of a first state, a second state, and a third state, the third state indicating that a state of the attribute is undetermined or an initial state, and the question information indicating information regarding a question regarding the task corresponding to the node for a user, the data structure being configured to cause at least one computer to execute each of the following steps, in which in the designation step, one of the undetermined nodes which is a node including an attribute taking the third state is designated as a designated node, and in the question output step, , outputting the question information corresponding to an attribute of the specified node that takes the third state; in a first setting step, a state of the attribute of the specified node that corresponds to the question information is set to one of the first state and the second state according to a user's answer to the output question; in a second setting step, when a state of the attribute corresponding to the question information is set to the first state, a state of an attribute corresponding to the question information is set to the first state among attributes of a node having a directed path ending at the specified node, and when a state of the attribute corresponding to the question information is set to the second state, a state of an attribute corresponding to the question information is set to the second state among attributes of a node having a directed path starting at the specified node; in an extraction step, when a predetermined termination condition for an undetermined node that can be designated as the specified node is satisfied, from the graph network, based on a subgraph constituted by a specific node that is a node whose first attribute takes the first state and whose second attribute takes the second state, and a specific directed edge that is a directed edge connecting the specific nodes,A data structure for extracting an individual curriculum of the user.

[0095] With this configuration, when presenting an appropriate curriculum from among the tasks included in the data structure according to the user's purpose and level of understanding, both the characteristics of the task and the characteristics of the user can be taken into consideration.

[0096] (11) An information processing method, comprising steps executed by the information processing system according to any one of (1) to (9) above.

[0097] (12) A program or a non-transitory recording medium having the program recorded thereon, the program causing at least one computer to execute each step of the information processing system described in any one of (1) to (9) above. Of course, this is not the case.

[0098] Finally, although various embodiments according to the present disclosure have been described, these are presented as examples and are not intended to limit the scope of the invention. The novel embodiment can be implemented in various other forms, and various omissions, substitutions, and modifications can be made without departing from the spirit of the invention. The embodiments and their modifications are included within the scope and spirit of the invention, and are included in the scope of the invention and its equivalents described in the claims. [Explanation of symbols]

[0099] 1: Information processing system 2: Information processing equipment 20: Communication bus 21: Communications Department 22: Storage section 23: Processor 3: User terminal 30: Communication bus 31: Communications Department 32: Storage section 33: Processor 34: Display section 35: Input section 4: Question screen 41: Question area 42:Answer area 43 :Auxiliary area 5:Result screen 51: Curriculum Presentation Area 52: Curriculum Information Area D1: Data Structures D2: Data Structures DB1 : Database E : directed edge E1: Specific directed edge E2: Excluded edge G1: First graph G2: Second graph G3: The third graph G4: Subgraph G5: Graph N : Node N1: First node N2: Second node N3: Undetermined node N4: Specific node N5: Excluded node QN: Specified node

Claims

1. An information processing system, At least one processor capable of executing a program to perform the following steps: In the acquisition step, information regarding a data structure that can be expressed by a graph network that represents the relationships between a plurality of tasks included in a predetermined curriculum is acquired; the data structure includes a plurality of nodes corresponding to the tasks, and a plurality of directed edges representing relationships between the tasks; each of the plurality of nodes is associated with a first attribute and a second attribute; the first attribute indicates a nature of the task in the curriculum; the second attribute indicates a user's perception of the task; wherein each of the first attribute and the second attribute is configured to take one of a first state, a second state, and a third state, the third state indicating that the state of the attribute is undetermined or an initial state; each of the plurality of directed edges indicates a relationship between the tasks by connecting the plurality of nodes; In the designation step, one of the undetermined nodes, which is a node including an attribute that takes the third state, is designated as a designated node; the question output step outputs question information corresponding to an attribute of the specified node that takes the third state, the question information indicating a question regarding the task corresponding to the specified node and corresponding to each of the first attribute and the second attribute; In the first setting step, a state of an attribute of the designated node corresponding to the question information is set to either the first state or the second state in response to a user's answer to the output question; In the second configuration step, when the state of the specified node is set to the first state, setting a state of at least one node having a directed path ending at the specified node to the first state; when the state of the specified node is set to the second state, setting a state of at least one node having a directed path starting from the specified node to the second state; This makes it possible to form a subgraph corresponding to the user's individual curriculum when a predetermined termination condition is satisfied for an undetermined node that can be designated as the specified node, wherein the subgraph is composed of specific nodes, which are nodes whose first attribute takes the first state and whose second attribute takes the second state, and specific directed edges, which are directed edges connecting the specific nodes.

2. 2. The information processing system according to claim 1, In the designation step, an undetermined node corresponding to a node whose first attribute takes a second state or whose second attribute takes a first state is not designated as the designated node.

3. 2. The information processing system according to claim 1, In the designation step, one of the undetermined nodes is designated as the designated node based on the score of each of the undetermined nodes, and the score is set based on the number of nodes whose state changes through the processing of the first setting step and the second setting step, and the change in the number of the undetermined nodes that can be designated through the processing of the first setting step and the second setting step.

4. 2. The information processing system according to claim 1, In the designation step, when all nodes are the undetermined nodes, the undetermined node corresponding to a question regarding the user's purpose is designated as the designated node.

5. 2. The information processing system according to claim 1, An information processing system, wherein the question output step outputs question information consisting of a multiple-choice question, and wherein the multiple-choice question is configured to be answerable by options representing answers corresponding to the first state and options representing answers corresponding to the second state.

6. 2. The information processing system according to claim 1, the first attribute includes an attribute indicating whether the task is required in the curriculum; the first attribute of a node being in the first state indicates that a task corresponding to the node is essential in the curriculum; the first attribute of a node being in the second state indicates that a task corresponding to the node is not essential in the curriculum; the second attribute includes an attribute indicating whether the user has performed the task; The second attribute of a node being in the first state indicates that the user has completed a task corresponding to the node; An information processing system, wherein the second attribute of a node being in the first state indicates that the user has not completed a task corresponding to the node.

7. 2. The information processing system according to claim 1, An information processing system, wherein the graph network includes a graph composed of a directed acyclic graph.

8. 2. The information processing system according to claim 1, Furthermore, in the first presentation step, when the number of undetermined nodes that can be designated as the specified node satisfies the termination condition, the information processing system presents to the user a curriculum including tasks corresponding to specific nodes included in the subgraph and the order in which the tasks are to be completed.

9. 2. The information processing system according to claim 1, The information processing system further outputs visual information in which an answer area in which an answer to the question can be input and auxiliary information for assisting in understanding the content or intent of the question can be viewed at the question output step.

10. 1. A data structure comprising: The curriculum can be expressed by a graph network that represents the relationships between a plurality of tasks included in a predetermined curriculum, the graph network including a plurality of nodes corresponding to the tasks and a plurality of directed edges that represent the relationships between the tasks; each of the plurality of nodes is associated with a first attribute, a second attribute, and question information associated with each of the first attribute and the second attribute; the first attribute indicates a nature of the task in the curriculum; the second attribute indicates a user's perception of the task; wherein each of the first attribute and the second attribute is configured to take one of a first state, a second state, and a third state, the third state indicating that the state of the attribute is undetermined or an initial state; the question information indicates information regarding a question for a user regarding the task corresponding to the node; The data structure is configured to cause at least one computer to perform the steps of: In the designation step, one of the undetermined nodes, which is a node including an attribute that takes the third state, is designated as a designated node; In the question output step, the question information corresponding to an attribute of the specified node that takes the third state is output; In the first setting step, a state of an attribute of the designated node corresponding to the question information is set to either the first state or the second state in response to a user's answer to the output question; In the second configuration step, when a state of an attribute corresponding to the question information is set to the first state, setting a state of an attribute corresponding to the question information, among attributes of a node having a directed path ending at the specified node, to the first state; when a state of an attribute corresponding to the question information is set to the second state, setting a state of an attribute corresponding to the question information among attributes of a node having a directed path starting from the specified node to the second state; In the extraction step, when a predetermined termination condition for an undetermined node that can be designated as the specified node is satisfied, an individual curriculum for the user is extracted from the graph network based on a subgraph consisting of specific nodes, which are nodes whose first attribute takes the first state and whose second attribute takes the second state, and specific directed edges, which are directed edges connecting the specific nodes.

11. 1. An information processing method, comprising: An information processing method comprising the steps executed by the information processing system according to any one of claims 1 to 9.

12. A program or a non-transitory recording medium having the program recorded thereon, The program is a program or a non-transitory recording medium that causes at least one computer to execute each step of the information processing system according to any one of claims 1 to 9.

Images