首页> 外国专利> Solving satisfiability problems through search

Solving satisfiability problems through search

机译:通过搜索解决可满足性问题

摘要

One embodiment of a method for solving an input satisfiability instance includes searching a database for a stored satisfiability instance that matches the input satisfiability instance and outputting a solution to the input satisfiability instance. One embodiment of method for converting an input satisfiability instance into a standardized representation includes applying a plurality of syntactical simplification rules to the input satisfiability instance until no conditions of any of the plurality of syntactical simplification rules can be met, thereby producing a simplified instance, uniformly replacing each variable in the simplified instance with a unique, consecutively chosen even number, annotating each literal in the simplified instance to indicate whether the each literal is positive or negative, ordering all literals in the simplified instance, and ordering all clauses in the simplified instance to produce the standardized representation.
机译:用于解决输入可满足性实例的方法的一个实施例包括在数据库中搜索与输入可满足性实例匹配的存储的可满足性实例,并将解决方案输出到输入可满足性实例。用于将输入可满足性实例转换成标准化表示的方法的一个实施例包括将多个句法简化规则应用于输入可满足性实例,直到不能满足多个句法简化规则中的任何一个的条件,从而均匀地产生简化实例。用唯一的,连续选择的偶数替换简化实例中的每个变量,对简化实例中的每个文字进行注释以指示每个文字是正还是负,对简化实例中的所有文字进行排序,并对简化实例中的所有子句进行排序产生标准化的表示。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号