首页>
外国专利>
Efficiently determining boolean satisfiability with lazy constraints
Efficiently determining boolean satisfiability with lazy constraints
展开▼
机译:有效确定具有懒惰约束的布尔可满足性
展开▼
页面导航
摘要
著录项
相似文献
摘要
A mechanism is provided for efficiently determining Boolean satisfiability (SAT) using lazy constraints. A determination is made as to whether a SAT problem is satisfied without constraints in a list of constraints. Responsive to the SAT problem being satisfied without constraints, a set of variable assignments that are determined in satisfying the SAT problem without constraints are fixed. For each constraint in the list of constraints, a determination is made as to whether the SAT problem with the constraint results in the set of variable assignments remaining constant. Responsive to the SAT problem with the constraint resulting in the set of variable assignments remaining constant, the constraint is added to a list of non-affecting constraints and a satisfied result is returned.
展开▼