论文标题
计算解决方案的数量
Counting the Number of Solutions to Constraints
论文作者
论文摘要
与约束满意度问题相比，计数问题受到了更少的关注。在本文中，我们调查了研究研究解决方案数量的问题。约束可能采取各种形式，包括命题逻辑中的公式，对真实或整数的线性不平等，线性约束的布尔组合。我们描述了一些用于解决计数问题的技术和工具，以及一些应用程序（例如，用于自动推理，程序分析，正式验证和信息安全的应用程序）。
Compared with constraint satisfaction problems, counting problems have received less attention. In this paper, we survey research works on the problems of counting the number of solutions to constraints. The constraints may take various forms, including, formulas in the propositional logic, linear inequalities over the reals or integers, Boolean combination of linear constraints. We describe some techniques and tools for solving the counting problems, as well as some applications (e.g., applications to automated reasoning, program analysis, formal verification and information security).
