The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Nov. 19, 2013
Filed:
Apr. 22, 2011
Jason R. Baumgartner, Austin, TX (US);
Michael L. Case, Pflugerville, TX (US);
Robert L. Kanzelman, Rochester, MN (US);
Hari Mony, Austin, TX (US);
Jason R. Baumgartner, Austin, TX (US);
Michael L. Case, Pflugerville, TX (US);
Robert L. Kanzelman, Rochester, MN (US);
Hari Mony, Austin, TX (US);
International Business Machines Corporation, Armonk, NY (US);
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.