US 12,124,808 B2
Computer implemented method for the automated analysis or use of data
William Tunstall-Pedoe, Cambridgeshire (GB); Finlay Curran, Cambridgeshire (GB); Harry Roscoe, Cambridgeshire (GB); and Robert Heywood, Cambridgeshire (GB)
Assigned to UNLIKELY ARTIFICIAL INTELLIGENCE LIMTED, Cambridgeshire (GB)
Filed by UNLIKELY ARTIFICIAL INTELLIGENCE LIMITED, Cambridgeshire (GB)
Filed on Nov. 22, 2023, as Appl. No. 18/517,688.
Application 18/517,688 is a continuation of application No. 18/469,128, filed on Sep. 18, 2023.
Application 18/469,128 is a continuation of application No. 18/088,574, filed on Dec. 25, 2022, granted, now 11,763,096.
Application 18/088,574 is a continuation of application No. 18/001,368, previously published as PCT/GB2021/052196, filed on Aug. 24, 2021.
Claims priority of application No. 2013207 (GB), filed on Aug. 24, 2020; application No. 2014876 (GB), filed on Sep. 21, 2020; and application No. 2020164 (GB), filed on Dec. 18, 2020.
Prior Publication US 2024/0086644 A1, Mar. 14, 2024
Int. Cl. G06F 17/00 (2019.01); G06F 16/242 (2019.01); G06F 16/31 (2019.01); G06F 16/332 (2019.01); G06F 16/951 (2019.01); G06F 40/123 (2020.01); G06F 40/126 (2020.01); G06F 40/20 (2020.01); G06F 40/205 (2020.01); G06F 40/211 (2020.01); G06F 40/226 (2020.01); G06F 40/242 (2020.01); G06F 40/279 (2020.01); G06F 40/30 (2020.01); G06F 40/35 (2020.01); G06F 40/45 (2020.01); G06F 40/47 (2020.01); G06F 40/58 (2020.01); G06N 3/0442 (2023.01); G06N 3/0455 (2023.01); G06N 3/0499 (2023.01); G06N 3/08 (2023.01); G06N 5/02 (2023.01); G06Q 10/1053 (2023.01); G06Q 30/0251 (2023.01); G06Q 30/0601 (2023.01); G10L 15/16 (2006.01); G10L 15/18 (2013.01); G10L 15/22 (2006.01); G10L 15/26 (2006.01); G10L 25/63 (2013.01); G16H 10/60 (2018.01); H04L 51/02 (2022.01); G06N 3/091 (2023.01); G10L 15/08 (2006.01)
CPC G06F 40/35 (2020.01) [G06F 16/243 (2019.01); G06F 16/322 (2019.01); G06F 16/3329 (2019.01); G06F 16/951 (2019.01); G06F 40/123 (2020.01); G06F 40/126 (2020.01); G06F 40/20 (2020.01); G06F 40/205 (2020.01); G06F 40/211 (2020.01); G06F 40/226 (2020.01); G06F 40/242 (2020.01); G06F 40/279 (2020.01); G06F 40/30 (2020.01); G06F 40/45 (2020.01); G06F 40/47 (2020.01); G06F 40/58 (2020.01); G06N 3/0442 (2023.01); G06N 3/0455 (2023.01); G06N 3/0499 (2023.01); G06N 3/08 (2013.01); G06N 5/02 (2013.01); G06Q 10/1053 (2013.01); G06Q 30/0255 (2013.01); G06Q 30/0257 (2013.01); G06Q 30/0631 (2013.01); G10L 15/16 (2013.01); G10L 15/1815 (2013.01); G10L 15/22 (2013.01); G10L 15/26 (2013.01); G10L 25/63 (2013.01); G16H 10/60 (2018.01); H04L 51/02 (2013.01); G06N 3/091 (2023.01); G10L 2015/088 (2013.01)] 26 Claims
OG exemplary drawing
 
1. A computer-based system configured to analyse data,
(a) the computer-based system configured to store in a non-transitory computer-readable medium a structured, machine-readable representation of data that conforms to a machine-readable language;
in which the structured machine-readable representation of data includes one or more tenets, statements or other rules defining objectives or motives, any of which we refer to as ‘tenets’, also represented using the structured machine-readable representation of data, the one or more tenets including at least one constraint tenet that prohibits an action or actions;
(b) the computer-based system including a software system, the computer-based system configured to use the tenets, the tenets enabling the software system to scale as the software system learns without addition and debugging of new program code.