Petri网用于求解概率逻辑的近似可能世界矩阵

A PETRI NET MODEL OF AN APPROXIMATE MATRIX OF POSSIBLE WORLDS FOR PROBABILISTIC LOGIC

概率逻辑中的可能世界随着问题增长而指数性增长，使问题求解难以实现．Ｎｉｌｓ－ｓｏｎ提出了一种矩阵列产生方法［１］，可得到近似而规模小的矩阵，但他没有提出具体的算法．本文提出一种Ｐｅｔｒｉ网模型，可为Ｎｉｌｓｓｏｎ方法的求解提供有效途径．

In probabilistic logic, the number of columns in the matrix of possible worlds grows exponentially with the size of the problem. Therefore it becomes impractical to solve the problem as the problem grows in size. Nilsson suggests a method to generate only those columns of the possible world matrix that are likely important in the resulting solution, but he provides no concrete algorithms for solution. This paper provides Petri net models for Nilsson's method, which gives the efficient and simple computational methods.