Patents by Inventor Ofer Shtrichman

Ofer Shtrichman has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Sharing information between instances of a propositional satisfiability (SAT) problem
    Patent number: 7047139
    Abstract: A technique is disclosed for sharing information between closely-related SAT instances (instances with a non-empty intersection between their sets of clauses), which enables a speed-up in the overall solution time. This technique is particularly effective in SAT-based bounded model checking (BMC), and in problems of planning and logistics.
    Type: Grant
    Filed: November 23, 2001
    Date of Patent: May 16, 2006
    Assignee: International Business Machines Corporation
    Inventor: Ofer Shtrichman
  • Sharing information between instances of a propositional satisfiability (SAT) problem
    Publication number: 20020123867
    Abstract: A technique is disclosed for sharing information between closely-related SAT instances (instances with a non-empty intersection between their sets of clauses), which enables a speed-up in the overall solution time. This technique is particularly effective in SAT-based bounded model checking (BMC), and in problems of planning and logistics.
    Type: Application
    Filed: November 23, 2001
    Publication date: September 5, 2002
    Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventor: Ofer Shtrichman