Abstract: An apparatus comprises at least one processing device that includes a processor coupled to a memory. The at least one processing device is configured to receive natural language input from one or more user devices relating at least in part to data of one or more databases, to apply the natural language input to an artificial intelligence (AI) system, to generate in the AI system database code for the one or more databases based at least in part on the natural language input, and to execute the generated database code against at least a portion of the one or more databases. The natural language input may be received in association with a database query, which is decomposed into a sequence of processing steps formulated in natural language using corresponding text templates, and from which one or more prompts are generated for application to the AI system.

Abstract: A processing platform in illustrative embodiments comprises one or more processing devices each including at least one processor coupled to a memory. The processing platform is configured to obtain a text document containing at least one claim about data of a relational database. Claim keywords are extracted from the text document, and query fragments are identified based at least in part on indexing of one or more relational data sets of the relational database. The relevance of the claim keywords to the query fragments is determined, and candidate queries are identified based at least in part on probabilistic inferencing from the determined relevance of the claim keywords to the query fragments. The candidate queries are evaluated against the relational database, and consistency of the claim with the data of the relational database is determined based at least in part on results of the evaluation of the candidate queries.

Abstract: A processing platform in illustrative embodiments comprises one or more processing devices each including at least one processor coupled to a memory. The processing platform is configured to obtain a text document containing at least one claim about data of a relational database. Claim keywords are extracted from the text document, and query fragments are identified based at least in part on indexing of one or more relational data sets of the relational database. The relevance of the claim keywords to the query fragments is determined, and candidate queries are identified based at least in part on probabilistic inferencing from the determined relevance of the claim keywords to the query fragments. The candidate queries are evaluated against the relational database, and consistency of the claim with the data of the relational database is determined based at least in part on results of the evaluation of the candidate queries.

Abstract: Systems and methods for allowing analog Ising machines to be able to run Integer Linear Programming (“ILP”) problems, i.e. a compilation method for setting the state of the physical memory units, flexible to be adapted to each specific device. The method describes how variables and numeric parameters which specify the problem can be hard-coded (embedded and physically represented) in the hardware circuitry of the device in a deterministic way, with a pre-determined bound on the number of required physical spins to be used in the Ising device.

Abstract: Systems and methods for allowing analog Ising machines to be able to run Integer Linear Programming (“ILP”) problems, i.e. a compilation method for setting the state of the physical memory units, flexible to be adapted to each specific device. The method describes how variables and numeric parameters which specify the problem can be hard-coded (embedded and physically represented) in the hardware circuitry of the device in a deterministic way, with a pre-determined bound on the number of required physical spins to be used in the Ising device.