15 results about "Logical connective" patented technology

Techniques are provided for processing rules expressed in a domain-specific language. A computing system may receive a rule including an entity identifier, a property of the entity, and one or more logical operators delimited by syntactic tokens of the language. The rule is parsed into an abstract syntax tree (AST) representation that structurally represents entities, properties, and conditional logic, and the AST is transformed into an executable function configured to evaluate input data objects defined according to a machine-readable data model. Execution of the function on input data produces a logical outcome along with intermediate results corresponding to evaluations of individual conditions and logical operators. The computing system generates an execution trace comprising the logical outcome and the intermediate results, the trace being stored in a structured log retrievable to provide evidence of how outcomes were determined.

The invention discloses an IMA system fault diagnosis modeling tool based on a logic algebraic model, which comprises an ICD information management module and a fault diagnosis logic definition module, and is characterized in that the ICD information management module is used for realizing reading, analysis and data storage of an ICD file set and obtaining messages and parameters defined in ICD files; and the fault diagnosis logic definition module is used for defining various fault diagnosis logic algebraic models by defining variable names and logic operators according to the messages and parameters analyzed by the ICD information management module. According to the method, a visual and efficient logic modeling tool can be provided for IMA fault diagnosis function design and developers, and a diagnosis logic model is modified and solidified aiming at an object system, so that a high-adaptability agile design and development way is provided for the IMA system diagnosis function.

The invention discloses a logical operation method based on depth-first traversal and stack recursion, and belongs to the technical field of computer logical operation and data processing. The method aims at solving the problems that in the prior art, when a complex nested logic expression is processed, operator priority judgment is complex, short circuit evaluation is difficult to achieve, and code maintainability is poor. The core of the method is that firstly, a nested logic expression to be calculated is abstracted into a tree-shaped or nested array data structure; secondly, a depth-first traversal algorithm is adopted to conduct recursive scanning on the data structure, and in the traversal process, encountered logic operators and basic judgment conditions (calculation factors) or intermediate calculation results of sub-expressions are sequentially pressed into a main stack according to the traversal sequence; when traversal of one sub-expression is completed, an actuator module is automatically triggered; and the executor module pops up a logic operator of the current action range from the main stack.

The invention provides a design method and device of a patent retrieval statement, a medium and equipment. The design method comprises the following steps: identifying a logical operation symbol in a retrieval formula; based on the logic operation symbols, splitting the retrieval formula into at least one retrieval word group; wherein the search word group comprises at least one search word; identifying the category of the search word group; based on the category of the search word group, generating an extended search word of the search word group; based on the category of the search word group, the search word group and the extended search word, generating a search type search statement; according to the method, a retrieval formula is split into retrieval word groups according to logical operation symbols, extended retrieval words are generated by identifying the categories of the retrieval word groups, and more accurate retrieval statements are generated by combining the categories of the retrieval word groups, the retrieval word groups and the extended retrieval words, so that patent documents more conforming to expectations are provided for retrieval personnel, and the retrieval efficiency is improved. The retrieval difficulty is reduced; and the retrieval efficiency and effect are improved.

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.

The invention discloses a power communication maintenance ticket approval method and system. The method comprises the steps of obtaining to-be-approved electric power communication maintenance ticket data; performing semantic understanding and information extraction on to-be-approved electric power communication maintenance ticket data by using a neural network module, and outputting structured semantic information; inputting the structured semantic information into a symbol reasoning module, performing logical reasoning and compliance verification by the symbol reasoning module based on a differentiable symbol rule base, and outputting an approval result; the method comprises the following steps: converting an electric power communication maintenance ticket approval rule into a symbolic logic expression with a weight by adopting a differentiable logic operator, and constructing a differentiable symbolic rule base; and constructing a double-layer optimization framework, and jointly optimizing parameters of the neural network module and weights of rules in the differentiable symbol rule base based on upper-layer approval task loss and lower-layer symbol rule logic consistency loss. According to the method, the examination and approval efficiency, accuracy and auditing performance are remarkably improved, and the method is suitable for intelligent processing of power grid communication maintenance business.

The application discloses a query condition conversion method and device for adaptive AI output correction, and relates to the technical field of artificial intelligence and natural language processing. The method comprises the following steps: receiving a user natural language input, dynamically constructing a system prompt word based on target table field metadata, sending the system prompt word to a large language model together with the user natural language input, obtaining a JSON format query condition array and transmitting and storing the JSON format query condition array. JSON strings in the array are extracted and converted into a query condition object array, logical operator position correction processing is performed on the query condition object array, the first query condition logical relationship is set to be empty, and the logical operator value of the previous query condition is read as the logical relationship of the previous query condition. The corrected array is converted into a system internal data structure, a database query is performed by using the system internal data structure, and data records meeting the conditions are obtained and returned. The problem that a large language model sets a logical operator on a previous expression, resulting in incorrect query results, is solved.

One aspect of the disclosure relates to a fault modeling method comprising determining one or more signals corresponding to one or more onboard interface data associated with a fault; constructing one or more corresponding bottom fault logic units based on the one or more signals; based on the bottom layer fault logic unit and one or more logic operators, constructing fault combinational logic comprising zero layer, one layer or multiple layers of nesting; generating a fault combinatorial logic expression based on the constructed fault combinatorial logic; and generating at least one of a corresponding extensible markup language file and a binary file based on the generated fault combinatorial logic expression.

The invention discloses a log query method and device based on loose and logic ideas. The method comprises the steps that a first query statement containing loose and logic operators is received; in response to the first query statement, traversing a log line in the log data set, and determining whether field values of all first matching fields existing in the current log line meet corresponding condition values or not; under the condition that it is determined that the field values of all the first matching fields existing in the current log line meet the corresponding condition values, the current log line is included into a query result set; and after traversing and querying the log lines in the log data set, returning a query result set in response to the first query statement. Therefore, by introducing loose and logic operators, only fields actually existing in log lines are subjected to strict matching verification, and for non-existing fields, the conditions are automatically considered to be met, so that a rigorous and contained retrieval tool is provided for highly unstructured log data query.

The application provides a patent search sentence design method and device, a medium and equipment. The method comprises the following steps: identifying a logical operator in a search formula; based on the logical operator, splitting the search formula into at least one search term group; wherein the search term group comprises at least one search term; identifying the category of the search term group; based on the category of the search term group, generating an extended search term of the search term group; and based on the category of the search term group, the search term group and the extended search term, generating a search sentence of the search formula. That is, the search formula is split into search term groups according to the logical operator, the extended search term is generated by identifying the category of the search term group, and a more accurate search sentence is generated in combination with the category of the search term group, the search term group and the extended search term, so as to provide a more expected patent file for the searcher, reduce the search difficulty and improve the search efficiency and effect.

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.

The invention discloses a query condition conversion method and device for adaptive AI output correction, and relates to the technical field of the crossing field of artificial intelligence and natural language processing. The method comprises the steps of receiving natural language input of a user, dynamically constructing system cue words based on target table field metadata, sending the system cue words and the natural language of the user to a large language model, obtaining a JSON format query condition array, and transmitting and storing the JSON format query condition array. JSON character strings in the array are extracted and converted into a query condition object array, logic operator position correction processing is carried out on the query condition object array, the logic relation of the first query condition is set to be null, and the previous logic operator value is read as the logic relation with the previous query condition according to the subsequent query condition. And converting the corrected array into a system internal data structure, executing database query by using the system internal data structure, and obtaining and returning data records meeting conditions. The problem that a query result is wrong due to the fact that a logic operator is arranged on a previous expression by a large language model is solved.

The application provides a conditional expression dynamic configuration method, an accounting condition calculation method and device. The conditional expression dynamic configuration method comprises the following steps: in response to a conditional expression creation request, displaying an expression editing page and determining a target application system by analyzing the conditional expression creation request; identifying an editing item configured by a user through the expression editing page; creating a single conditional expression according to an internal operator, a source code of an object parameter, a condition value type and a condition value constant; if multiple single conditional expressions are identified, identifying a logical operator and a combination symbol configured by the user for connecting the single conditional expressions; constructing the single conditional expressions into a conditional expression according to the logical operator, the combination symbol and the order of the single conditional expressions; associating an identification code with the conditional expression; and saving the conditional expression to an expression database corresponding to the target application system. The application can dynamically configure a conditional expression according to the demand of accounting work to perform conditional calculation.

Provided herein is a process that converts unprotected data into protected data based on permissions defined using logical operators. As such, user permissions can be managed with a simple string of data. In one example, the method may include receiving a request for data from a user device, identifying a permission object corresponding to the user device, retrieving a string comprising a logical expression with a logical operator and one or more values from the permission object, wherein the logical expression defines access permissions of the user device with respect to a database, executing a database query on the database based on the request to generate results, and filtering the results from the database query based on the logical expression to generate filtered results and outputting the filtered results to the user device.

The embodiment of the invention discloses a data processing method and device, a storage medium and electronic equipment, and the method comprises the steps: obtaining a target search processing language code in a rule operation and maintenance scene from a code analysis input interface, determining a target logic operator corresponding to the target search processing language code and hierarchical relationship information corresponding to the target logic operator, determining a conditional clause corresponding to the target logic operator, and generating a code structure display graph based on the hierarchical relationship information, the target logic operator and the conditional clause, and displaying the code structure display diagram on the code analysis input interface. Therefore, the code structure display graph is generated through the hierarchical relationship information, the target logic operator and the condition clause, so that the target search processing language code is converted into a structure form which is convenient to understand and can be refined, the structure form is displayed in the code structure display graph, and safety analysts are helped to quickly understand the target search processing language code.