参数化二阶蕴涵问题的符号消去法(及其在无线网络理论中的应用)
Symbol Elimination for Parametric Second-Order Entailment Problems (with Applications to Problems in Wireless Network Theory)
摘要:
我们分析了含有参数-常数或函数的公式的二阶量词消去的可能性。为此,我们使用的约束解析演算从专门的层次叠加演算。如果饱和终止,我们分析的可能性,获得最弱的参数,保证满足性的约束。如果饱和不终止,我们确定的情况下,存在无限饱和集的有限表示。我们确定的情况下,使用二阶量化表示的公式之间的蕴涵可以有效地检查。我们说明了一系列的例子,从无线网络研究的想法。
英文摘要:
We analyze possibilities of second-order quantifier elimination for formulae containing parameters -- constants or functions. For this, we use a constraint resolution calculus obtained from specializing the hierarchical superposition calculus. If saturation terminates, we analyze possibilities of obtaining weakest constraints on parameters which guarantee satisfiability. If the saturation does not terminate, we identify situations in which finite representations of infinite saturated sets exist. We identify situations in which entailment between formulae expressed using second-order quantification can be effectively checked. We illustrate the ideas on a series of examples from wireless network research.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。