首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2篇
  免费   0篇
  国内免费   1篇
一般工业技术   1篇
自动化技术   2篇
  2010年   1篇
  1999年   1篇
  1992年   1篇
排序方式: 共有3条查询结果,搜索用时 15 毫秒
1
1.
Negation is intrinsic to human thinking and most of the time when searching for something, we base our patterns on both positive and negative conditions. This should be naturally reflected in software that provide pattern-based searches. We would like for example to specify that we search for white cars that are not station wagons, or that we search for a list of objects that does not contain two identical elements.  相似文献   
2.
We show thatE-disunification is semi-decidable when the theoryE is presented by a ground convergent rewrite system, and we give a sound and completeE-disunification procedure based on narrowing. A variant of the procedure allows solving systems of equations and disequations, such as the ones that appear in logic programming languages. We show two cases where the efficiency of theE-disunification procedure is similar to the efficiency of theE-unification procedure, namely theories with free constructors and left linear systems. We also show that, in the general case,E-disunification is not decidable even whenE-unification is decidable and finitary.  相似文献   
3.
文章讨论一阶反合一问题以及求反合一子完备集的算法.在合一问题中,有多种求解合一问题的方法,其中研究得较为彻底的是用转换规则进行求解的方法.在研究反合一问题的过程中,人们也陆续提出了许多转换规则,这样做的结果是最终给出的是已解出形.该文在已解出形的基础上讨论一种方法,以给出具体解的完备集(反合一子完备集).通过引入Gθ和Z函数,使求解更为方便、直观.  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号