摘要
在介绍约束逻辑程序的定义、可满足性及其稳定模型等概念的基础上,研究约束逻辑程序的正文字展开方法和约束原子的正文字前缀幂集方法,对展开前后逻辑程序的等价特性进行逻辑证明。分析正规逻辑程序良基模型的构建方法,以求得经展开得到的等价正规逻辑程序的最小不动点为切入,给出简单约束逻辑程序交替不动点的良基语义模型。经推理证明,该良基模型是合理的,用该模型的构建方法将约束逻辑程序转化为正规逻辑程序也是可行的。
Based on introducing the definition, satisfiability and stable model of constraint logic program, this paper studies the text expansion method of constraint logic program and the text prefix power set expansion method of constraint logic program bound atomic and equivalent properties of logic program before and after expansion. By analysing the definition of well-founded model of normal logic programs, the well-founded semantic model of basic constraint logic program based on minimal fixed point is given, which is based on the minimal fixed of constraint logic program. The model＇s rationality is proved. The transformation of constraint logic programming into horn is feasible.
出处
《计算机工程》
CAS
CSCD
2013年第9期298-302,共5页
Computer Engineering
基金
河南省高等学校青年骨干教师基金资助项目(2011GGJS-198)
关键词
正规逻辑程序
约束逻辑程序
回答集
最小不动点
良基模型
前缀幂集
normal logic program
constraint logic program
answer set
minimal fixed point
well-founded model
prefix power set
