| 本文已被:浏览 3765次 下载 5125次 |
 码上扫一扫! |
|
|
| 一阶反合一研究 |
|
许满武1,2, 潘光睿1,2, 周荣国1,2, 宋晓梁1,2, 刘东升1,2
|
|
1.南京大学计算机科学与技术系,南京,210093;2.南京大学计算机软件新技术国家重点实验室,南京,210093
|
|
| 摘要: |
| 文章讨论一阶反合一问题以及求反合一子完备集的算法.在合一问题中,有多种求解合一问题的方法,其中研究得较为彻底的是用转换规则进行求解的方法.在研究反合一问题的过程中,人们也陆续提出了许多转换规则,这样做的结果是最终给出的是已解出形.该文在已解出形的基础上讨论一种方法,以给出具体解的完备集(反合一子完备集).通过引入Gθ和Z函数,使求解更为方便、直观. |
| 关键词: 反合一,反合一子,最一般反合一子,反合一子完备集. |
| DOI: |
| 分类号: |
| 基金项目:本文研究得到国家自然科学基金和国家863高科技项目基金资助. |
|
| First-Order Disunification |
|
XU Man-wu,PAN Guang-rui,ZHOU Rong-guo,SONG Xiao-liang,LIU Dong-sheng
|
| Abstract: |
| In this paper, the authors discuss the first-order disunification and the algorithm for computing the complete set of disunifiers. There are many methods for solving unification problem, the method by using translation rules has been thoroughly studied. Many translation rules are also given out in the study of disunification problem. By using translation rules, people usually get some solved forms for the problem. In this paper, the authors are concerted with the method for giving out the complete set of disunifiers based on solved forms. The method becomes more convenient and direct by using functions Gθand Z. |
| Key words: Disunification, disunifier, most general disunifier, complete set of disunifiers. |