37 results about "Predicate logic" patented technology

A system for enterprise information integration is described. The system is based on different layers: the data sources, source ontologies corresponding to the data schema of the data sources, an integration ontology integrating the different source ontologies, a level of query input, preferably in the form of a web service. Between the levels, mapping rules are used. These mapping rules and the entire system are based on predicate logic. The queries are answered with the help of the rules using inference based on predicate logic.

First order predicate logics are provided, extended with a bilattice based uncertainty handling formalism, as a means of formally encoding pattern grmmars, to parse a set of image features, and detect the presence of different patterns of interest implemented on a processor. Information from different sources and uncertainties from detections, are integrated within the bilattice framework. Automated logical rule weight learning in the computer vision domain applies a rule weight optimization method which casts the instantiated inference tree as a knowledge-based neural network, to converge upon a set of rule weights that give optimal performance within the bilattice framework. Applications are in (a) detecting the presence of humans under partial occlusions and (b) detecting large complex man made structures in satellite imagery (c) detection of spatio-temporal human and vehicular activities in video and (c) parsing of Graphical User Interfaces.

Methods, apparatus, and products are disclosed for security policy validation for web services that include: transforming a security policy for a web service into a policy predicate logic representation; providing a profile predicate logic representation that represents one or more rules of a security policy profile; and determining whether the security policy satisfies the security policy profile in dependence upon the policy predicate logic representation and the profile predicate logic representation.

The present invention discloses a network safety risk evaluating system based on game theory. The system firstly collects network property data which comprises information of node address, service, application program, software leak, etc. from an evaluated network, describes with a first-order predicate logic, reasons with an XSB reasoning engine based on the description of first-order predicate logic, and obtaining the leak which is on the evaluated network system and can be used by an attacker, and a corresponding attack threat. Aiming at each attack threat, the system according to the invention establishes a game theoretical attack-defense model GTADM and calculates the game equilibrium point. The obtained attack probability is multiplied to the expected damage value of the attack to the attack target for obtaining the attack risk to the system. Thereby the risk level of nodes in the evaluated system is obtained and the security evaluating to the network is realized.

Natural Language Understanding (NLU) is a complex open problem. NLU complexity is mainly related to semantics: abstraction, representation, real meaning, and computational complexity. While existing approaches can solve some specific problems, they do not address Natural Language problems in a natural way. This invention describes a Semantic Engine using Brain-Like approach (SEBLA) that uses Brain-Like algorithms to solve the key NLU problem (semantics and its sub-problems).

The main theme of SEBLA is to use each word as an object with all important features, most importantly the semantics. The next main theme is to use the semantics of each word to derive the meaning of a sentence as we do as humans. Similarly, the semantics of sentences are used to derive the meaning of a paragraph. The 3rd main theme is to use natural semantics as opposed to existing “mechanical semantics” used in Predicate logic, Ontology or the like.

The invention discloses a method and a device for discovering link layer network topology. The method comprises the following steps: acquiring an address forwarding table (AFT table) of the network node by a pinging link layer network node; deriving the connection relation between network nodes by a predicate logic inference algorithm according to connection reasoning technology and repairing incomplete inverse root AFT data to acquire a complete AFT table; and utilizing a spanning tree protocol algorithm to calculate each network node according to the complete AFT table acquired according tothe predicate logic inference algorithm so as to discover a physical network topology structure of the link layer. The method provided by the invention combined with the predicate logic inference algorithm of the connection reasoning technology and a spanning tree protocol-based topology discovery algorithm can calculate the network node information effectively under the condition that the AFT data is incomplete, thereby overcoming the shortages of the prior method for discovering the link layer network topology and improving the probability of acquiring the physical network topology.

The invention discloses a target domain knowledge base generation and question answering method and device, and the method comprises the steps: determining a concept graph, a reason graph and a predicate logic formula of target domain knowledge according to the knowledge type of the target domain knowledge; and generating a target domain knowledge base, wherein the concept map is used for representing a static relationship among the concept words, the factorial map is used for representing the sequence between the events and the factorial relationship between the events, and the predicate logic formula is used for representing business rules in the target domain knowledge. The question answering method comprises the steps that M events triggered by N word segmentation phrases of a questionare determined from an affair graph, and slot position values of slot positions of the M events are determined according to K word segmentation phrases, matched with a concept graph, in the N word segmentation phrases; a predicate logic formula corresponding to the consulting object of the question is calculated according to the M events and the slot values of the slots of the M events; an answerto the question is determined.

The invention discloses a homework correction device. The homework correction device comprises an input module, a recognition module, a knowledge base module, an inference rule base module, an automatic revising module, an automatic checking module, an automatic correction module and a recording module, wherein the input module is used for acquiring text information or picture information of homework to be corrected; the recognition module is used for recognizing the text information or picture information as knowledge points; the knowledge base module is used for expressing the knowledge points through predicate logic; the inference rule base module is used for establishing an inference rule according to the generally acknowledged truth, the theorem, the definition and the formula; the automatic revising module is used for discovering errors occurring in the solving process and obtaining the follow-up correct solving process through the backtracking technology; the automatic checkingmodule is used for checking the completeness of the solving process of students; the automatic correction module is used for calling the recognition module, the knowledge base module, the inference rule base module, the automatic revising module and the automatic checking module for automatically correcting and revising the homework, and storing the correction result; the recording module is usedfor recording the automatically revised part of the homework or the incomplete part in automatic checking, and the knowledge points and the inference rule relevant to the parts.

At least one pertinent authority, in ordinary English language, is paraphrased into a series of intermediate forms. The at least one pertinent authority is at least one of a tax authority and an accounting authority. The series of intermediate forms are rendered into a corresponding series of logical statements. The series of logical statements are encoded into relations in a logic programming language.

Pertinent natural language authority documents are translated into corresponding statements in a system of predicate logic which statements are encoded into relations in a programming language. The authority documents are indexed into an electronic database to facilitate subsequent searching. User-entered query terms and/or query terms derived from pertinent prose are obtained, specifying at least one of a tax problem and an accounting problem; based on same, the electronic database is searched to locate applicable authority(ies). A comparison and inference engine executing on at least one hardware processor is activated to apply applicable relations in the programming language to a problem ascertainable from the query, to obtain a conclusion by applying derivation rules in the system of predicate logic. The conclusion is presented to a decision maker.

Information cluster systems and methods are presented. In one embodiment, a cluster method comprises: performing an engine process including issuing requests to bring a resource online, offline, and monitor the resources, wherein the engine process is performed by an engine; performing a resource interaction process including interacting with a resource and directing a resource to comply with the request from the engine process, wherein the resource interaction process is performed by a resource interaction agent; performing a predicate logic process including performing predicate logic operations to determine if a predicate logic condition associated with the resource is satisfied and forwarding an indication of the results of the predicate logic operations to the engine process, wherein the predicate logic process is performed by a predicate logic agent that is separate from the engine performing the engine process.

The invention discloses a control instruction classification method based on a semantic network, and aims to construct a computer readable structured control instruction and provide a basis for automatic processing of the control instruction, and form a predicate logic structure to provide a basis for realizing a knowledge reasoning system. By processing an unstructured control instruction, the method can realize the following auxiliary functions: extracting information carried by a basic control term appearing in the control instruction; extracting action, state and other information of the aircraft and performing analog simulation; and forming computer readable structured information to provide data for knowledge reasoning. According to the method, aiming at the condition that a complexcontrol instruction comprises a plurality of control intentions, whether different arguments in the control instruction are associated with verbs of the different control intentions or not is judged through a deep neural network, and the associated verbs and argument words are brought into a semantic network for semantic role marking.

A predicate-logic retrieval system includes a predicate-logic retrieving section for receiving a predicate query and a metamodel-element built-in predicate (MMEBIP) storage section storing therein MMBEIPs and get-functions in association. If a predicate query includes a MMEBIP, the predicate-logic retrieval system retrieves a get-function from the MMBIP storage section, uses the get-function to retrieve predicate data from a repository storing therein data in a metamodel format, and executes variable identification for the predicate thus retrieved.

The invention provides a dialogue response method and device, and relates to the field of terminal artificial intelligence (AI), in particular to the field of voice recognition. The method comprises the steps of obtaining a to-be-recognized dialogue text; converting the dialogue text into a predicate formula according to a preset predicate logic rule, wherein the predicate formula is used for describing semantics of the dialogue text; determining at least one intention described in the dialogue text according to the predicate formula; and executing a dialogue operation indicated by the at least one intention.

The invention discloses a predicate logic-based standard reconstruction representation method. The method specifically comprises the following steps of 1, segmenting a standard entry into multiple clauses; 2, performing normalization processing on the clauses obtained in the step 1; and 3, performing symbolic processing on clause components processed in the step 2, and storing a processing resultin a computer. The Chinese building standard entry can be subjected to digital expression, so that the problems of computer storage and identification of design standards at present are solved.

The invention relates to an automatic analysis system for malicious code behaviors. The system comprises a full-system simulator, a symbol execution module, a path analysis module, a path selection module, a malicious behavior analysis module, a control flow analysis module and an effective input set analysis module, wherein the symbol execution module finds a branch dependent on a symbol variablein a binary malicious code and then generates path judgment predicate logic. The path analysis module analyzes the path judgment predicate logic, generates a new execution path and adds the new execution path into the path storage pool; the path selection module carries out priority setting on paths in the path storage pool; the control flow analysis module generates and continuously updates a control flow graph CFG; the malicious behavior analysis module extracts malicious behavior characteristics and structural characteristics realized by the associated code segment; the effective input setanalysis module finds out an input value set which enables the malicious behavior program to execute according to a specific path. The invention provides an efficient malicious code behavior automatic analysis system.

Pertinent natural language authority documents are translated into corresponding statements in a system of predicate logic which statements are encoded into relations in a programming language. The authority documents are indexed into an electronic database to facilitate subsequent searching. User-entered query terms and/or query terms derived from pertinent prose are obtained, specifying at least one of a tax problem and an accounting problem; based on same, the electronic database is searched to locate applicable authority(ies). A comparison and inference engine executing on at least one hardware processor is activated to apply applicable relations in the programming language to a problem ascertainable from the query, to obtain a conclusion by applying derivation rules in the system of predicate logic. The conclusion is presented to a decision maker.

A verification system includes at least one memory configured to store instructions; and at least one processor configured to execute the instructions to: receive, as input, a mathematical model obtained by converting a model indicating a configuration of a test object system into a predicate in predicate logic and create a proposition indicating that the test object system satisfies a performance requirement represented by the predicate; and verify whether or not a proof of the proposition having been created is true.

The invention discloses a semantic solidification and derivation method based on public predicate logic, which comprises the following steps of: 1) selecting or designing a semantic unit X for an automaton A to form a semantic unit set {X} and a corresponding data state set {D}; 2) performing digital feature acquisition on each semantic unit in {X} and calculating an index value of each semantic unit to obtain a semantic unit index set {HX} and a digital feature set {SignX}; performing digital feature acquisition on each data state in the data state {D} and calculating an index value of each data state to obtain a data state index set {HD} and a digital feature set {SignD}; (3) respectively taking {HX} and {HD} as input to carry out a calculation mode so as to obtain a root RootA of the automaton A; and (4) the A'starts the automaton A through the RootA, all semantic units and data states of the automaton A are obtained for driving, and therefore the requirement for the automaton A is obtained.