IP Library › Granted Patent US 12,608,589
Granted Patent B2
US 12,608,589 · App. 17/807,909 · Granted Apr 21, 2026

Detecting and correcting knowledge base errors

Inventors: Ndivhuwo Makondo (Pretoria, ZA); Francois Pierre Luus (Wierdapark, ZA); Naweed Aghmad Khan (Johannesburg, ZA); Ismail Yunus Akhalwaya (Emmarentia, ZA); Ryan Nelson Riegel (Carrollton, GA); Oarabile Hope Moloko (Mahikeng, ZA); Thabang Doreen Lebese (Johannesburg, ZA)
Assignee: International Business Machines Corporation
G06N3/042G06N5/046
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,608,589
App. No.
17/807,909
Granted
Apr 21, 2026
Kind
B2
Abstract

A computer-implemented method may include processors configured for receiving input data corresponding to a knowledge base comprising a plurality of propositional logic clauses, generating output data corresponding to a first set of logical rules and a first set of facts based on the plurality of propositional logic clauses, accumulating the first set of facts to generate accumulated facts, generating a model graph based on the accumulated facts and the first set of logical rules, alternating reasoning and learning passes at the model graph until convergence to generate a second set of logical rules and a second set of facts, and generating a third set of logical rules and a third set of facts, wherein the third set of logical rules and the third set of facts exceed a first predetermined threshold.

Claims (79)

1 . A computer-implemented method comprising:

receiving, by one or more processors, input data corresponding to a knowledge base, the input data including a plurality of propositional logic clauses;

generating, by one or more processors, output data corresponding to a first set of logical rules and a first set of facts based on the plurality of propositional logic clauses;

accumulating, by one or more processors, the first set of facts to generate accumulated facts;

generating, by one or more processors, a logical neural network (LNN) graph based on the accumulated facts and the first set of logical rules, wherein the LNN graph comprises neurons corresponding to the plurality of propositional logic clauses and provides one-to-one correspondence between the neurons and logical elements represented in the plurality of propositional logic clauses;

alternating, by one or more processors, reasoning and learning passes at the LNN graph until convergence to generate a second set of logical rules and a second set of facts;

generating, by one or more processors, a third set of logical rules and a third set of facts, wherein the third set of logical rules and the third set of facts exceed a first predetermined threshold; and

correcting, by one or more processors, errors in the knowledge base by updating the knowledge base to include the third set of logical rules and the third set of facts.

2 . The computer-implemented method of claim 1 , wherein the input data corresponding to the knowledge base further comprises an external labeled dataset aligned with the knowledge base.

3 . The computer-implemented method of claim 1 , wherein generating the output data further comprises:

receiving, by one or more processors, the input data;

processing, by one or more processors, the input data to identify each of the plurality of propositional logic clauses;

extracting, by one or more processors, the first set of logical rules and the first set of facts from the plurality of propositional logic clauses; and

transmitting, by one or more processors, the first set of logical rules and the first set of facts as the output data.

4 . The computer-implemented method of claim 1 , wherein generating the LNN graph further comprises:

generating, by one or more processors, a graphical representation of first order logic statements corresponding to syntax trees representing the accumulated facts with the corresponding first set of logical rules; and

displaying, by one or more processors, the graphical representation as the LNN graph on a user interface of a computing device.

5 . The computer-implemented method of claim 1 , further comprising:

extracting, by one or more processors, truth values from the knowledge base; and

determining, by one or more processors, truth value bounds based on the truth values.

6 . The computer-implemented method of claim 5 , wherein alternating the reasoning and learning passes at the LNN graph until convergence further comprises:

applying, by one or more processors, the truth value bounds to the LNN graph to allow an open world assumption that some of the second set of logical rules and the second set of facts are true even if the second set of logical rules and the second set of facts are unknown and unprovable.

7 . The computer-implemented method of claim 1 , further comprising:

generating, by one or more processors, a fourth set of logical rules and a fourth set of facts, wherein the fourth set of logical rules and the fourth set of facts exceed a second predetermined threshold.

8 . The computer-implemented method of claim 1 , wherein alternating the reasoning and the learning passes at the LNN graph until convergence comprises:

receiving, by one or more processors, training data; and

processing, by one or more processors, the training data by:

performing, by one or more processors, the reasoning by iteratively tightening bounds until convergence, wherein each inference computation, for any node in the LNN graph, results in a selection from the group consisting of: a tighter bounds and remain same; and

subsequent to performing the reasoning, performing, by one or more processors, gradient descent to inform how parameters of the LNN graph are to be updated.

9 . A computer program product comprising:

one or more computer readable storage media; and

program instructions stored on the one or more computer readable storage media to perform operations comprising:

receiving input data corresponding to a knowledge base, the input data including a plurality of propositional logic clauses;

generating output data corresponding to a first set of logical rules and a first set of facts based on the plurality of propositional logic clauses;

accumulating the first set of facts to generate accumulated facts;

generating a logical neural network (LNN) graph based on the accumulated facts and the first set of logical rules, wherein the LNN graph comprises neurons corresponding to the plurality of propositional logic clauses and provides one-to-one correspondence between the neurons and logical elements represented in the plurality of propositional logic clauses;

alternating reasoning and learning passes at the LNN graph until convergence to generate a second set of logical rules and a second set of facts;

generating a third set of logical rules and a third set of facts, wherein the third set of logical rules and the third set of facts exceed a first predetermined threshold; and

correcting errors in the knowledge base by updating the knowledge base to include the third set of logical rules and the third set of facts.

10 . The computer program product of claim 9 , wherein the input data corresponding to the knowledge base further comprises an external labeled dataset aligned with the knowledge base.

11 . The computer program product of claim 9 , wherein the generating the output data further comprises:

receiving the input data;

processing the input data to identify each of the plurality of propositional logic clauses;

extracting the first set of logical rules and the first set of facts from the plurality of propositional logic clauses; and

transmitting the first set of logical rules and the first set of facts as the output data.

12 . The computer program product of claim 9 , wherein the generating the LNN graph further comprises:

generating a graphical representation of first order logic statements corresponding to syntax trees representing the accumulated facts with the corresponding first set of logical rules; and

displaying the graphical representation as the LNN graph on a user interface of a computing device.

13 . The computer program product of claim 9 , wherein the operations further comprise:

extracting truth values from the knowledge base; and

determining truth value bounds based on the truth values.

14 . The computer program product of claim 13 , wherein alternating the reasoning and learning passes at the LNN graph until convergence further comprises:

applying the truth value bounds to the LNN graph to allow an open world assumption that some of the second set of logical rules and the second set of facts are true even if the second set of logical rules and the second set of facts are unknown and unprovable.

15 . The computer program product of claim 9 , wherein the operations further comprise:

generating a fourth set of logical rules and a fourth set of facts, wherein the fourth set of logical rules and the fourth set of facts exceed a second predetermined threshold.

16 . A computer system comprising:

a processor set;

one or more computer readable storage media; and

program instructions stored on the one or more computer readable storage media to cause the processor set to perform operations comprising:

receiving input data corresponding to a knowledge base, the input data including a plurality of propositional logic clauses;

generating output data corresponding to a first set of logical rules and a first set of facts based on the plurality of propositional logic clauses;

accumulating the first set of facts to generate accumulated facts;

generating a logical neural network (LNN) graph based on the accumulated facts and the first set of logical rules, wherein the LNN graph comprises neurons corresponding to the plurality of propositional logic clauses and provides one-to-one correspondence between the neurons and logical elements represented in the plurality of propositional logic clauses;

alternating reasoning and learning passes at the LNN graph until convergence to generate a second set of logical rules and a second set of facts;

generating a third set of logical rules and a third set of facts, wherein the third set of logical rules and the third set of facts exceed a first predetermined threshold; and

correcting errors in the knowledge base by updating the knowledge base to include the third set of logical rules and the third set of facts.

17 . The computer system of claim 16 , wherein the input data corresponding to the knowledge base further comprises an external labeled dataset aligned with the knowledge base.

18 . The computer system of claim 16 , wherein the generating the output data further comprises:

receiving the input data;

processing the input data to identify each of the plurality of propositional logic clauses;

extracting the first set of logical rules and the first set of facts from the plurality of propositional logic clauses; and

transmitting the first set of logical rules and the first set of facts as the output data.

19 . The computer system of claim 16 , wherein the generating the LNN graph further comprises:

generating a graphical representation of first order logic statements corresponding to syntax trees representing the accumulated facts with the corresponding first set of logical rules; and

displaying the graphical representation as the LNN graph on a user interface of a computing device.

20 . The computer system of claim 15 , wherein the operations further comprise:

extracting truth values from the knowledge base; and

determining truth value bounds based on the truth values, wherein alternating the reasoning and learning passes at the LNN graph until convergence further comprises:

applying the truth value bounds to the LNN graph to allow an open world assumption that some of the second set of logical rules and the second set of facts are true even if the second set of logical rules and the second set of facts are not known or provable.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 21, 2022
From: MAKONDO, NDIVHUWO; LUUS, FRANCOIS PIERRE; KHAN, NAWEED AGHMAD; AKHALWAYA, ISMAIL YUNUS; RIEGEL, RYAN NELSON; MOLOKO, OARABILE HOPE; LEBESE, THABANG DOREEN
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 060259/0297 →
Continuity (1)
Related Publication 20230409872A1 · Dec 21, 2023
References Cited (22)
US 10013450B2 · Clark · 2018 [cited by applicant]
US 20100198831A1 · Feng · 2010 [cited by applicant]
US 20130117202A1 · Malka · 2013 [cited by applicant]
US 20130117219A1 · Malka · 2013 [cited by applicant]
US 20170177651A1 · Ellis · 2017 [cited by applicant]
US 20170228402A1 · Kumar · 2017 [cited by applicant]
US 20180300649A1 · Lee · 2018 [cited by applicant]
US 20190026638A1 · Zhang · 2019 [cited by applicant]
US 20220351059A1 · Hoang · 2022 [cited by examiner]
ZA 202212627B · 2023 [cited by applicant]
Riegel et al., “Logical Neural Networks”, Jun. 23, 2020, arXiv:2006.13155v1, pp. 1-48. (Year: 2020). [cited by examiner]
Qian et al., “Logical Credal Networks”, Sep. 25, 2021, arXiv:2109.12240v1, pp. 1-11. (Year: 2021). [cited by examiner]
Chen et al., “Neural symbolic reasoning with knowledge graphs: Knowledge extraction, relational reasoning, and inconsistency checking”, Fundamental Research I (2021), 9 pages, <https://www.sciencedirect.com/science/arti… [cited by applicant]
Chen et al., “Correcting Knowledge Base Asertions.” ArXiv, Cornell University, arXiv:2001.06917, Jan. 19, 2020, 12 pages, <https://arxiv.org/abs/2001.06917>. [cited by applicant]
Galarraga et al., “AMIE: Association Rule Mining under Incomplete Evidence in Ontological Knowledge Bases”, Proceedings of the International World Wide Web Conference Committee (IW3C2), May 13-17, 2013, Rio de Janeiro, … [cited by applicant]
Hogan et al. “Knowledge Graphs.” arXiv, Cornell University, arXiv 2003.02320, Sep. 11, 2021, 135 pages, <https://arxiv.org/pdf/2003.02320.pdf>. [cited by applicant]
Melo et al., “An Approach to Correction of Erroneous Links in Knowledge Graphs”, Proceedings of the 9th International Conference on Knowledge Capture (K-CAP2017), Dec. 4-6, 2017, Austin, Texas, 4 pages, <https://www.sem… [cited by applicant]
Melo et al., “Automatic detection of relation assertion errors and induction of relation constraints”, Semantic Web-1 (2020) 1-30, <https://content.iospress.com/articles/semantic-web/sw200369>. [cited by applicant]
Paulheim, Heiko, “Knowledge graph refinement: A survey of approaches and evaluation methods.” Semantic web 8.3 (2017): 489-508, <http://www.semantic-web-journal.net/system/files/swj1167.pdf>. [cited by applicant]
Riegel et al., “Logical Neural Networks”, Arxiv, Cornell University, arXiv:2006.13155, Jun. 23, 2020, 48 pages, <https://arxiv.org/abs/2006.13155>. [cited by applicant]
Tanon et al., “Learning how to correct a knowledge base from the edit history.” Proceedings of the World Wide Web Conference, May 13, 2019, San Francisco, California, 11 pages, <https://thomas.pellissier-tanon.fr/papers… [cited by applicant]
Tanon et al., “Neural Knowledge Base Repairs”, Proceedings of the European Semantic Web Conference, Jun. 2021 (virtual), Hersonissos, Greece, 17 pages, <https://hal.archives-ouvertes.fr/hal-03325101/>. [cited by applicant]