Abstract: An embodiment includes non-deterministic agent state transition behavior specification, monitoring, and correction. An embodiment establishes an agent, wherein the agent is configured to output text in response to input text. The embodiment defines an agent behavior specification for the agent. The embodiment inputs a text input to the agent and monitors the text output of the agent to detect an incorrect state transition, wherein the incorrect state transition comprises a state transition that deviates from the agent behavior specification. The embodiment applies a correction to the output text to create a corrected output text upon detecting the incorrect state transition. The embodiment reverts the agent to a previous state, the previous state preceding the state corresponding to the incorrect state transition detected. The embodiment inputs the corrected output text to the agent in the previous state to cause future behavior of the agent to align with the agent behavior specification.

Abstract: A decoder of a neural semantic parser receives input data associated with a natural language expression. An action is selected from a queue of actions, the queue of actions storing at least one action, the action being associated with an element from vocabulary of the natural language expression. The selected action is processed to build a tree structure where the processing of the selected action expands the tree structure with a node representing the element, where the tree structure is expanded bottom-up. A set of new actions is generated based on the node associated with the selected action and the vocabulary. The set of new actions is added to the queue of actions. The decoder repeats selecting, processing, generating and adding until a criterion is met. A logical form of the natural language expression is output based on the tree structure.

Abstract: Examples described herein provide a computer-implemented method that includes setting a sampling step size and a constant value as parameters to solve a theorem proving problem. The method further includes performing a first sampling step starting with an initial state of the theorem proving problem and limited by the sampling step size. The method further includes determining whether the theorem proving problem is solved. The method further includes, responsive to determining that the theorem proving problem is not solved, increasing the sampling step size based on the constant value to define an increased sampling step size. The method further includes performing a second sampling step limited by the increased sampling step size.

Abstract: One or more systems, devices, computer program products and/or computer-implemented methods of use provided herein relate to scalable learning of latent language structure with logical offline cycle consistency. The computer-implemented system can comprise a memory that can store computer executable components. The computer-implemented system can further comprise a processor that can execute the computer executable components stored in the memory, wherein the computer executable components can comprise a training component that can train a semantic parser to predict one or more parses for an input text using offline reinforcement learning based on parallelizable offline sampling.

Abstract: A system can comprise a memory that stores computer executable components, and a processor, operably coupled to the memory, that executes the computer executable components comprising: a linking component that associates one or more unmasked elements of the logical form with one or more corresponding structured knowledge elements of a knowledge base and a prediction component that predicts the one or more masked elements based on extended context of the corresponding structured knowledge elements of the knowledge base to generate one or more predicted elements. In an embodiment, the prediction component predicts the one or more masked elements based on scores of one or more candidate elements. In an embodiment, the system can determine one or more rules that describe the natural language text segment in terms of the structured knowledge elements and associated weights of the knowledge base paths.

Abstract: Systems and techniques that facilitate name-invariant graph neural representations for automated theorem proving are provided. In various embodiments, a system can access a set of first directed acyclic graphs respectively representing a conjecture and a set of axioms. In various aspects, the system can generate, via execution of at least one neural-guided automated theorem prover that independently processes the set of first directed acyclic graphs, a proof for the conjecture. In various instances, the at least one neural-guided automated theorem prover can leverage, for a node representing a non-logical symbol name present in more than one of the set of first directed acyclic graphs, a name-invariant learned embedding based on a second directed acyclic graph that is an aggregation of the set of first directed acyclic graphs.

Abstract: A decoder of a neural semantic parser receives input data associated with a natural language expression. An action is selected from a queue of actions, the queue of actions storing at least one action, the action being associated with an element from vocabulary of the natural language expression. The selected action is processed to build a tree structure where the processing of the selected action expands the tree structure with a node representing the element, where the tree structure is expanded bottom-up. A set of new actions is generated based on the node associated with the selected action and the vocabulary. The set of new actions is added to the queue of actions. The decoder repeats selecting, processing, generating and adding until a criterion is met. A logical form of the natural language expression is output based on the tree structure.

Abstract: Generate, from a logical formula, a directed acyclic graph having a plurality of nodes and a plurality of edges. Assign an initial embedding to each mode and edge, to one of a plurality of layers. Compute a plurality of initial node states by using feed-forward networks, and construct cross-dependent embeddings between conjecture node embeddings and premise node embeddings. Topologically sort the DAG with the initial embeddings and node states. Beginning from a lowest rank, compute layer-by-layer embedding updates for each of the plurality of layers until a root is reached. Assign the embedding update for the root node as a final embedding for the DAG. Provide the final embedding for the DAG as input to a machine learning system, and carry out the automatic theorem proving with same.

Abstract: Systems, computer-implemented methods, and computer program products that can facilitate encoding a tree data structure into a vector based on a set of constraints are provided. According to an embodiment, a system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise a constraint former that can form a set of constraints based on a first tree data structure and a vector encoder that can encode the first tree data structure into a vector based on the set of constraints.

Abstract: Generate, from a logical formula, a directed acyclic graph having a plurality of nodes and a plurality of edges. Assign an initial embedding to each mode and edge, to one of a plurality of layers. Compute a plurality of initial node states by using feed-forward networks, and construct cross-dependent embeddings between conjecture node embeddings and premise node embeddings. Topologically sort the DAG with the initial embeddings and node states. Beginning from a lowest rank, compute layer-by-layer embedding updates for each of the plurality of layers until a root is reached. Assign the embedding update for the root node as a final embedding for the DAG. Provide the final embedding for the DAG as input to a machine learning system, and carry out the automatic theorem proving with same.

Abstract: Systems, computer-implemented methods, and computer program products that can facilitate encoding a tree data structure into a vector based on a set of constraints are provided. According to an embodiment, a system can comprise a memory that stores computer executable components and a processor that executes the computer executable components stored in the memory. The computer executable components can comprise a constraint former that can form a set of constraints based on a first tree data structure and a vector encoder that can encode the first tree data structure into a vector based on the set of constraints.