【24h】

Propagation = Lazy Clause Generation

机译:传播=懒惰子句生成

获取原文
获取原文并翻译 | 示例

摘要

Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we describe how we can mimic a finite domain propagation engine, by mapping propagators into clauses in a SAT solver. This immediately results in strong nogoods for finite domain propagation. But a na?ve static translation is impractical except in limited cases. We show how we can convert propagators to lazy clause generators for a SAT solver. The resulting system can solve scheduling problems significantly faster than generating the clauses from scratch, or using Satisfiability Modulo Theories solvers with difference logic.
机译:有限域传播求解器通过一组选择可以有效地表示变量的可能值,这些选择可以自然地建模为布尔变量。在本文中,我们描述了如何通过将传播子映射到SAT解算器中的子句中来模拟有限域传播引擎。这立即导致有限域传播的强烈干扰。但是,除少数情况外,单纯的静态翻译是不切实际的。我们展示了如何将传播器转换为SAT求解器的惰性子句生成器。与从头开始生成子句或使用具有差异逻辑的可满足性模理论求解器相比,所得的系统可以显着更快地解决调度问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号