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.

Date of Patent:
Dec. 16, 2014

Filed:

Oct. 02, 2013
Applicant:

International Business Machines Corporation, Armonk, NY (US);

Inventors:

Sharon Keidar-Barner, Megiddo, IL;

Itai Yosef Segall, Tel-Aviv, IL;

Rachel Tzoref-Brill, Haifa, IL;

Attorneys:
Primary Examiner:
Int. Cl.
CPC ...
G06F 17/50 (2006.01); G06F 17/11 (2006.01); G06F 11/00 (2006.01); G06F 11/26 (2006.01); G06F 11/263 (2006.01);
U.S. Cl.
CPC ...
G06F 1/5081 (2013.01); G06F 17/504 (2013.01); G06F 11/00 (2013.01); G06F 17/11 (2013.01); G06F 11/261 (2013.01); G06F 2217/14 (2013.01); G06F 17/5022 (2013.01); G06F 11/263 (2013.01);
Abstract

A method, system and product for explaining illegal combinations in combinatorial models. The method comprising obtaining a combinatorial model and an illegal combination that is excluded from the model by one or more restrictions, utilizing a Satisfiability solver on a satisfiability formula that encodes the legal test space and that assigns values to attributes as defined by the illegal combination, whereby the satisfiability solver provides an indication of unsatisfiability of the satisfiability formula and an UNSAT core comprising a subset of clauses defined by the satisfiability formula which are unsatisfiable; and identifying the one or more restrictions by mapping the clauses of the UNSAT core with clauses encoding the set of restrictions.


Find Patent Forward Citations

Loading…