56 results about "First-order logic" patented technology

A method of detecting an object in image data that is deemed to be a threat includes annotating sections of at least one training image to indicate whether each section is a component of the object, encoding a pattern grammar describing the object using a plurality of first order logic based predicate rules, training distinct component detectors to each identify a corresponding one of the components based on the annotated training images, processing image data with the component detectors to identify at least one of the components, and executing the rules to detect the object based on the identified components.

Methods and computer apparatus are disclosed for deriving first order logic language rules for use in analyzing new data to identify anomalies in the new data. Historical data is formatted to be in a form suitable for application of a machine-learning algorithm thereto. The machine-learning algorithm is applied to the formatted historical data to generate a set of first order logic language rules that cover the formatted historical data. The set of first order logic language rules are analyzed to obtain a subset of said set of first order logic language rules which can be used as first order logic language rules in analyzing new data.

The invention provides a multithreaded program output uniqueness detection and evidence generation method based on program constraint building. The output uniqueness verification problem is converted into a constraint solving problem by building a constraint expression according to the multithreaded program semanteme, a constraint solver is used for detecting whether different outputs are present and counter-example execution paths explaining different outputs are generated; the multithreaded program output uniqueness detection and evidence generation method comprises the steps of firstly, carrying out the instrumentation of the detected program, executing the program and obtaining an execution path, secondly, converting the execution path into a quantifier-free first-order logic expression covering all feasible thread interleaving according to the multithreaded program execution semanteme, thirdly, building a uniqueness verification condition aiming at the output result of once operation, and finally, verifying whether one path is present so that the output value is inconsistent with the operation result by use of the constraint solver. The method is capable of detecting whether the output of the multithreaded program is unique under given input; in case of non-uniqueness of the outputs, a counter-example sequence is shown to explain the trigger process of the non-uniqueness.

A computerized spreadsheet system includes a set of cells and a separate set of logical constraints on the values of cells. The constraints may be many-to-many relationships that permit omni-directional propagation of values between cells. The constraints may be expressed in a language encompassing first-order logic. Cells are dynamically reclassified as base cells or computed cells as a user specifies values for cells. Non-explosive consequences of the base cell values are computed and displayed in computed cells, even when the values in the base cells are inconsistent with the constraints. The spreadsheet system may also include an auto-complete feature that automatically fills in empty cells with values consistent with the logical constraints and an auto-deconflict feature that automatically changes values in cells to reduce conflicts with the logical constraints.

A collaborative first order logic system with dynamic ontology for example that enables collaborative discussion of documents, subjects associated within the documents, assertions about the subjects and theorems that utilize the assertions along with dynamic creation and association of two or more subjects that may represent the same thing. Enables geographical and temporal displays of assertions and opinions regarding the assertions.

Systems and methods to semantically compare product configuration models. A method includes receiving (305) a first configuration model (202) and a second configuration model (204). The method includes generating (310) a first order logic (FOL) representation (212) of the first configuration model (202) and an FOL representation (214) of the second configuration model (204). The method includes performing (315) a satisfiability modulo theories (SMT) solve for nonequivalence satisfiability on the FOL representation (212) of the first configuration model (202) and the FOL representation (214) ofthe second configuration model (204). The method includes storing (330) an indication that the first configuration model (202) is equivalent to the second configuration model (204) when the SMT solvefor nonequivalence satisfiability is not satisfied.