×

Efficient probabilistic reasoning over semantic data

  • US 8,751,433 B2
  • Filed: 12/15/2010
  • Issued: 06/10/2014
  • Est. Priority Date: 12/15/2010
  • Status: Expired due to Fees
First Claim
Patent Images

1. A method for performing probabilistic reasoning over a semantic graph, the semantic graph formed by a plurality of concepts connected together via probabilistic assertions, the method comprising:

  • receiving a query at a computing device;

    identifying, by the computing device, edges within the semantic graph that can be collapsed based on one or more collapsing rules, to provide identified edges, wherein;

    the identified edges belong to at least one path through the semantic graph that addresses the query, andsaid one or more collapsing rules include a series-type collapsing rule specifying that two edges can be combined if the two edges are connected in series in a manner that is independent of other edges in the semantic graph;

    collapsing, by the computing device, the identified edges into a single edge having a resultant probability associated therewith;

    repeating, by the computing device, said identifying and said collapsing until no additional collapsible edges are identified in the semantic graph, to provide a remaining graph; and

    generating an answer to the query based on the remaining graph.

View all claims
  • 2 Assignments
Timeline View
Assignment View
    ×
    ×