36 results about "Propositional calculus" patented technology

A rule processing apparatus includes modules for defining / entering attributes, enumerations, and / or relationships; packaging the definitions in a reduced canonical form suitable for propositional logic manipulation using zero-suppressed binary decision diagrams (Zdd) to produce a prime Zdd; and / or (iii) executing the rule by applying a series of user inputs to the prime Zdd to determine a result that preferably includes conflict and selection advice to guide the user to satisfaction. Elective events, such as but not limited to the display of messages or the performance of calculations, may optionally be packaged along with the prime rule or components thereof, and presented during execution to help guide the end user to satisfaction or compliancy when choosing among possible selections. The apparatus automates determination of a complex rule having a combinatorial exploded number of rule components, or a combinatorial number of possible outcomes, exceeding computational capacity of present day computing systems.

The present systems and methods disclose a system for personalizing computer functionality. End-users are provided with tools to easily write rich and complex preferences, for example, by using a plurality simple IF-THEN propositional logic. The preferences are then transformed into queries and executed efficiently on structured data. Preferences that are satisfied then execute actions such as providing notification or storing data in a particular folder. Furthermore, according to an aspect of the invention, data, logic, events, inter alia, are all schematized, thereby enabling sharing of data between application components and across applications.

A rule packaging system and method to define and / or package parameters, attributes, enumerations of a prime rule in a reduced canonical form suitable for propositional logic manipulation using, for example, zero-suppressed binary decision diagrams. The reduced form of the prime rule is subsequently used by applying a series of user inputs to determine a result that preferably includes conflict and selection advice to guide the user to satisfaction. Elective events, such as but not limited to the display of messages or the performance of calculations, may optionally be packaged along with the prime rule or components thereof, and presented during execution to help guide an end user to satisfaction or compliancy when choosing among possible configuration parameters. The apparatus automates determination of a complex rule having a combinatorial exploded number of rule components, or a combinatorial number of possible outcomes, exceeding computational capacity of present day computing systems.

Cryptographic methods are disclosed, which allow a prover party, who holds a number of secrets, to demonstrate satisfiable formulas of propositional logic, wherein the atomic propositions are linear relations between the secrets. The demonstration reveals no more information than is contained in the formula itself. Some implementations allow an unlimited number of such demonstrations to be made, without revealing any additional information about the secrets, whereas other implementations ensure that the secrets, or some of the secrets, will be revealed, if a demonstration is performed more than a predetermined number of times. The demonstrations may be zero-knowledge proofs, or signed proofs.

The invention discloses an automatic verification method of a synchronous language program based on satisfiability, which includes inlining the enumerated values, user-defined types and constants in the synchronous language program into the nodes of the synchronous language program, and in the synchronous language program recursively inline all the called nodes in the main node of , and get a synchronous language program containing a single node, and then reduce the memory depth of the program to 1 by introducing a new local data flow, and finally the synchronous language program containing a single node and Its security properties are expressed as propositional logic formulas, and a satisfiability modulo theory solver is used to verify whether a synchronous language program satisfies the security properties to be verified. The invention supports direct verification of large-scale complex synchronous language programs, can improve the verification ability and efficiency, and can ensure the reliability and safety of the programs.

The invention provides a reachability analysis method of a hybrid system. The reachability analysis method comprises the following steps that input files of a hybrid automaton are analyzed, and the bounded figure structure of the automaton is encoded into a propositional logic formula set; an SAT solver is used for solving the formula set, if the formula set can not be solved, an output result is insoluble, and if the output result is soluble, an assignment capable of being met is decoded to be a path on the figure structure of the automaton; a target path is encoded to form linear constraint according to the meaning of the hybrid automaton; the linear constraint is solved, if the linear constraint is soluble, the path is output as a result, and if the linear constraint is insoluble, a next step is turned; an irreducible and insoluble set of the linear constraint is given; an unreachable path is encoded into the propositional logic formula set and then is added into the formula set of the figure structure of the automaton. The reachability analysis method is used so that the candidate path for reaching a target node can be quickly found out, and the time for searching the figure structure of the hybrid automaton can be shortened.

The invention belongs to the field of computer technology, discloses an e-commerce recommendation technology and system based on the analysis of soft set decision rules, and establishes a propositional logic reasoning language based on soft sets. In the reasoning language, the atomic formula is the parameter e in the soft set , the function value F(e) of the parameter e is the assignment set of the atomic formula e, and the soft decision rule is an implication logic formula composed of atomic formulas on the decision soft set; the introduction of soft truth, conditional soft truth and joint soft truth , soft similarity, logical soft distance and other quantitative indicators to evaluate soft decision rules from different aspects of sufficiency, necessity and rationality; transform the decision system into a decision soft set, and propose a soft decision rule extraction method for incomplete decision systems; Data analysis methods based on propositional logic and soft sets are applied to e-commerce recommendation. The present invention demonstrates that the methods proposed by the present invention are all effective through practical examples; the theoretical analysis of the present invention is innovative, the method structure is novel, and the technical means are practical.