一般订货的可接受性
Acceptability with general orderings
摘要：
提出了一种新的逻辑程序终止性分析方法。该方法的本质是我们使用一般的排序（而不是级别映射），就像在逻辑程序终止分析的转换方法中所做的那样，但是我们将这些排序直接应用于逻辑程序，而不是通过一些转换获得的术语重写系统。我们定义了一些变量的可接受性，一般的排序的基础上，并显示它们是如何等同于LD-终止。我们开发了一个需求驱动的，基于约束的方法来验证这些可接受的变量。该方法优于标准可接受性的优点是，在某些情况下，需要复杂的级别映射，可以很容易地生成相当简单的排序。与转换方法相比，它的优点是完全避免了转换步骤。{ \bf Keywords：}终止分析、可接受性、排序。
英文摘要：
We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general orderings (instead of level mappings), like it is done in transformational approaches to logic program termination analysis, but we apply these orderings directly to the logic program and not to the term-rewrite system obtained through some transformation. We define some variants of acceptability, based on general orderings, and show how they are equivalent to LD-termination. We develop a demand driven, constraint-based approach to verify these acceptability-variants. The advantage of the approach over standard acceptability is that in some cases, where complex level mappings are needed, fairly simple orderings may be easily generated. The advantage over transformational approaches is that it avoids the transformation step all together. {\bf Keywords:} termination analysis, acceptability, orderings.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
