一阶约束的近似量词近似求解
Convergent Approximate Solving of First-Order Constraints by Approximate Quantifiers
摘要:
精确求解一阶约束(即,在特定预定义结构上的一阶公式)可能是非常困难的或者甚至是不可判定的问题。在连续结构中,如实数,计算近似解而不是精确解是有希望的。然而,一阶谓词语言的量词是允许逼近任意小误差界的障碍。本文通过修改一阶语言,用近似量词代替经典量词来解决这个问题。这些还有两个额外的优点:首先,它们是可调的,在这个意义上,它们允许用户决定精度和效率之间的权衡。第二,它们通过允许对解集的大小进行推理,将额外的表达能力引入到一阶语言中。
英文摘要:
Exactly solving first-order constraints (i.e., first-order formulas over a certain predefined structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate solutions instead of exact ones. However, the quantifiers of the first-order predicate language are an obstacle to allowing approximations to arbitrary small error bounds. In this paper we solve the problem by modifying the first-order language and replacing the classical quantifiers with approximate quantifiers. These also have two additional advantages: First, they are tunable, in the sense that they allow the user to decide on the trade-off between precision and efficiency. Second, they introduce additional expressivity into the first-order language by allowing reasoning over the size of solution sets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。