Patents by Inventor John Schlipf

John Schlipf 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).

  • Method and system for non-linear state based satisfiability
    Patent number: 7380224
    Abstract: A computerized method and system for solving non-linear Boolean equations is disclosed comprising at least partially solving a Boolean function; developing at least one inference regarding said Boolean function and saving said inference to a state machine; and accessing said inference from said state machine to develop at least one heuristic for determining whether said Boolean function is satisfiable.
    Type: Grant
    Filed: March 25, 2005
    Date of Patent: May 27, 2008
    Assignees: The United States of America as represented by the National Security Agency, The University of Cincinnati
    Inventors: John V. Franco, W. Mark VanFleet, John Schlipf, Michael R. Dransfield
  • Method and system for non-linear state based satisfiability
    Publication number: 20050171747
    Abstract: A computerized method and system for solving non-linear Boolean equations is disclosed comprising at least partially solving a Boolean function; developing at least one inference regarding said Boolean function and saving said inference to a state machine; and accessing said inference from said state machine to develop at least one heuristic for determining whether said Boolean function is satisfiable.
    Type: Application
    Filed: March 25, 2005
    Publication date: August 4, 2005
    Applicants: The United States of America as represented by the National Security Agency, The University of Cincinnati
    Inventors: John Franco, W. VanFleet, John Schlipf, Michael Dransfield
  • Method and system for non-linear state based satisfiability
    Patent number: 6912700
    Abstract: A computerized method and system for solving non-linear Boolean equations is disclosed comprising at least partially solving a Boolean function; developing at least one inference regarding said Boolean function and saving said inference to a state machine; and accessing said inference from said state machine to develop at least one heuristic for determining whether said Boolean function is satisfiable.
    Type: Grant
    Filed: June 6, 2002
    Date of Patent: June 28, 2005
    Assignees: The United States of America as represented by the National Security Agency, The University of Cincinnati
    Inventors: John V. Franco, W. Mark VanFleet, John Schlipf, Michael R. Dransfield