首页> 外国专利> DPLL-based SAT solver using with application-aware branching

DPLL-based SAT solver using with application-aware branching

机译:结合应用感知分支的基于DPLL的SAT求解器

摘要

A system and method for determining satisfiability of a bounded model checking instance by restricting the decision variable ordering of the SAT solver to a sequence wherein a set of control state variables is given higher priority over the rest variables appearing in the formula. The order for control state variables is chosen based on an increasing order of the control path distance of corresponding control states from the target control state. The order of the control variables is fixed, while that of the rest is determined by the SAT search. Such a decision variable ordering strategy leads to improved performance of SAT solver by early detection and pruning of the infeasible path segments that are closer to target control state.
机译:通过将SAT求解器的决策变量排序限制为一个序列来确定有界模型检查实例的可满足性的系统和方法,在该序列中,一组控制状态变量的优先级高于公式中出现的其余变量。基于相应控制状态与目标控制状态的控制路径距离的递增顺序来选择控制状态变量的顺序。控制变量的顺序是固定的,其余的顺序由SAT搜索确定。这种决策变量排序策略通过尽早检测和修剪更接近目标控制状态的不可行路径段来提高SAT求解器的性能。

著录项

  • 公开/公告号US8532971B2

    专利类型

  • 公开/公告日2013-09-10

    原文格式PDF

  • 申请/专利权人 MALAY K. GANAI;

    申请/专利号US20100872797

  • 发明设计人 MALAY K. GANAI;

    申请日2010-08-31

  • 分类号G06F17/50;

  • 国家 US

  • 入库时间 2022-08-21 16:43:29

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号