| 摘要 |
<P>PROBLEM TO BE SOLVED: To provide an ontology search technique capable of reducing a calculation amount and an amount of memory usage when calculating distance between classes on ontology. Ž<P>SOLUTION: An acquisition part 101 acquires group data of ontology data and designation of a start point and an end point. An encoding part 102 encodes the group data, an objective function, the start point and the end point acquired by the acquisition part 101 in each group. A satisfiability determining part 103 gives a constraint equation representing an ontology structure with a logical expression, a constraint equation about the start point and the end point, and the objective function to a SAT (satisfiability problem) solver to execute the SAT solver, and calculates allocation to a Boolean variable such that the value of the objective function is minimum after the encoding part 102 encodes all of the group data for representing the structure of the entire ontology. A decoding part 104 interprets determination results of the satisfiability determined by the satisfiability determining part 103 and outputs arrangement of classes existing on a path from the start point to the end point and distance between the start point and the end point. Ž<P>COPYRIGHT: (C)2010,JPO&INPIT Ž
|
