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: Methods, systems, and computer program products for extracting query-related temporal information from unstructured text documents are provided herein. A computer-implemented method includes obtaining at least one user query comprising one or more temporal components; converting at least a portion of the at least one user query into one or more logic form representations; mapping at least a portion of the one or more logic form representations to one or more portions of at least one source of unstructured text data; extracting temporal information, specific to the at least one user query, from one or more portions of the at least one source of unstructured text data based on the mapping; generating at least one response to the at least one user query based on the extracted temporal information; and performing one or more automated actions based on the at least one generated response.

Abstract: Systems and techniques that facilitate question answering via tailored knowledge induction are provided. In various embodiments, a system can access a natural language question. In various aspects, the system can identify an answer for the natural language question, based on a tailored knowledge graph iteratively generated from a set of structured sub-queries associated with the natural language question.

Abstract: A method implemented by a system for performing forward chaining using a property graph, the method includes generating, from an ontology, a simplified ontology that includes a set of sub-conditions connected through logical operators that are equivalent to the ontology. A state graph is created based on the simplified ontology. When a first assertion axiom (ABox) statement associated with the ontology is received, the first ABox statement is added to an instance graph based on the state graph. Inferred statements, if any, are derived based on connections between the instance graph and the state graph. The inferred statements are then stored with the first ABox statement. The state graph and the first ABox statement are stored in the property graph.

Abstract: Generally disclosed herein is an approach for enabling a substitute user to continue from the original user's saved participation state when the original user left an online multi-user event. The original user's state may be stored as a token. The stored token may be generated based on a plurality of parameters including, but not limited to, the user's role, achievement, skills, and position. The stored token may be sent with an invitation to multiple prospective substitute users. One of the prospective substitute users may accept the invitation by downloading the token. The accepted prospective substitute user may participate in the online multi-user event continuing from the original user's saved state.

Abstract: Methods, systems, and computer program products for partitioning and parallel loading of property graphs with constraints are provided herein. A computer-implemented method includes obtaining graph-related input data and corresponding constraint data, wherein the graph-related input data and corresponding constraint data are at least one of user-defined and input data model-based; generating at least one in-memory graph based at least in part on processing at least a portion of the obtained graph-related input data; partitioning the at least one in-memory graph into two or more sub-graphs by processing the at least one in-memory graph using one or more polynomial time partition algorithms; and generating at least one property graph by allocating, at least a portion of the two or more partitioned sub-graphs which satisfy the obtained constraint data, to two or more threads that run in parallel.

Abstract: Methods, systems, and computer program products for extracting query-related temporal information from unstructured text documents are provided herein. A computer-implemented method includes obtaining at least one user query comprising one or more temporal components; converting at least a portion of the at least one user query into one or more logic form representations; mapping at least a portion of the one or more logic form representations to one or more portions of at least one source of unstructured text data; extracting temporal information, specific to the at least one user query, from one or more portions of the at least one source of unstructured text data based on the mapping; generating at least one response to the at least one user query based on the extracted temporal information; and performing one or more automated actions based on the at least one generated response.

Abstract: Methods, systems, and computer program products for partitioning and parallel loading of property graphs with constraints are provided herein. A computer-implemented method includes obtaining graph-related input data and corresponding constraint data, wherein the graph-related input data and corresponding constraint data are at least one of user-defined and input data model-based; generating at least one in-memory graph based at least in part on processing at least a portion of the obtained graph-related input data; partitioning the at least one in-memory graph into two or more sub-graphs by processing the at least one in-memory graph using one or more polynomial time partition algorithms; and generating at least one property graph by allocating, at least a portion of the two or more partitioned sub-graphs which satisfy the obtained constraint data, to two or more threads that run in parallel.

Abstract: Methods, systems and computer program products for query processing are provided herein. A computer-implemented method includes receiving a first query from a user, determining whether the first query is capable of being answered using symbolic reasoning performed on data of a symbolic knowledge base, and executing the symbolic reasoning to generate a first query answer in response to a determination that the first query is capable of being answered using the symbolic reasoning. Axioms are extracted from a plurality of documents when it is determined that a second query is not capable of being answered using the symbolic reasoning. The method further includes determining whether the axioms are consistent with the symbolic knowledge base, and generating a second query answer based on the axioms in response to a determination that the one or more axioms are consistent with the symbolic knowledge base.

Abstract: Methods, systems, and computer program products for a collaborative cognition platform for creating and hosting social machines are provided herein. A computer-implemented method includes creating a social machine for collaborative tasks, wherein the social machine comprises (i) one or more human agents, (ii) one or more machine-based agents, (iii) an algorithm, and (iv) a set of rules prescribed for executing the collaborative tasks. The method also includes generating one or more collaborative resolutions for the collaborative tasks by executing, in an automated fashion, the collaborative tasks via implementation of the algorithm, wherein the algorithm facilitates, in accordance with the set of rules, systematic iterations of collaboration among (i) the one or more human agents and (ii) the one or more machine-based agents. Further, the method includes outputting the one or more collaborative resolutions to at least one user.

Abstract: Various embodiments provide for the creation and validation of resource templates that may be used to provision or launch resources or resource instances. In various embodiments, a user can use values for various resource instance parameters to create a resource template, and can request validation of that template. A validation service can perform multiple validations, including independent validation of all template parameters, as well as validations of cross-parameter dependencies. If any errors are detected that cause the template to be invalid, information for those errors can be returned to the user such that the user can make the appropriate changes to enable the template to be valid. Templates can be re-validated at future times, such as at launch time or for use with a new service, to ensure the template remains valid under those circumstances.

Abstract: Methods, systems, and computer program products for a collaborative cognition platform for creating and hosting social machines are provided herein. A computer-implemented method includes creating a social machine for collaborative tasks, wherein the social machine comprises (i) one or more human agents, (ii) one or more machine-based agents, (iii) an algorithm, and (iv) a set of rules prescribed for executing the collaborative tasks. The method also includes generating one or more collaborative resolutions for the collaborative tasks by executing, in an automated fashion, the collaborative tasks via implementation of the algorithm, wherein the algorithm facilitates, in accordance with the set of rules, systematic iterations of collaboration among (i) the one or more human agents and (ii) the one or more machine-based agents. Further, the method includes outputting the one or more collaborative resolutions to at least one user.

Abstract: Methods, systems and computer program products for query processing are provided herein. A computer-implemented method includes receiving a first query from a user, determining whether the first query is capable of being answered using symbolic reasoning performed on data of a symbolic knowledge base, and executing the symbolic reasoning to generate a first query answer in response to a determination that the first query is capable of being answered using the symbolic reasoning. Axioms are extracted from a plurality of documents when it is determined that a second query is not capable of being answered using the symbolic reasoning. The method further includes determining whether the axioms are consistent with the symbolic knowledge base, and generating a second query answer based on the axioms in response to a determination that the one or more axioms are consistent with the symbolic knowledge base.