广东工业大学学报 ›› 2005, Vol. 22 ›› Issue (2): 120-124.

• 综合研究 • 上一篇    下一篇

关于逻辑程序不动点语义的讨论

  

  1. 广东工业大学应用数学学院 广东广州510090;
  • 出版日期:2005-06-01 发布日期:2005-06-01
  • 基金资助:

    广东工业大学青年基金项目(042027)

Discussion about Fixed Point Semantics in Logic Programming

  1. (Faculty of Applied Mathematics,Guangdong University of Technology, Guangzhou 510090 China)
  • Online:2005-06-01 Published:2005-06-01

摘要: 主要讨论逻辑程序中的最大不动点语义.证明了当Herbrand解释语义映射TP是保滤子交的,或者确定性程序中不含函数符号,或者它的每一个子句都满足:子句体的变量都在子句头中出现时,集合Tp↓ω就是语义映射Tp的最大不动点.然后定义了另一个Herbrand解释语义映射Fp,将关于逻辑程序不动点语义的一些主要结论进行了推广. 

关键词: 逻辑程序设计; 不动点语义; Herbrand解释; Herbrand模型;

Abstract: The great fixed point in logic programming is discussed. If the mapping of Herbrand interpretations T_p preserves filtered infs, or there are no function symbols in a definite program, or each variable in the body of the clause also appears in the head for each clause in the definite program, the set T_p↓ω is the great fixed point of the mapping T_p. By Defined another mapping of Herbrand interpretations F_p, some Lloyd J W’s results on the fixed points are generalized.

Key words: logic programming; fixed points; Herbrand interpretation; Herbrand model;

[1] KowalskiRA.PredicateLogicasProgrammingLanguage. Proc.ofIFIPCongress . 1974

[2] KowalskiRA.TheRelationBetweenLogicProgrammingandLogicSpecification. MathematicalLogicandProgrammingLanguages . 1985

[3] LloydJW.FoundationsofLogicProgramming. . 1987

[4] Krzysztof R,Emden M.Contributions to the theory of logic programming. The Journal of The American Medical Association . 1982
No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!