Patents by Inventor Zijiang Yang

Zijiang Yang 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).

  • Publication number: 20020178424
    Abstract: A method for Boolean Satisfiability (SAT). The method comprises using a variable decision heuristic in a SAT algorithm and pruning the search space of SAT using said decision heuristic. The decision heuristic is based on partitioning a conjunctive normal form (CNF) of a Boolean formula corresponding to the SAT and the partitioning is induced by a separator set. An image computaion method that uses the disclosed method for solving the SAT.
    Type: Application
    Filed: November 1, 2001
    Publication date: November 28, 2002
    Applicant: NEC USA, INC.
    Inventors: Aarti Gupta, Zijiang Yang, Pranav Ashar, Sharad Malik
  • Publication number: 20020053064
    Abstract: This disclosure teaches a method of Boolean satisfiability checking (SAT) for a circuit. The method comprises identifying inactive clauses in the conjunctive normal (CNF) of the circuit and removing the inactive clauses from the CNF.
    Type: Application
    Filed: June 15, 2001
    Publication date: May 2, 2002
    Applicant: NEC USA, INC.
    Inventors: Aarti Gupta, Zijiang Yang, Anubhav Gupta, Pranav Ashar