Patents by Inventor Boris Motik

Boris Motik has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 11645278
    Abstract: A program stored on non-transitory computer-readable storage medium executes a method of evaluating a graph over a query. Decomposition instructions decompose the query into a plurality of subqueries. Evaluation instructions evaluate a subquery of the plurality of subqueries and generate a substitution multiset representing a result of the evaluation of the subquery. Filtration instructions or expansion instructions may operate upon the generated substitution set before passing the substitution set to a next subquery to be evaluated. The filtration instructions identify one or more mappings in the substitution multiset that cannot be safely passed to the second subquery and delete the identified one or more mappings from the substitution multiset. The expansion instructions determine, in a case where the subquery is operated upon by a non-distributive query operator, an expansion of the substitution multiset based at least on adding one or more new substitutions to the substitution multiset.
    Type: Grant
    Filed: October 27, 2021
    Date of Patent: May 9, 2023
    Assignee: OXFORD SEMANTIC TECHNOLOGIES LIMITED
    Inventors: Boris Motik, Yavor Nenov, Ian Horrocks
  • Patent number: 11409698
    Abstract: A computer-implemented method of providing a materialisation of a set of logical rules on a logical database comprising a set of logical facts. Each of a plurality of parallel processing threads performs the following steps. A logical fact that has not previously been received by any thread is received by the thread. By applying any of the logical rules to the received logical fact and/or any of the logical facts received by any thread prior to the received logical fact, the thread determines whether a new logical fact is implied, and if so the new logical fact is added to the set of logical facts. The thread then repeats the above steps on any further logical facts in the set of logical facts that have not previously been received by any thread. When all threads are waiting for a new logical fact, the method has completed.
    Type: Grant
    Filed: September 18, 2020
    Date of Patent: August 9, 2022
    Assignee: OXFORD UNIVERSITY INNOVATION LIMITED
    Inventors: Boris Motik, Yavor Nenov, Ian Horrocks
  • Publication number: 20220067042
    Abstract: A program stored on non-transitory computer-readable storage medium executes a method of evaluating a graph over a query. Decomposition instructions decompose the query into a plurality of subqueries. Evaluation instructions evaluate a subquery of the plurality of subqueries and generate a substitution multiset representing a result of the evaluation of the subquery. Filtration instructions or expansion instructions may operate upon the generated substitution set before passing the substitution set to a next subquery to be evaluated. The filtration instructions identify one or more mappings in the substitution multiset that cannot be safely passed to the second subquery and delete the identified one or more mappings from the substitution multiset. The expansion instructions determine, in a case where the subquery is operated upon by a non-distributive query operator, an expansion of the substitution multiset based at least on adding one or more new substitutions to the substitution multiset.
    Type: Application
    Filed: October 27, 2021
    Publication date: March 3, 2022
    Inventors: Boris Motik, Yavor Nenov, Ian Horrocks
  • Patent number: 11216456
    Abstract: A program stored on non-transitory computer-readable storage medium executes a method of evaluating a graph over a query. Decomposition instructions decompose the query into a plurality of subqueries. Evaluation instructions evaluate a subquery of the plurality of subqueries and generate a substitution multiset representing a result of the evaluation of the subquery. Filtration instructions or expansion instructions may operate upon the generated substitution set before passing the substitution set to a next subquery to be evaluated. The filtration instructions identify one or more mappings in the substitution multiset that cannot be safely passed to the second subquery and delete the identified one or more mappings from the substitution multiset. The expansion instructions determine, in a case where the subquery is operated upon by a non-distributive query operator, an expansion of the substitution multiset based at least on adding one or more new substitutions to the substitution multiset.
    Type: Grant
    Filed: August 26, 2020
    Date of Patent: January 4, 2022
    Assignee: OXFORD SEMANTIC TECHNOLOGIES LIMITED
    Inventors: Boris Motik, Yavor Nenov, Ian Horrocks
  • Patent number: 11068657
    Abstract: In a computer system, systems and methods for automatically answering natural language questions using deep semantics are provided. Methods include receiving a natural language question, mapping it into one or more deductive database queries that captures one or more intents behind the question, computing one or more result sets of the question using one or more deductive database queries and a deductive database and providing one or more result sets. Systems include natural language question compilers and deductive databases. The natural language question compiler is configured to receive a natural language question and map it into one or more deductive database queries that capture one or more intents behind the question. The deductive database is configured to receive the mapped one or more deductive database queries, compute one or more result sets of the question using the one or more deductive database queries, and provide one or more result sets.
    Type: Grant
    Filed: June 28, 2011
    Date of Patent: July 20, 2021
    Assignee: SKYSCANNER LIMITED
    Inventors: Boris Motik, Sergio Antonio Berná Niñerola, Pablo Castellanos Garcia, Carlos González-Cadenas
  • Publication number: 20210004351
    Abstract: A computer-implemented method of providing a materialisation of a set of logical rules on a logical database comprising a set of logical facts. Each of a plurality of parallel processing threads performs the following steps. A logical fact that has not previously been received by any thread is received by the thread. By applying any of the logical rules to the received logical fact and/or any of the logical facts received by any thread prior to the received logical fact, the thread determines whether a new logical fact is implied, and if so the new logical fact is added to the set of logical facts. The thread then repeats the above steps on any further logical facts in the set of logical facts that have not previously been received by any thread. When all threads are waiting for a new logical fact, the method has completed.
    Type: Application
    Filed: September 18, 2020
    Publication date: January 7, 2021
    Inventors: Boris Motik, Yavor Nenov, Ian Horrocks
  • Patent number: 10817467
    Abstract: A computer-implemented method of providing a materialisation of a set of logical rules on a logical database comprising a set of logical facts. Each of a plurality of parallel processing threads performs the following steps. A logical fact that has not previously been received by any thread is received by the thread. By applying any of the logical rules to the received logical fact and/or any of the logical facts received by any thread prior to the received logical fact, the thread determines whether a new logical fact is implied, and if so the new logical fact is added to the set of logical facts. The thread then repeats the above steps on any further logical facts in the set of logical facts that have not previously been received by any thread. When all threads are waiting for a new logical fact, the method has completed.
    Type: Grant
    Filed: October 30, 2014
    Date of Patent: October 27, 2020
    Inventors: Boris Motik, Yavor Nenov, Ian Horrocks
  • Patent number: 10373214
    Abstract: A method includes generating a delta price and generating a final price using the delta price. A process and system provide an ability to determine a product's final price with a selected set of features in which multiple configurations are to be generated. The ability to determine such final prices can be based on the ability to determine the change in price between one configuration of a product and that of another product configuration (e.g. the product configured with the desired feature(s)). A customer is able to select one or more features, and so view the effect on the product's final price, as well as compare the prices (and incremental price differences) between various configurations of a given product. This increases the likelihood of the purchase being made, because it provides the potential purchaser with the final price earlier in the sales cycle.
    Type: Grant
    Filed: November 7, 2016
    Date of Patent: August 6, 2019
    Assignee: Versata Development Group, Inc.
    Inventors: Thomas J. Carter, III, Meetesh M. Karia, August R. Buerkle, Boris Motik, Ramanathan Ramadass, Reuben Swartz
  • Patent number: 9519907
    Abstract: A method includes generating a delta price and generating a final price using the delta price. A process and system provide an ability to determine a product's final price with a selected set of features in which multiple configurations are to be generated. The ability to determine such final prices can be based on the ability to determine the change in price between one configuration of a product and that of another product configuration (e.g. the product configured with the desired feature(s)). A customer is able to select one or more features, and so view the effect on the product's final price, as well as compare the prices (and incremental price differences) between various configurations of a given product. This increases the likelihood of the purchase being made, because it provides the potential purchaser with the final price earlier in the sales cycle.
    Type: Grant
    Filed: August 28, 2009
    Date of Patent: December 13, 2016
    Assignee: Versata Development Group, Inc.
    Inventors: Thomas J. Carter, III, Meetesh M. Karia, August R. Buerkle, Boris Motik, Ramanathan Ramadass, Reuben Swartz
  • Publication number: 20160259796
    Abstract: A computer-implemented method of providing a materialisation of a set of logical rules on a logical database comprising a set of logical facts. Each of a plurality of parallel processing threads performs the following steps. A logical fact that has not previously been received by any thread is received by the thread. By applying any of the logical rules to the received logical fact and/or any of the logical facts received by any thread prior to the received logical fact, the thread determines whether a new logical fact is implied, and if so the new logical fact is added to the set of logical facts. The thread then repeats the above steps on any further logical facts in the set of logical facts that have not previously been received by any thread. When all threads are waiting for a new logical fact, the method has completed.
    Type: Application
    Filed: October 30, 2014
    Publication date: September 8, 2016
    Inventors: Boris Motik, Yavor Nenov, Ian Horricks
  • Publication number: 20110320187
    Abstract: In a computer system, systems and methods for automatically answering natural language questions using deep semantics are provided. Methods include receiving a natural language question, mapping it into one or more deductive database queries that captures one or more intents behind the question, computing one or more result sets of the question using one or more deductive database queries and a deductive database and providing one or more result sets. Systems include natural language question compilers and deductive databases. The natural language question compiler is configured to receive a natural language question and map it into one or more deductive database queries that capture one or more intents behind the question. The deductive database is configured to receive the mapped one or more deductive database queries, compute one or more result sets of the question using the one or more deductive database queries, and provide one or more result sets.
    Type: Application
    Filed: June 28, 2011
    Publication date: December 29, 2011
    Applicant: ExperienceOn Ventures S.L.
    Inventors: Boris Motik, Sergio Antonio Berná Niñerola, Pablo Castellanos Garcia, Carlos González-Cadenas
  • Publication number: 20090327166
    Abstract: A method of generating a price is disclosed. The method includes generating a delta price and generating a final price using the delta price.
    Type: Application
    Filed: August 28, 2009
    Publication date: December 31, 2009
    Inventors: Thomas J. Carter, III, Meetesh M. Karia, August R. Buerkle, Boris Motik, Ramanathan Ramadass, Reuben Swartz
  • Patent number: 7584155
    Abstract: A method includes generating a delta price and generating a final price using the delta price. A process and system provide an ability to determine a product's final price with a selected set of features in which multiple configurations are to be generated. The ability to determine such final prices can be based on the ability to determine the change in price between one configuration of a product and that of another product configuration (e.g. the product configured with the desired feature(s)). A customer is able to select one or more features, and so view the effect on the product's final price, as well as compare the prices (and incremental price differences) between various configurations of a given product. This increases the likelihood of the purchase being made, because it provides the potential purchaser with the final price earlier in the sales cycle.
    Type: Grant
    Filed: February 1, 2002
    Date of Patent: September 1, 2009
    Assignee: Trilogy Development Group, Inc.
    Inventors: Thomas J. Carter, III, Meetesh M. Karia, August R. Buerkle, Boris Motik, Ramanathan Ramadass, Reuben Swartz