Marek＇s forward-chaining construction is one of the important techniques for investigating the non-monotonic reasoning. By introduction of consistency property over a logic program, they proposed a class of logic pro...Marek＇s forward-chaining construction is one of the important techniques for investigating the non-monotonic reasoning. By introduction of consistency property over a logic program, they proposed a class of logic programs, FC-normal programs, each of which has at least one stable model. However, it is not clear how to choose one appropriate consistency property for deciding whether or not a logic program is FC-normal. In this paper, we firstly discover that, for any finite logic programⅡ, there exists the least consistency property LCon（Ⅱ） overⅡ, which just depends onⅡitself, such that, Ⅱ is FC-normal if and only ifⅡ is FC-normal with respect to （w.r.t.） LCon（Ⅱ）. Actually, in order to determine the FC-normality of a logic program, it is sufficient to check the monotonic closed sets in LCon（Ⅱ） for all non-monotonic rules, that is LFC（Ⅱ）. Secondly, we present an algorithm for computing LFC（Ⅱ）. Finally, we reveal that the brave reasoning task and cautious reasoning task for FC-normal logic programs are of the same difficulty as that of normal logic programs.展开更多
布尔网络是一种重要的基因调控数学模型,从布尔网络的状态变换推断其结构以发现基因之间的调控关系是布尔网络研究中长期关注的重要问题。已有的归纳逻辑程序算法不能从布尔网络的不确定(解释)状态变换学习推断其网络结构。为此,文中提...布尔网络是一种重要的基因调控数学模型,从布尔网络的状态变换推断其结构以发现基因之间的调控关系是布尔网络研究中长期关注的重要问题。已有的归纳逻辑程序算法不能从布尔网络的不确定(解释)状态变换学习推断其网络结构。为此,文中提出了非确定解释转换学习(Learning From Non-deterministic interpretation Transitions,LFNDIT)算法从布尔网络异步更新语义下的解释变换学习其网络结构。首先将异步更新语义下的不确定解释变换集转换成确定解释变换集,然后利用Inoue等提出的从1步解释转换学习(Learning From 1-step state transition,LF1T)算法计算其对应的正规逻辑程序(布尔网络)。该算法的完备性得到了证明,初步的实验结果表明,该方法能有效地从不确定状态变换计算布尔网络的结构,从而为发现布尔网络的结构提供了新的思路。展开更多
基金This work is partially supported by the National Natural Science Foundation of China under Grant No.60573009the Stadholder Foundation of Guizhou Province under Grant No.2005(212).
文摘Marek＇s forward-chaining construction is one of the important techniques for investigating the non-monotonic reasoning. By introduction of consistency property over a logic program, they proposed a class of logic programs, FC-normal programs, each of which has at least one stable model. However, it is not clear how to choose one appropriate consistency property for deciding whether or not a logic program is FC-normal. In this paper, we firstly discover that, for any finite logic programⅡ, there exists the least consistency property LCon（Ⅱ） overⅡ, which just depends onⅡitself, such that, Ⅱ is FC-normal if and only ifⅡ is FC-normal with respect to （w.r.t.） LCon（Ⅱ）. Actually, in order to determine the FC-normality of a logic program, it is sufficient to check the monotonic closed sets in LCon（Ⅱ） for all non-monotonic rules, that is LFC（Ⅱ）. Secondly, we present an algorithm for computing LFC（Ⅱ）. Finally, we reveal that the brave reasoning task and cautious reasoning task for FC-normal logic programs are of the same difficulty as that of normal logic programs.
文摘布尔网络是一种重要的基因调控数学模型,从布尔网络的状态变换推断其结构以发现基因之间的调控关系是布尔网络研究中长期关注的重要问题。已有的归纳逻辑程序算法不能从布尔网络的不确定(解释)状态变换学习推断其网络结构。为此,文中提出了非确定解释转换学习(Learning From Non-deterministic interpretation Transitions,LFNDIT)算法从布尔网络异步更新语义下的解释变换学习其网络结构。首先将异步更新语义下的不确定解释变换集转换成确定解释变换集,然后利用Inoue等提出的从1步解释转换学习(Learning From 1-step state transition,LF1T)算法计算其对应的正规逻辑程序(布尔网络)。该算法的完备性得到了证明,初步的实验结果表明,该方法能有效地从不确定状态变换计算布尔网络的结构,从而为发现布尔网络的结构提供了新的思路。
