34 results about "Logical formula" patented technology

Verifying large language model responses involves obtaining a query and its corresponding answer from a large language model. This conversational text is then fed into a second large language model, which translates the answer into first-order logic. The verification process uses an automated theorem prover. It checks the validity of this logic translation by determining the unsatisfiability of two scenarios: one where the negation of the logic translation and domain-specific logic formulas are combined, and another where the logic translation itself is combined with these formulas. Based on this analysis, the theorem prover ascertains whether the translated answer is valid, invalid, or neither. The final step is communicating this verification status through an appropriate output medium, such as a graphical user interface, a database, or a report, providing a structured and methodical approach to assessing the accuracy and reliability of language model responses.

Verifying large language model responses involves obtaining a query and its corresponding answer from a large language model. This conversational text is then fed into a second large language model, which translates the answer into first-order logic. The verification process uses an automated theorem prover. It checks the validity of this logic translation by determining the unsatisfiability of two scenarios: one where the negation of the logic translation and domain-specific logic formulas are combined, and another where the logic translation itself is combined with these formulas. Based on this analysis, the theorem prover ascertains whether the translated answer is valid, invalid, or neither. The final step is communicating this verification status through an appropriate output medium, such as a graphical user interface, a database, or a report, providing a structured and methodical approach to assessing the accuracy and reliability of language model responses.

The invention belongs to a specification mining technology of software engineering, and relates to a construction method of an approximate specification mining model and a software behavior verification system. The construction method comprises the following steps: generating a group of linear temporal logic LTL formulas for describing positive example time sequence attributes according to a positive example set; using an LTL formula to generate a potential negative example for evaluation and training; designing and constructing a neural network for analyzing the finite state automaton from the parameter assignment so as to simulate an acceptance behavior of the finite state automaton; and iteratively searching the neural network through a gradient descent algorithm until the maximum number of iterations is reached, and mining to obtain the finite state automaton. The neural network can simulate acceptance of the finite state automaton in the reasoning process, the finite state automaton can be explained at low cost, and the problem of search space explosion is solved.

To provide an autonomous testing device for generating an object description described in a time-phase logic expression, and autonomously performing a test using the generated object description related to autonomous performance when a test object is changed in model checking.SOLUTION: An autonomous testing device 100 for executing model testing is provided with a test execution determining unit 90 and a time-phase logic expression generating unit 50. The test execution determining unit 90 determines whether or not to execute a test for a test target by using a test execution status for a target function and product update information that is information indicating the version of the target function. The time-phase logic expression generating unit 50 generates the object description of a time-phase logic expression by using multiplicity information indicating the multiplicity of each stereotype corresponding to each product included in the test object, metamodel information indicating the relationship between each operand name and each stereotype, and pattern information indicating the relationship between a template of the time-phase logic expression and a description rule of the object of the time-phase logic expression.SELECTED DRAWING: Figure 1

This application discloses a puzzle generation method, apparatus, device, and readable storage medium. The method obtains a structured specification representation and seed parameters of a seed puzzle; generates a new problem using the seed parameters and the structured specification representation; verifies the accuracy of the structured specification representation using the new problem; if accurate, uses a puzzle generator to load the structured specification representation, reorganize the logical formula, and randomly sample specified data according to defined constraints to obtain a SMT problem; after verifying the SMT problem's logical reliability and solvability using a solver, obtains new configuration parameters based on the SMT problem; fills the new configuration parameters into the structured specification representation and renders it using a natural language template to obtain a target puzzle with a problem instance and a standard answer. This application, through pre-coding, reproducing, and verifying puzzles, can automatically generate accurate and reliable new puzzles in batches.

The invention discloses a method for constructing and verifying buffer areas in a C + + standard I / O library based on an MSVL (modeling, simulation and verification language), which comprises the following steps of: 1, respectively performing formalized construction on an output buffer area and an input buffer area in the C + + standard I / O library through the MSVL to obtain a constructed input buffer area and a constructed output buffer area; 2, respectively describing expected properties of the output buffer area and the input buffer area through a plurality of preset proposition projection sequential logic formulas, wherein the expected properties comprise read-write safety, read-write sequence consistency and empty / full state correctness; and 3, respectively verifying whether the constructed input buffer area and the constructed output buffer area meet expected properties or not through a UMC4M verifier and a plurality of propositional projection sequential logic formulas. According to the method, the limitation that all code paths are difficult to cover in a traditional test method can be effectively avoided, so that the accuracy of verifying the safety and reliability of the buffer area is improved.

The temporal logic formula generation device 1X mainly includes a target relation logical formula generation means 331X and a target relation logical formula integration means 332X. The target relation logical formula generation means 331X is configured to generate, based on object-to-object relation information representing a relation between objects in a target state relating to a task of the robot, one or more target relation logical formulas that are temporal logic formulas representing relations, in the target state, between respective pair(s) of objects between which the relation is defined. The target relation logical formula integration means 332X is configured to generate a temporal logic formula into which the target relation logical formulas are integrated.

The invention discloses a side channel attack-oriented fine-grained security tracking model modeling method and system. The method comprises the following steps of: defining a sensitive tag; constructing a side channel tracking logic formula of the basic logic gate according to the input and output signals and the truth table of the corresponding sensitive tag; logic information in a circuit to be modeled is extracted, and a time label is added to each signal in the logic information; adding the basic logic gate and side channel tracking logic formulas of other gate-level structures to a side channel tracking logic library; mapping the logic information of the circuit to be modeled to a side channel tracking logic library, adding a side channel tracking logic formula for each logic unit of the circuit to be modeled, and generating a safety tracking model; verifying whether all logic units of the security tracking model generate corresponding side channel tracking logic expressions or not; solving the safety tracking model by using a Z3 solver, and generating a leakage path; the method has the advantage that the information leakage path is accurately positioned.

A logical formula generation device 100 according to the present invention comprises: a planning means 121 for, on the basis of background knowledge information indicating a rule of inference, input information to be subjected to an inference process by the rule of inference, an inference schema indicating an inference method in the inference process, and a concept schema indicating a concept to be addressed in the inference process, generating a logical conversion protocol for converting the background knowledge information and the input information to a logical formula; and a conversion means 122 for converting the background knowledge information and the input information to a logical formula on the basis of the generated logical conversion protocol.

A model checking system detects violations and conflicts in security and verification policies by running model checking processes. The system detects privilege escalation attacks in misconfigured identification and access management (“IAM”) policies by modeling security policy documents and IAM actions as logical formulas and then running model checking on the model. The system translates non-Boolean variables, such as string variables, into Boolean variables in order to apply an SAT model checker. The model checker also determines whether a policy violation can be achieved in a finite number of steps by elevating privileges of some compromised principal over multiple iterations of the model checking process, or proves absence thereof.

The present invention is a method for determining Boolean satisfiability based on linear programming, belonging to the field of logic circuits, and includes the following steps: S1: Extract a Boolean propositional logic formula; S2: Convert it into an equisatisfiable CNF Boolean logic formula; S3: Convert it into a 3-SAT problem in CNF form; S4: Convert it into a 1-in-3-SAT problem; S5: Equivalently convert it into an optimal value size problem of a linear programming; S6: Set the solution accuracy for the problem of solving the optimal value of the linear programming; S7: Solve the optimal value of the linear programming problem and determine the satisfiability of the Boolean propositional logic formula according to the size of the optimal value; S8: For the satisfiable Boolean propositional logic formula, recursively add constraints to the linear programming problem and solve it to obtain a solution to the satisfiable problem. The present invention realizes fast determination under polynomial time complexity, can improve the efficiency of determination, and save energy.

A constraint condition learning device 1X mainly includes a conversion means 15X and a constraint condition estimation means 16X. The conversion means 15X converts first time series data regarding a state and an input of a robot system during an execution period of a task executed by the robot system into second time series data represented by propositions. The constraint condition estimation means 16X estimates a constraint condition on the task as a logical formula, based on the second time series data and the information regarding whether or not the task succeeded.

Techniques are disclosed for generating defeating textual replies. A computer-implemented method generates a first communicative discourse tree from an utterance and as second communicative discourse tree from a candidate answer derived from a search of keywords in the utterance. The method translates the first communicative discourse tree into a first logical formula from and the second communicative discourse tree into a second logical formula. The method determines that the first logical formula is a negation of the second logical formula. The method further provides the candidate answer to a user device responsive to the determining.

A model checking system detects violations and conflicts in security and verification policies by running model checking processes. The system detects privilege escalation attacks in misconfigured identification and access management (“IAM”) policies by modeling security policy documents and IAM actions as logical formulas and then running model checking on the model. The system translates non-Boolean variables, such as string variables, into Boolean variables in order to apply an SAT model checker. The model checker also determines whether a policy violation can be achieved in a finite number of steps by elevating privileges of some compromised principal over multiple iterations of the model checking process, or proves absence thereof.

In one embodiment, a method comprises: parsing, using a large language model, a constraint satisfaction problem statement into a sequence of sentences corresponding to a plurality of individual problem sentences and a plurality of individual answer choices; invoking respective primitives from a set of logical-linguistic primitive functions to iteratively process i) each of the plurality of individual problem sentences to establish a respective problem constraint with accompanying arguments and ii) each of the plurality of individual answer choices to establish a respective answer choice constraint with accompanying arguments; storing, during invoking, the respective problem constraints into an aggregate list of problem constraints; and solving, after completion of the aggregate list of problem constraints, the constraint satisfaction problem statement as a validity output for each answer choice constraint given the aggregate list of problem constraints.

The invention discloses a real-time linear dynamic logic synthesis method and system based on a limited path. The method comprises the following steps: firstly, constructing a real-time linear dynamic logic formula and an environment control variable set based on an atomic proposition; a variable and a time sequence operator in the logic formula are separated and converted into a reverse Polish expression to be stored in a stack; constructing a tester of the sub-formulas from bottom to top; calculating a migration relation, a termination condition and an initial condition based on a tester, and obtaining a necessary state set; determining an initial state by combining the inevitable state set and the initial condition; and circularly processing the environment control variable set, simplifying the state through full name elimination and existence elimination, updating the inevitable state set, and combining the inevitable state set with the migration relationship to ensure that the inevitable state can be entered under the condition of meeting the migration constraint condition. According to the method, a necessary state set is calculated by constructing and processing a real-time linear dynamic logic formula and an environment control variable, and a path for ensuring that a traffic participant safely arrives at a destination is generated in real time.

This invention discloses a method for automatically generating power system anti-misoperation logic formulas, comprising: acquiring Public Information Model (CIM) data of target sites in a power system; matching power equipment with a first logical relationship data table in an anti-misoperation logic knowledge base to determine the location feature information corresponding to the power equipment; matching the location feature information corresponding to the power equipment with a second logical relationship data table in multiple logical relationship data tables to determine multiple logical rule description information corresponding to the power equipment; matching the multiple logical rule description information corresponding to the power equipment with a third logical relationship data table in multiple logical relationship data tables to generate logical rule element information corresponding to the power equipment; and combining the logical rule element information matched by each power equipment according to a preset format to obtain the anti-misoperation logic formula for the target site. This invention solves the problems of low generation efficiency and accuracy of anti-misoperation logic formulas, and inconvenience in maintenance, modification, and review.

The application discloses a project whole-process penetration control method and system based on multi-source data fusion, and relates to the technical field of engineering project risk control and time sequence logic formal verification. The method comprises the following steps: acquiring a control instruction generated by a multi-agent cooperation system; extracting an attention weight distribution in an inference process to lock a target subgraph in a fusion knowledge graph, and cutting a global compliance rule to obtain a local formal context according to the target subgraph; mapping numerical variables in the local formal context into interval logic operators and constructing a local linear time sequence logic formula; and performing safety verification on the formula, and executing the control instruction when the formula passes the safety verification. The application is used to solve the problems of instruction illusion risk caused by the probabilistic decision of the generative model and the calculation space explosion caused by the global system state verification.

A system for converting natural language (NL) requirements of an aerospace system to formalize to control a landing gear system of an aircraft using a large language model (LLM) includes a processor and a memory including instructions that, when executed by the processor, convert the NL requirements into formalities to control the landing gear system of the aircraft. The system is caused to use at least the LLM to revise the received NL expressions associated with the requirements of the aerospace system. The LLM is further configured to replace at least one word in the revised NL expression with a lifting atomic entity to generate an underlying sentence structure and convert the underlying sentence structure into a lifting logic. The LLM is also used for basic improvement of the logical expression and conversion of the NL expression into formalized requirements of an aerospace system. The system also controls the aerospace system based on the formal demand.

The invention relates to an intelligent generation method and system of a test script for anti-error dynamic checking of a transformer substation. The method comprises the following steps: extracting the content of a transformer substation locking logic diagram or an anti-error acceptance card and generating an anti-error logic formula in a fixed format; generating an operation ticket covering forward and reverse total acceptance on the basis of an anti-error logic formula; searching a path or a point number matched with each description object in the operation order in the 103 communication text, the 104 point table or the SCD configuration file through the text matching large model, and associating the paths or the point numbers, so as to generate a first version of substation anti-error dynamic checking test script; and performing self-inspection on the primary version of the substation anti-error dynamic checking test script, thereby obtaining the accurate substation anti-error dynamic checking test script. The system comprises an anti-misoperation locking logic analysis module, an anti-misoperation operation ticket automatic generation module, a three-remote signal automatic association module and an anti-misoperation checking script self-checking module which are connected in sequence. The anti-error dynamic checking quality of the transformer substation can be guaranteed, and the checking efficiency is improved.

A system for using large language models (LLMs) to convert natural language (NL) requirements for aerospace systems to formalism for controlling a landing gear system of an aircraft includes a processor and a memory including instructions which, when executed by the processor, causes the system at least to perform using an LLM to revise a received NL expression associated with a requirement for an aerospace system. An LLM is also used to replace at least one word in the revised NL expression with a lifted atomic entity to generate an underlying sentence structure and translate the underlying sentence structure to a lifted logical formula. An LLM is also used to ground the lifted logical formula and to convert the NL expression into a formalized requirement for the aerospace system. The system also controls the aerospace system based on the formalized requirement.

The present application relates to a kind of test script intelligent generation method and system of substation anti-misoperation dynamic check.Test method is: the content of substation interlocking logic diagram or anti-misoperation acceptance card is extracted and the anti-misoperation logic formula of fixed format is generated;Operation order is generated based on the anti-misoperation logic formula and covers positive and negative direction full acceptance;Through text matching large model, in 103 communication text, 104 point table or SCD configuration file, the path or point number matched with each description object in operation order is found and associated, to generate the first edition substation anti-misoperation dynamic check test script;Self-check is carried out to the first edition substation anti-misoperation dynamic check test script, to obtain accurate substation anti-misoperation dynamic check test script.The system includes anti-misoperation interlocking logic analysis module, anti-misoperation operation order automatic generation module, three remote signal automatic association module, anti-misoperation check script self-checking module connected in turn.The present application can guarantee the quality of substation anti-misoperation dynamic check, improve check efficiency.

A method for managing an Operational Design Domain (ODD) expansion for an Automated Driving System (ADS) of a vehicle is disclosed. The method includes: obtaining a plurality of scenario parameters defining the environment of the vehicle, wherein each scenario parameter corresponds to a respective condition of the ODD; in response to the plurality of scenario parameters fulfilling the plurality of ODD conditions: allowing the ADS to be activated or to remain active; if not: querying a logic formula based on the obtained plurality of scenario parameters, such that if at least one soft constraint of the logical formula is satisfied without violating any hard constraints of the logical formula, and allowing the ADS to be activated in a degraded mode by limiting one or more variable state parameters of the ADS to conform to the determined set of values of the one or more variable state parameters.

The application discloses a kind of based on big model's safety key software verification property automatic generation method, comprising: extracting subject and predicate from each atomic proposition, the subject and predicate extracted are merged, and the atomic proposition after reorganization is obtained;Define non-standard natural language type template;According to the defined non-standard natural language type template, the reorganized atomic proposition is combined with logic operator using random algorithm, to generate signal timing logic formula;And using big language model, it is translated into natural language, to build the data set containing formula-natural language pair;According to the situation, use the data set containing formula-natural language pair to fine-tune local big model or big language model interface, obtain the big model after fine-tuning;Using prompt word template, the natural language requirement to be translated is input into the big model after fine-tuning, to obtain corresponding timing logic formula.

The invention relates to the technical field of safety verification of robot operating systems, in particular to a robot monitoring node automatic generation method based on a structured natural language. The method comprises the following steps: acquiring a structured natural language monitoring requirement; analyzing and converting the data into a probability sequential logic formula and a variable mapping relation; verifying whether the variable exists in the target data stream framework or not; and automatically generating a monitoring node capable of running in the data stream framework based on the verified formula and the mapping relation. And when the monitoring node runs, monitoring variable update, and only triggering conformity judgment of the correlation formula. The problems that in the prior art, requirement conversion is difficult, monitoring logic and a platform are strongly coupled, and execution time is unpredictable are solved, and requirement unambiguous formalization and monitoring code full-automatic generation are achieved.

Embodiments provide graphical representations of logical formulae. An example embodiment includes, based on logical scopes from a logical formula, partitioning a graphical space using one or more graphical elements. Tables are placed in the graphical spaced partitioned. At least one table placed includes a table reference based on the logical scopes and a table attribute based on predicates from the logical formula. Based on the predicates and the logical scopes, at least one connection is displayed between the tables placed. The at least one connection indicates a given predicate, and a logical scope of the given predicate is independent of endpoints of the at least one connection. The graphical space partitioned, the tables placed, and the at least one connection displayed provide a graphical representation of the logical formula. Embodiments may provide diagrammatic representations of queries including disjunctions, aggregations, or assignments for human and machine use.

A system for using large language models (LLMs) to convert natural language (NL) requirements for aerospace systems to formalism for controlling a landing gear system of an aircraft includes a processor and a memory including instructions which, when executed by the processor, causes the system at least to perform using an LLM to revise a received NL expression associated with a requirement for an aerospace system. An LLM is also used to replace at least one word in the revised NL expression with a lifted atomic entity to generate an underlying sentence structure and translate the underlying sentence structure to a lifted logical formula. An LLM is also used to ground the lifted logical formula and to convert the NL expression into a formalized requirement for the aerospace system. The system also controls the aerospace system based on the formalized requirement.

The application provides a kind of explainable fault diagnosis system and method of discrete event system, adopts the calculation mode of combining off-line construction fault diagnosis device and on-line fault diagnosis, while fusing field expert knowledge, according to the possible mode of system fault given by field expert, customizes limited linear time logic formula template, takes the historical operation log of system as sample, encodes fault diagnosis problem as satisfiability problem, obtains the explanation of each type of fault behavior of system: FLTL formula with the help of SAT solving technique.These FLTL formulas can form on-line fault diagnosis device on the one hand, and also provide the explanation and analysis of system fault, which can provide decision support for later system fault recovery and system improvement;Thus, the defect that existing DES fault diagnosis technology is difficult to provide explainable fault diagnosis is solved.

An analysis apparatus includes an inputter configured to receive an input of a first temporal logic formula and an input of a second temporal logic formula, and an outputter configured to output a screen for displaying a first block diagram showing the first temporal logic formula and a second block diagram showing the second temporal logic formula in a comparable manner.

In one embodiment, a method comprises: parsing, using a large language model, a constraint satisfaction problem statement into a sequence of sentences corresponding to a plurality of individual problem sentences and a plurality of individual answer choices; invoking respective primitives from a set of logical-linguistic primitive functions to iteratively process i) each of the plurality of individual problem sentences to establish a respective problem constraint with accompanying arguments and ii) each of the plurality of individual answer choices to establish a respective answer choice constraint with accompanying arguments; storing, during invoking, the respective problem constraints into an aggregate list of problem constraints; and solving, after completion of the aggregate list of problem constraints, the constraint satisfaction problem statement as a validity output for each answer choice constraint given the aggregate list of problem constraints.