人工知能学会論文誌
Online ISSN : 1346-8030
Print ISSN : 1346-0714
ISSN-L : 1346-0714
論文
コストに基づく仮説推論の2種の連続値最適化問題への置換法とその協調による推論法
松尾 豊石塚 満
著者情報
ジャーナル フリー

2001 年 16 巻 5 号 p. 400-407

詳細
抄録

Cost-based Hypothetical Reasoning is an important framework for knowledge-based systems; however it is a form of non-monotonic reasoning and thus an NP-hard problem. To find a near-optimal solution in polynomial time with respect to problem size, some algorithms have been developed so far using optimization techniques. In this paper, we show two major ways of transforming propositional clauses in the hypothetical reasoning problems into constraints. One transforms the clauses into linear inequalities and is good at getting a low-cost solution, while the other transforms them into non-linear equalities and is good at finding a feasible solution. We them show a method of integrating these two transformations by using augmented Lagrangian method. Here, each variable and constraint is regarded as a processor and the searh is realized by their interaction. Two kinds of processors are derived from the two transformations; the structure of these processors are changed dynamically during the search. The cooperation of these two processors allows to obtain better near-optimal solutions than by our previous SL method. This effect is shown in the experiments using two problems with different problem structures.

著者関連情報
© 2001 JSAI (The Japanese Society for Artificial Intelligence)
次の記事
feedback
Top