Loading patent…
AssigneeThe State of Oregon Acting by and through the State Board of Higher Education on Behalf of the University of Oregon
InventorsMatthew L. Ginsberg, Andrew J. Parkes
Estimating the term…
Subsearch, where a satisfiability algorithm searches through the original theory for ground clauses that satisfy some numeric property, is represented in terms of S(C,P,u,s), the set of ground instances of C that have u literals unvalued by P and s literals satisfied by the assignments in P. This representation allows an intelligent search to be performed to answer subsearch problems posed in terms of S(C,P,u,s). Intelligent Subsearch uses truth value assignments to atoms to eliminate sets of bindings to universally quantified variables within a quantified clausal constraint; the bindings being eliminated because the bindings cannot satisfy a specific statement. Intelligent subsearch backtracks away from poor choices in the search for bindings to variables within the quantified clauses. In typical uses, intelligent subsearch can reduce the time of the checking problem from O(DU) to O(DαU) for some α<1.
A computer-implemented method of generating at least a partial solution to a constraint problem, comprising the steps of:
A computer program product comprising:
A computer system for generating at least a partial solution to a constraint problem, the computer system comprising:
Dependencies are inferred from the claim text.