共查询到20条相似文献,搜索用时 15 毫秒
1.
M. C. F. Ferreira H. Zantema 《Applicable Algebra in Engineering, Communication and Computing》1996,7(2):133-162
We investigate proving termination of term rewriting systems by a compositional interpretation of terms in a total well-founded order. This kind of termination is calledtotal termination. Equivalently total termination can be characterized by the existence of an order on ground terms which is total, wellfounded and closed under contexts. For finite signatures, total termination implies simple termination. The converse does not hold. However, total termination generalizes most of the usual techniques for proving termination (including the well-known recursive path order). It turns out that for this kind of termination the only interesting orders below 0 are built from the natural numbers by lexicographic product and the multiset construction. By examples we show that both constructions are essential. Most of the techniques used are based on ordinal arithmetic.Supported by NWO, the Dutch Organization for Scientific Research, under grant 612-316-041. 相似文献
2.
以ITS9000MX超大规模集成电路测试系统为背景,系统地研究了ITS9000系列测试系统的检定方法,重点描述了它的基本思想,原理和关键技术。 相似文献
3.
4.
5.
特大口径电磁流量计是一种新型的大口径计量仪表。然而它的实施检定是制约其自身发展的关键因素。本讨论了用标准表法检定特大口径流量计的原理,分析了标准流量计的误差修正,以期找到一种用标准表法检定特大口径电磁流量计的理想方法。 相似文献
6.
7.
8.
9.
对8902A测量接收机用作高频中,小电压标准进行了分析研究,介绍了一种检定超高频毫伏表的新方法,并给出了实验数据,对该标准装置的不确定度进行了分析。 相似文献
10.
彩色印刷图像平面呈色模型的验证与应用研究 总被引:4,自引:1,他引:3
介绍彩色印刷网点图像平面呈色模型的基本内容,用FORGA及笔者自测的数据,采用回归及曲线拟合算法,建立IT8.7/3标准色谱中三色胶印色块的平面方程,列出具体的平面方程系数和曲线系数,并做了详细的误差分析,验证了平面模型的正确性,并对此呈色模型的进一步研究与应用前景做了初步探索. 相似文献
11.
Nachum Dershowitz Naomi Lindenstrauss Yehoshua Sagiv Alexander Serebrenik 《Applicable Algebra in Engineering, Communication and Computing》2001,12(1-2):117-156
This paper describes a general framework for automatic termination analysis of logic programs, where we understand by “termination”
the finiteness of the LD-tree constructed for the program and a given query. A general property of mappings from a certain
subset of the branches of an infinite LD-tree into a finite set is proved. From this result several termination theorems are
derived, by using different finite sets. The first two are formulated for the predicate dependency and atom dependency graphs.
Then a general result for the case of the query-mapping pairs relevant to a program is proved (cf. [29, 21]). The correctness
of the TermiLog system described in [22] follows from it. In this system it is not possible to prove termination for programs involving arithmetic
predicates, since the usual order for the integers is not well-founded. A new method, which can be easily incorporated in
TermiLog or similar systems, is presented, which makes it possible to prove termination for programs involving arithmetic predicates.
It is based on combining a finite abstraction of the integers with the technique of the query-mapping pairs, and is essentially
capable of dividing a termination proof into several cases, such that a simple termination function suffices for each case.
Finally several possible extensions are outlined.
Received: August 30, 1999 相似文献
12.
在服价服从跳—扩过程时,同时考虑流通性这一因素水平,研究两人零和随机微分对策问题,在采用对数效用时分别获得了投资者的最优投资策略。 相似文献
13.
14.
15.
16.
A number of properties of term rewriting systems related to termination are discussed. It is examined how these properties
are affected by modifications in the definitions like weakening the requirement of strict monotonicity and adding embedding
rules. All counterexamples to prove non-equivalence of properties are string rewriting systems, in most cases even single
string rewrite rules.
Received: June 15, 1999; revised version: August 7, 2000 相似文献
17.
18.
K. Madlener B. Reinert 《Applicable Algebra in Engineering, Communication and Computing》1997,8(2):103-123
It is well-known that for the integral group ring of a polycyclic-by-finite group several decision problems including the
membership problem for right ideals are decidable. In this paper we define an effective reduction for group rings over finitely
generated nilpotent groups — a subclass of polycyclic-by-finite groups. Using this reduction we present a generalization of
Buchberger’s Gr?bner basis method by giving an appropriate definition of “Gr?bner bases” in this setting and by characterizing
them using the concepts of saturation and s-polynomials. Our approach allows to compute such Gr?bner bases by completion based
algorithms and to use these bases to solve the membership problem for right and two-sided ideals in finitely generated nilpotent
group rings using Gr?bner basis algorithms and reduction.
Received August 21, 1995; revised version June 3, 1996 相似文献
19.
液压静力压桩机的检定是保证其量值准确可靠的基础性工作,直接关系到施工机械的选择及桩基工程的质量,本文在介绍和分析液压静力压桩机的检定必要性、福建省的检定现状及形成该现状的原因的基础上,提出了加强液压静力压桩机检定工作的建议,以期为此项工作提供参考。 相似文献
20.
本文介绍采用IC仿真卡技术,实现由公用电话的IC卡插口进行快速检定的方法、原理和软硬件设计。解决了IC卡公用电话检定需电信部门到现场配合拆机的技术难题。研究成功的多功能电话计费器检定仪可以检定各类公用电话。 相似文献