Efficiently determining Boolean satisfiability with lazy constraints
US9280626B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Apr 27, 2012 |
| Grant date | Mar 8, 2016 |
| Priority date | — |
| Expiry date | Jan 8, 2035 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F2111/04
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
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.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.