基于确定布尔函数的最坏情况接地分析
Worst-Case Groundness Analysis Using Definite Boolean Functions
摘要：
本说明说明了理论上的最坏情况下的情况下，通过抽象的解释明确（Def）和积极的（Pos）布尔函数的抽象域的接地分析。对于Def，给出了一个例子，其中任何基于def的抽象解释的接地分析如下的链是指数的参数位置的数量，以及在条款的数量，但次指数的大小的程序。对于POS，我们加强了以前的结果，说明了一个例子，其中任何基于POS的抽象解释接地分析如下的链是指数的大小的程序。确定Def的最坏情况是否真的和Pos一样糟糕仍然是一个悬而未决的问题。
英文摘要：
This note illustrates theoretical worst-case scenarios for groundness analyses obtained through abstract interpretation over the abstract domains of definite (Def) and positive (Pos) Boolean functions. For Def, an example is given for which any Def-based abstract interpretation for groundness analysis follows a chain which is exponential in the number of argument positions as well as in the number of clauses but sub-exponential in the size of the program. For Pos, we strengthen a previous result by illustrating an example for which any Pos-based abstract interpretation for groundness analysis follows a chain which is exponential in the size of the program. It remains an open problem to determine if the worst case for Def is really as bad as that for Pos.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
