On the Relationship Between TMS and Logic Programs  

作　　者：王献昌 陈火旺 赵沁平 

机构地区：[1]DepartmentofComputerScience,ChangshaInstituteofTechnology,Changsha410073

出　　处：《Journal of Computer Science & Technology》1994年第3期245-251,共7页计算机科学技术学报（英文版）

摘　　要：The relationship between TMS and general logic programs is an important issue in non-monotonic logic programming. In this paper, we prove that, after we translate the TMS theory into a general logic program, the TMS's well-founded assignment (orextension) is equivalent to the corresponding general logic program's stable model. It means that TMS can be completely integrated into a non-monotonic logic programming environment.The relationship between TMS and general logic programs is an important issue in non-monotonic logic programming. In this paper, we prove that, after we translate the TMS theory into a general logic program, the TMS's well-founded assignment (orextension) is equivalent to the corresponding general logic program's stable model. It means that TMS can be completely integrated into a non-monotonic logic programming environment.

关 键 词：General logic program TMS stable model well-founded 

分 类 号：TP31[自动化与计算机技术—计算机软件与理论]