Methods and systems for graph computing with hybrid reasoning

11645,566

16/812743

March 09, 2020

Embodiments for graph computing are provided. A graph including a plurality explicit nodes and at least one implicit node is generated. A first of the plurality of explicit nodes and a second of the plurality of explicit nodes are traversed between utilizing deductive reasoning. A third of the plurality of explicit nodes and a fourth of the plurality of explicit nodes are traversed between through the at least one implicit node utilizing inductive reasoning.

INTERNATIONAL BUSINESS MACHINES CORPORATION (Armonk, NY, US)

INTERNATIONAL BUSINESS MACHINES CORPORATION (Armonk, NY, US)

1. A method for graph computing, by a processor, comprising: generating a graph including a plurality of explicit nodes and at least one implicit node; traversing between a first of the plurality of explicit nodes and a second of the plurality of explicit nodes utilizing deductive reasoning; responsive to determining no additional traversals may be performed in the graph utilizing only the deductive reasoning, computing a probability threshold that a relevant inference may be generated via allowance of a traversal between a third of the plurality of explicit nodes and a fourth of the plurality of explicit nodes through the at least one implicit node utilizing inductive reasoning, wherein the probability threshold is based on multiple independent sources of information validating the generation of the relevant inference, and responsive to determining that the probability threshold has been surpassed, traversing between the third of the plurality of explicit nodes and the fourth of the plurality of explicit nodes through the at least one implicit node utilizing the inductive reasoning.

2. The method of claim 1 , further comprising: receiving a query associated with the graph; and generating a response to the query based on the traversing between the first of the plurality of explicit nodes and the second of the plurality of explicit nodes and the traversing between the third of the plurality of explicit nodes and the fourth of the plurality of explicit nodes.

3. The method of claim 1 , wherein the at least one implicit node includes a plurality of implicit nodes.

4. The method of claim 3 , wherein the traversing between the third of the plurality of explicit nodes and the fourth of the plurality of explicit nodes includes a first traversal from the third of the plurality of explicit nodes to the fourth of the plurality of explicit nodes through a first of the plurality of implicit nodes utilizing inductive reasoning and a second traversal from the third of the plurality of explicit nodes to the fourth of the plurality of explicit nodes through a second of the plurality of implicit nodes utilizing inductive reasoning, wherein the first traversal is external to the second of the plurality of implicit nodes and the second traversal is external to the first of the plurality of implicit nodes.

5. The method of claim 3 , wherein the traversing between the third of the plurality of explicit nodes and the fourth of the plurality of explicit nodes includes traversing from the third of the plurality of explicit nodes through a first of the plurality of implicit nodes to a second of the plurality of implicit nodes utilizing inductive reasoning and traversing from the second of the plurality of implicit nodes to the fourth of the plurality of explicit nodes utilizing inductive reasoning.

6. The method of claim 1 , wherein the generating of the graph includes receiving user input associated with the at least one implicit node and generating the at least one implicit node based on the user input.

7. The method of claim 1 , wherein the traversing between the third of the plurality of explicit nodes and the fourth of the plurality of explicit nodes through the at least one implicit node is performed utilizing probabilistic inductive reasoning.

8. A system for graph computing comprising: a processor executing instructions stored in a memory device, wherein the processor: generates a graph including a plurality of explicit nodes and at least one implicit node; traverses between a first of the plurality of explicit nodes and a second of the plurality of explicit nodes utilizing deductive reasoning; responsive to determining no additional traversals may be performed in the graph utilizing only the deductive reasoning, computes a probability threshold that a relevant inference may be generated via allowance of a traversal between a third of the plurality of explicit nodes and a fourth of the plurality of explicit nodes through the at least one implicit node utilizing inductive reasoning, wherein the probability threshold is based on multiple independent sources of information validating the generation of the relevant inference, and responsive to determining that the probability threshold has been surpassed, traverses between the third of the plurality of explicit nodes and the fourth of the plurality of explicit nodes through the at least one implicit node utilizing the inductive reasoning.

9. The system of claim 8 , wherein the processor further: receives a query associated with the graph; and generates a response to the query based on the traversing between the first of the plurality of explicit nodes and the second of the plurality of explicit nodes and the traversing between the third of the plurality of explicit nodes and the fourth of the plurality of explicit nodes.

10. The system of claim 8 , wherein the at least one implicit node includes a plurality of implicit nodes.

11. The system of claim 10 , wherein the traversing between the third of the plurality of explicit nodes and the fourth of the plurality of explicit nodes includes a first traversal from the third of the plurality of explicit nodes to the fourth of the plurality of explicit nodes through a first of the plurality of implicit nodes utilizing inductive reasoning and a second traversal from the third of the plurality of explicit nodes to the fourth of the plurality of explicit nodes through a second of the plurality of implicit nodes utilizing inductive reasoning, wherein the first traversal is external to the second of the plurality of implicit nodes and the second traversal is external to the first of the plurality of implicit nodes.

12. The system of claim 10 , wherein the traversing between the third of the plurality of explicit nodes and the fourth of the plurality of explicit nodes includes traversing from the third of the plurality of explicit nodes through a first of the plurality of implicit nodes to a second of the plurality of implicit nodes utilizing inductive reasoning and traversing from the second of the plurality of implicit nodes to the fourth of the plurality of explicit nodes utilizing inductive reasoning.

13. The system of claim 8 , wherein the generating of the graph includes receiving user input associated with the at least one implicit node and generating the at least one implicit node based on the user input.

14. The system of claim 8 , wherein the traversing between the third of the plurality of explicit nodes and the fourth of the plurality of explicit nodes through the at least one implicit node is performed utilizing probabilistic inductive reasoning.

15. A computer program product for graph computing, by a processor, the computer program product embodied on a non-transitory computer-readable storage medium having computer-readable program code portions stored therein, the computer-readable program code portions comprising: an executable portion that generates a graph including a plurality of explicit nodes and at least one implicit node; an executable portion that traverses between a first of the plurality of explicit nodes and a second of the plurality of explicit nodes utilizing deductive reasoning; an executable portion that, responsive to determining no additional traversals may be performed in the graph utilizing only the deductive reasoning, computes a probability threshold that a relevant inference may be generated via allowance of a traversal between a third of the plurality of explicit nodes and a fourth of the plurality of explicit nodes through the at least one implicit node utilizing inductive reasoning, wherein the probability threshold is based on multiple independent sources of information validating the generation of the relevant inference, and an executable portion that, responsive to determining that the probability threshold has been surpassed, traverses between the third of the plurality of explicit nodes and the fourth of the plurality of explicit nodes through the at least one implicit node utilizing the inductive reasoning.

16. The computer program product of claim 15 , wherein the computer-readable program code portions further include: an executable portion that receives a query associated with the graph; and an executable portion that generates a response to the query based on the traversing between the first of the plurality of explicit nodes and the second of the plurality of explicit nodes and the traversing between the third of the plurality of explicit nodes and the fourth of the plurality of explicit nodes.

17. The computer program product of claim 15 , wherein the at least one implicit node includes a plurality of implicit nodes.

18. The computer program product of claim 17 , wherein the traversing between the third of the plurality of explicit nodes and the fourth of the plurality of explicit nodes includes a first traversal from the third of the plurality of explicit nodes to the fourth of the plurality of explicit nodes through a first of the plurality of implicit nodes utilizing inductive reasoning and a second traversal from the third of the plurality of explicit nodes to the fourth of the plurality of explicit nodes through a second of the plurality of implicit nodes utilizing inductive reasoning, wherein the first traversal is external to the second of the plurality of implicit nodes and the second traversal is external to the first of the plurality of implicit nodes.

19. The computer program product of claim 17 , wherein the traversing between the third of the plurality of explicit nodes and the fourth of the plurality of explicit nodes includes traversing from the third of the plurality of explicit nodes through a first of the plurality of implicit nodes to a second of the plurality of implicit nodes utilizing inductive reasoning and traversing from the second of the plurality of implicit nodes to the fourth of the plurality of explicit nodes utilizing inductive reasoning.

20. The computer program product of claim 15 , wherein the generating of the graph includes receiving user input associated with the at least one implicit node and generating the at least one implicit node based on the user input.

21. The computer program product of claim 15 , wherein the traversing between the third of the plurality of explicit nodes and the fourth of the plurality of explicit nodes through the at least one implicit node is performed utilizing probabilistic inductive reasoning.

6120297 September 2000 Morse, III et al.
9275333 March 2016 Santos et al.
20130066823 March 2013 Sweeney
20140129504 May 2014 Soon-Shiong
20150106158 April 2015 Raman
20180011927 January 2018 Lee et al.
20190220524 July 2019 Costabello et al.
20190236215 August 2019 Agarwal
20190244122 August 2019 Li et al.
20200159753 May 2020 Lee
20200226156 July 2020 Borra
20210173711 June 2021 Crabtree
112018007932 June 2021
2019022505 January 2019

“Building More Explainable Artificial Intelligence with Argumentation”, Zeng et al., 2018, Association for the Advancement of Artificial Intelligence(2 Pages). cited by applicant

edspgr.11645566