Patents by Inventor Ian Horrocks

Ian Horrocks 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: 11994754
    Abstract: A method of fabricating a lens element for an adjustable power lens of the kind comprising two lens elements that are slidable relative to one other in a direction transverse the optical axis of the lens and have respective lens surfaces that are shaped to act together to form a corrective lens, the power of which varies according to the relative disposition of the two lens elements, the method comprising the steps of forming a lens puck having two opposite faces, which are shaped to form opposite lens surfaces of one of the lens elements of the adjustable power lens, the puck having at least one alignment feature, and thereafter edging the puck to a desired eye shape with reference to the alignment feature.
    Type: Grant
    Filed: July 9, 2021
    Date of Patent: May 28, 2024
    Assignee: ADLENS LTD
    Inventors: Robert Edward Stevens, Alex Edginton, Daniel Paul Rhodes, Martyn Francis Kenneally, Simon Peter Horrocks, Benjamin Ian Curnow
  • 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
  • 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