3 results about "Logical connective" patented technology

A formal system effects ordered derivations of canonical forms with inductive formation rules. A logical connective understood as ordered conjunction, denying the proof-theoretic structural law of exchange in a substructural setting, concatenates terms occurring at successive internal nodes of a proof tree until a defined pattern is matched and a canonical form is thus obtained. Leaf nodes classify subterms by their semantic types, and syntactic composition occurs at internal nodes to determine the canonical form. The framework admits normalization of structured data, deriving consistent representations for terms with many possible encodings.

This application discloses a method and apparatus for constructing an operator rule engine, relating to the field of computer technology. The method includes: acquiring text to be processed; extracting multiple keywords from the text using natural language processing techniques; matching corresponding target operators for each keyword based on a pre-configured operator library, and generating a corresponding set of conditional operators based on multiple keywords and their corresponding target operators; extracting logical connectives from the text and determining the logical relationships between each conditional operator based on these logical connectives; and generating a corresponding operator rule engine based on the set of conditional operators and the logical relationships between each conditional operator. This application responds to the driving force of natural language text by automatically extracting logic, matching operators, and constructing a rule engine, replacing the traditional method of manually customizing and writing computational logic. This effectively solves the problems of tedious and error-prone processes, achieving a dual improvement in data processing efficiency and accuracy.