| 本文已被：浏览 6415次 下载 7087次 |
码上扫一扫！ |
|
|
| 由一阶逻辑公式得到命题逻辑可满足性问题实例 |
|
黄拙1,2, 张健1
|
|
1.中国科学院,软件研究所,计算机科学重点实验室,北京,100080;2.中国科学院,研究生院,北京,100039
|
|
| 摘要: |
| 命题逻辑可满足性(SAT)问题是计算机科学中的一个重要问题.近年来许多学者在这方面进行了大量的研究,提出了不少有效的算法.但是,很多实际问题如果用一组一阶逻辑公式来描述,往往更为自然.当解释的论域是一个固定大小的有限集合时,一阶逻辑公式的可满足性问题可以等价地归约为SAT问题.为了利用现有的高效SAT工具,提出了一种从一阶逻辑公式生成SAT问题实例的算法,并描述了一个自动的转换工具,给出了相应的实验结果.还讨论了通过增加公式来消除同构从而减小搜索空间的一些方法.实验表明,这一算法是有效的,可以用来解决数学研究和实际应用中的许多问题. |
| 关键词: 可满足性问题 一阶逻辑 命题逻辑 |
| DOI： |
| 分类号: |
| 基金项目:Supported by the National Science Fund for Distinguished Young Scholars of China under Grant No.60125207 (国家杰出青年科学基金) |
|
| Generating SAT Instances from First-Order Formulas |
|
HUANG Zhuo,ZHANG Jian
|
| Abstract: |
| To solve the satisfiability (SAT) problem in propositional logic, many algorithms have been proposed in recent years. However, practical problems are often more naturally described as satisfying a set of first-order formulas. When the domain of interpretation is finite and its size is a fixed positive integer, the satisfiability problem in the first-order logic can be reduced to SAT. To facilitate the use of SAT solvers, this paper presents an algorithm for generating SAT instances from first-order clauses, and describes an automatic tool performing the transformation, together with some experimental results. Several different ways of adding formulas are also discussed to eliminate symmetries, which will reduce the search space. Experiments show that the algorithm is effective and can be used to solve many problems in mathematics and real-world applications. |
| Key words: satisfiability problem first-order logic propositional logic |
