Skip to content
PatentBrief
Get alertsTop ↑

How Computers Calculate Probabilities in Large Knowledge Bases

A method for finding answers in a database of uncertain facts by ignoring probabilities to find a solution first, then calculating how likely that solution is based on the underlying evidence.

Granted 2016ActiveExpires 2029Owned by International Business Machines CorpInvented by Aditya Kalyanpur, Achille B. Fokoue-Nkoutche, Kavitha Srinivas + 1 more

Original patent title: “Large scale probabilistic ontology reasoning

Plain-English explanation by SahiLast reviewed · June 13, 2026

A method for finding answers in a database of uncertain facts by ignoring probabilities to find a solution first, then calculating how likely that solution is based on the underlying evidence. Granted to International Business Machines Corp in 2016 with 29 claims and 1 forward citation, and it is expected to expire in 2029.

Coverage

What does this patent actually cover?

This patent describes a way to query a knowledge base where facts (axioms) come with a probability score. Instead of trying to calculate complex probabilities for the entire database at once, the system first ignores the probability scores to find a logical solution using standard reasoning. Once it identifies the 'justification'—the minimal set of facts needed to prove that answer—it then applies the probability scores only to that specific subset. This makes it computationally efficient to determine the 'net probability' of a conclusion in massive datasets that would otherwise be too slow to process.

The gap

What does this patent NOT cover?

  • Does not cover calculating probabilities for the entire knowledge base simultaneously without first finding a logical justification.
  • Does not cover systems that lack a defined set of axioms or logical rules for deriving answers.
  • Does not cover non-probabilistic reasoning systems that treat all facts as 100% certain.

These exclusions are unique to PatentBrief — derived from the actual claim language, not patent-office boilerplate.

Key facts

Patent numberUS 9361579
StatusActive
FieldAI & Machine Learning
AssigneeInternational Business Machines Corp
InventorsAditya Kalyanpur, Achille B. Fokoue-Nkoutche, Kavitha Srinivas and 1 other
Filed2009
Granted2016
Expires2029
Claims29
Times cited1
LitigationNone on record
Value · $44K$140KMinimal

What made this novel

The innovation is the 'divide and conquer' strategy: by decoupling the search for a logical answer from the mathematical calculation of its certainty, the system avoids the exponential complexity of calculating probabilities for every possible combination of facts.

The Patent Drawing

Representative patent drawing for Large scale probabilistic ontology reasoning (US 9361579)
Representative figure · US 9361579All figures on Google Patents →
Large scale probabilistic onto…(Primary claim)ai mlsoftwaretelecommunications

Schematic visualization of the patent's claim structure. Hand-drawn diagrams in progress for each landmark patent.

Where you've seen this

Real-world examples

01

Enterprise knowledge graphs used for automated decision support

02

Semantic search engines that rank results based on probabilistic confidence

03

Medical diagnostic software evaluating symptoms with varying levels of clinical certainty

Why it matters

The bigger picture

As AI and expert systems deal with increasingly messy, real-world data, they often encounter conflicting or uncertain information. This approach allows developers to build systems that can provide 'likely' answers without getting bogged down in the massive mathematical overhead of traditional probabilistic modeling. It is a key technique for scaling semantic web technologies and enterprise knowledge graphs.

Filed

October 6, 2009

Granted

June 7, 2016

Market context

Who's building on this

Companies in this space

IBM remains a primary developer of these technologies, integrating them into their Watson and enterprise AI platforms. Other major cloud providers and database companies building graph-based AI systems also utilize similar techniques for handling uncertainty in large-scale data.

Market impact

This patent helped enable the transition from rigid, binary databases to more flexible, probabilistic systems. It allowed companies to build AI tools that can reason over 'fuzzy' data, which is essential for modern applications like automated customer service, fraud detection, and complex supply chain management.

Claim 1 — Plain English

What this patent covers

This patent describes a way to query a knowledge base where facts (axioms) come with a probability score. Instead of trying to calculate complex probabilities for the entire database at once, the system first ignores the probability scores to find a logical solution using standard reasoning. Once it identifies the 'justification'—the minimal set of facts needed to prove that answer—it then applies the probability scores only to that specific subset. This makes it computationally efficient to determine the 'net probability' of a conclusion in massive datasets that would otherwise be too slow to process.

The clever bit

The innovation is the 'divide and conquer' strategy: by decoupling the search for a logical answer from the mathematical calculation of its certainty, the system avoids the exponential complexity of calculating probabilities for every possible combination of facts.

What it does not cover

  • Does not cover calculating probabilities for the entire knowledge base simultaneously without first finding a logical justification.
  • Does not cover systems that lack a defined set of axioms or logical rules for deriving answers.
  • Does not cover non-probabilistic reasoning systems that treat all facts as 100% certain.

Patent timeline

Filing

Application submitted to the patent office

Publication

Application published, typically 18 months after filing

Grant

Patent officially issued

Expiration

Patent enters public domain

PatentBrief Score

Impact Score

Early stage

Citation count

6/40

Early citations

Claim breadth

19/20

Very broad protection

Recency

5/20

Granted 10–20 years ago

Assignee scale

0/20

Independent or smaller assigneeassigneeThe entity that owns the patent — usually the inventor's employer or a company.Read more →

PatentBrief Impact Score — based on citation count, claim breadth, recency, and assignee scale. Not a legal assessment.

Heuristic Value Estimate

What this patent might be worth

Minimal

$44K$140K

Midpoint $87K · 3.2 yr remaining · industry ×1.6

Adjust inputs →

Heuristic only — blends forward/backward citation counts, claim scope, time remaining, litigation history, and CPC-derived industry baseline. Real valuations need a professional appraisal.

Claim text not yet imported for this patent

The original legal language

Original claims

29 claims as filed with the patent office.

Concepts involved

ClaimPrior artNon-obviousnessNoveltySpecificationAssigneePatent term

Citations

Patent lineage

Cites earlier patents

6

earlier patents this invention cites as foundations

View prior art →

Cited by later patents

1

later patents that build on this invention

View patents →

Cite this patent

Kalyanpur, A., Fokoue-Nkoutche, A. B., Srinivas, K., & Schonberg, E. G. (2016). How Computers Calculate Probabilities in Large Knowledge Bases (U.S. Patent No. 9,361,579). U.S. Patent and Trademark Office. https://patentbrief.org/patent/us/9361579/large-scale-probabilistic-ontology-reasoning

Auto-generated from the patent record. Double-check author order and the issue date against the official USPTO document before submitting.

Embed

Add this patent to your site

Drop this plain-English patent card into any blog post or article — free, no signup. It always links back to the full breakdown here.

<div data-patentlens-widget data-patent-number="US9361579"></div>
<script src="https://patentbrief.org/embed.js" async></script>

Stay in the loop

Get a weekly digest of new patents.

One email per week. No spam. Unsubscribe anytime.

Keep exploring

Related patents you should know

US 4683195 · 1987

How to Make Billions of Copies of a DNA Segment

This patent describes the Polymerase Chain Reaction (PCR), a method to rapidly create many copies of a specific piece of DNA or RNA, enabling its detection and analysis.

Cetus Corp

US 8697359 · 2014

How to Edit Genes in Human Cells Using an Engineered CRISPR System

This patent describes an engineered CRISPR-Cas9 system for precisely cutting DNA in eukaryotic cells to change how genes work, opening the door for gene editing in complex organisms.

Massachusetts Institute of Technology

US 7657849 · 2010

How the iPhone's Slide-to-Unlock Gesture Works

Apple's 2010 patent describes unlocking a device by dragging a specific graphical image across the touchscreen along a predefined path, a gesture that became iconic with the original iPhone.

Apple Inc

US 4733665 · 1988

How Doctors Implant a Permanent Stent Using a Balloon

This patent describes the method for placing a permanent, expandable wire mesh tube inside a blood vessel or other body tube using a balloon-tipped catheter to widen it and keep it open.

Expandable Grafts Partnership

US 4965188 · 1990

How to Make Many Copies of a DNA Piece with Heat

This patent describes the Polymerase Chain Reaction (PCR) method, a technique to make millions of copies of a specific DNA segment using a heat-resistant enzyme and repeated temperature changes.

Cetus Corp

US 4235871 · 1980

How to Encapsulate Active Materials in Lipid Bubbles Efficiently

This patent describes a method for trapping biologically active substances inside tiny, multi-layered fat bubbles called liposomes, using a specific water-in-oil emulsion and gel-forming process to improve how much material gets captured.

Individual

Semantically similar

You might also find these interesting

SEARCH ALL

More to explore

More in AI & Machine Learning

Browse all AI & Machine Learning

New to patents?

What is a patent?How to read a patentAnatomy of a claimHow strong is this patent?What the citations meanWhat it doesn't coverPatent glossary
Explore the landscape:ai ml patents →software patents →telecommunications patents →

Common Questions

Frequently Asked Questions

What does How Computers Calculate Probabilities in Large Knowledge Bases cover?

A method for finding answers in a database of uncertain facts by ignoring probabilities to find a solution first, then calculating how likely that solution is based on the underlying evidence.

Who owns patent US 9361579?

International Business Machines Corp owns this patent, granted in 2016.

When does this patent expire?

This patent is expected to expire on October 6, 2029, when the invention enters the public domain.

What is patent US 9361579 cited by?

This patent has been cited by 1 later patents that build on its ideas.

What problem does this patent solve?

As AI and expert systems deal with increasingly messy, real-world data, they often encounter conflicting or uncertain information. This approach allows developers to build systems that can provide 'likely' answers without getting bogged down in the massive mathematical overhead of traditional probabilistic modeling. It is a key technique for scaling semantic web technologies and enterprise knowledge graphs.

What does this patent NOT cover?

Does not cover calculating probabilities for the entire knowledge base simultaneously without first finding a logical justification.

View all →
US 11645473·2023

How AI Predicts Who Will Speak Next in a Conversation

US 10318876·2019

How AI Systems Adjust Their Behavior Based on User Mood

US 10140638·2018

How Cloud Services Automatically Switch Providers When One Fails

US 9959544·2018

How a Server Updates Smart Card Apps and Shows Ads

Patent monitoring

Get notified when International Business Machines Corp files a new patent

Get notified when this company files a new patent. Weekly digest · Confirm via email · Unsubscribe anytime.

Last reviewed: June 13, 2026 · PatentBrief is not a law firm and this is not legal advice.