Patents by Inventor Clayton Gillespie

Clayton Gillespie 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).

  • Patent number: 10528868
    Abstract: Within satisfaction problems or any decision or other problem which is reducible to a satisfaction problem, the invention tracks the paths along which implications propagate and identifies conditional contradictions and subsequently moves the contradictions back down the implicational paths toward assumptions or other unreasoned assertions in order to expel the contradictions. The action is completed in less time than is incurred by existing methods and thus provides a performance improvement to the devices, software, or processes which address such problems.
    Type: Grant
    Filed: March 25, 2015
    Date of Patent: January 7, 2020
    Inventor: Clayton Gillespie
  • Publication number: 20170083812
    Abstract: Within satisfaction problems or any decision or other problem which is reducible to a satisfaction problem, the invention tracks the paths along which implications propagate and identifies conditional contradictions and subsequently moves the contradictions back down the implicational paths toward assumptions or other unreasoned assertions in order to expel the contradictions. The action is completed in less time than is incurred by existing methods and thus provides a performance improvement to the devices, software, or processes which address such problems.
    Type: Application
    Filed: March 25, 2015
    Publication date: March 23, 2017
    Inventor: Clayton GILLESPIE
  • Patent number: 8577825
    Abstract: System, method and device for reducing the time required for solution of problems in the NP complexity class to polynomial time. Within satisfaction problems or problems reducible to a satisfaction problem, the invention tracks the sources of implications and identifies proximal parameterizations of conditional contradictions and subsequently avoids those contradictory conditions. The action is completed in less time than is incurred by existing methods and thus provides a performance improvement to the devices, software, or processes which address such problems.
    Type: Grant
    Filed: June 25, 2010
    Date of Patent: November 5, 2013
    Inventor: Clayton Gillespie
  • Publication number: 20110161266
    Abstract: System, method and device for reducing the time required for solution of problems in the NP complexity class to polynomial time. Within satisfaction problems or problems reducible to a satisfaction problem, the invention tracks the sources of implications and identifies proximal parameterizations of conditional contradictions and subsequently avoids those contradictory conditions. The action is completed in less time than is incurred by existing methods and thus provides a performance improvement to the devices, software, or processes which address such problems.
    Type: Application
    Filed: June 25, 2010
    Publication date: June 30, 2011
    Inventor: Clayton Gillespie