| Class / Patent application number | Description | Number of patent applications / Date published |
|---|
| 706057000 | Propositional logic | 12 |
| 20090077001 | Integrating optimization directly into databases - Systems, methods and articles solve computationally complex problems. Example embodiments provide data query language features that may be used to express optimization problems. An expression of an optimization problem in the provided data query language may be transformed into a primitive problem that is equivalent to the optimization problem. An optimization solver may be invoked to provide a solution to the primitive problem. Analog processors such as quantum processors as well as digital processors may be used to solve the primitive problem. This abstract is provided to comply with rules requiring an abstract, and is submitted with the intention that it will not be used to interpret or limit the scope or meaning of the claims. | 03-19-2009 |
| 20110093431 | SAT-BASED SYNTHESIS OF A CLOCK GATING FUNCTION - Clock gating circuit is determined by transforming a clock gating opportunity function to a non-Boolean function and constraining inputs of the non-Boolean function. The non-Boolean function may be a ternary function. Constraining the inputs may be achieved by introducing control variables and a cardinality constraint associated with their values. The non-Boolean function may be utilized to approximate universal quantification of an input assigned with a non-Boolean value, such as “don't care” value. The non-Boolean function may be utilized to provide an ALL SAT solution of a Boolean function using a SAT solver. | 04-21-2011 |
| 20110137853 | SYSTEMS AND METHODS FOR REPORTING A CAUSE OF AN EVENT OR EQUIPMENT STATE USING CAUSAL RELATIONSHIP MODELS IN A BUILDING MANAGEMENT SYSTEM - A computerized method for evaluating and reporting a cause of a performance change in a building management system is shown and described. The method includes receiving an indication of a fault for building equipment of the building management system and determining a root cause for the fault by traversing a causal relationship model including the building equipment and other devices of the building management system. | 06-09-2011 |
| 20120130939 | RECONFIGURATION PLANNING - A method for solving the reconfiguration planning problem transforms the requirement that an invariant is always preserved into a constraint on the times at which the configuration parameters change. The method then solves this constraint to obtain the required reconfiguration plan. When this constraint is strengthened with a synthesis constraint, it is ensured that any final configuration that is computed is also reachable. An extension of the method allows parameters to take on multiple intermediate values. | 05-24-2012 |
| 20130066825 | SEARCH OPTIMIZATION IN A COMPUTING ENVIRONMENT - Systems and methods for verifying membership in one or more sets that are subsets of a global set are provided. The method compromises representing members of the global set by mapping each member to a distinct Boolean variable of length d, wherein 2 | 03-14-2013 |
| 20130080380 | Combining Medical Binary Decision Diagrams for Analysis Optimization - In particular embodiments, a method includes accessing first binary decision diagrams (BDDs) representing data streams from sensors, selecting portions from the first BDDs based on ease-of-analysis, and constructing a second BDD by performing an OR operation between the selected portions of the first BDDs. | 03-28-2013 |
| 20130144832 | APPARATUS AND PROCESS FOR NONDETERMINISTIC COMPUTING - In the disclosed nondeterministic computing apparatus, a user problem to be solved is translated into an equivalent system of clause polynomial equations (CPEQS) in GF(2). A process for finding an inconsistency in CPEQS is disclosed, which performs elementary equation (or row) operations, such as Gaussian forward eliminations, for each variable v in CPEQS by treating different monomials as different single variables in v-order. The result is examined for two kinds of equations: an inconsistent equation 1=0 and an equation which left-hand side has constant monomial 1 and v occurs in all the other monomials such that v occurs at least once while its right-hand side is 0 to find v=1. To find v=0, a substitution of v with v⊕1 is performed on CPEQS in advance. If either 1=0, or, x=1 and x=0 simultaneously for some variable x in CPEQS, then CPEQS is inconsistent; otherwise CPEQS is consistent. | 06-06-2013 |
| 20140149337 | ACTUATION OF A TECHNICAL SYSTEM - To enable efficient abduction even for observations that are faulty or inadequately modeled, a relaxed abduction problem is proposed in order to explain the largest possible part of the observations with as few assumptions as possible. On the basis of two preference orders over a subset of observations and a subset of assumptions, tuples can therefore be determined such that the theory, together with the subset of assumptions, explains the subset of observations. The formulation as a multi-criteria optimization problem eliminates the need to offset assumptions made and explained observations against one another. Due to the technical soundness of the approach, specific properties of the set of results (such as correctness, completeness etc.), can be checked, which is particularly advantageous in safety-critical applications. The complexity of the problem-solving process can be influenced and therefore flexibly adapted in terms of domain requirements through the selection of the underlying representation language and preference relations. The invention can be applied to any technical system, e.g. plants or power stations. | 05-29-2014 |
| 20140324766 | Quantum State Dynamics in a Community of Subjects assigned Quantum States modulo a Proposition perceived in a Social Value Context - The present invention is directed to methods and apparatus for predicting the quantum state, including the dynamics of such quantum state in so far as it represents a subject embedded in a community of community subjects. In the quantum representation adopted herein the internal states of all subjects are assigned to quantum subject states defined with respect to an underlying proposition about an item that can be instantiated by an object, a subject or by an experience. Contextualization of the proposition about the item is identified with a basis (eigenbasis of a spectral decomposition) referred to herein as the social value context. The dynamics are obtained from quantum interactions on a graph onto which the quantum states of all the subjects are mapped by a surjective mapping dictated by subject interconnections and subject-related data, including the social graph and information derived from “big data”. | 10-30-2014 |
| 20150379403 | SYSTEMS AND METHODS FOR SOLVING UNRESTRICTED INCREMENTAL CONSTRAINT PROBLEMS - We present the architecture of a high-performance constraint solver R-Solve that extends the gains made in SAT performance over the past fifteen years on static decision problems to problems that require on-the-fly adaptation, solution space exploration and optimization. R-Solve facilitates collaborative parallel solving and provides an efficient system for unrestricted incremental solving via Smart Repair. R-Solve can address problems in dynamic planning and constrained optimization involving complex logical and arithmetic constraints. | 12-31-2015 |
| 20150379404 | SYSTEMS AND METHODS FOR SOLVING UNRESTRICTED INCREMENTAL CONSTRAINT PROBLEMS - We present the architecture of a high-performance constraint solver R-Solve that extends the gains made in SAT performance over the past fifteen years on static decision problems to problems that require on-the-fly adaptation, solution space exploration and optimization. R-Solve facilitates collaborative parallel solving and provides an efficient system for unrestricted incremental solving via Smart Repair. R-Solve can address problems in dynamic planning and constrained optimization involving complex logical and arithmetic constraints. | 12-31-2015 |
| 20220138602 | ASSOCIATIVE RELEVANCY KNOWLEDGE PROFILING ARCHITECTURE, SYSTEM, METHOD, AND COMPUTER PROGRAM PRODUCT - Provided are architectures, system, methods, and computer program products that provide a user with the ability to define an association of data and/or information from known reference sets perceived by the user as relevant to a subject matter domain, thereby imparting and formalizing some of the user's knowledge about the domain. An associative relevancy knowledge profiler may also allow a user to create a profile by modifying or restricting the known reference sets and windowing the results from the association as a user might refine any other analysis algorithms. An associative relevancy knowledge profiler may also be used to define a user profile used by the user and others. A user profile may be usable in various manners depending upon, for example, rights management permissions and restrictions for a user. | 05-05-2022 |
