19. A method of controlling a technical system, comprising: receiving at least one observation from at least one sensor; determining a relaxed abduction problem; determining a pareto-optimum set of tuples (A,O) by taking as a basis two orders of preference over a subset of observations (O) smaller than a complete set of observations, and a subset of assumptions (A), so that a theory (T) together with a minimized subset of the assumptions (A) explains a maximized subset of the observations (O) comprising the at least one observation (O) received from the at least one sensor, with the objective of determining a causal consequence of the largest possible portion of subset of observations (O) with as few members of the subset of assumptions (A) as possible; defining a solution to the determined relaxed abduction problem, by an automated computer which executes program code stored on a non-transitory computer-readable medium; and actuating the technical system in accordance with the defined solution.
19. A method of controlling a technical system, comprising: receiving at least one observation from at least one sensor; determining a relaxed abduction problem; determining a pareto-optimum set of tuples (A,O) by taking as a basis two orders of preference over a subset of observations (O) smaller than a complete set of observations, and a subset of assumptions (A), so that a theory (T) together with a minimized subset of the assumptions (A) explains a maximized subset of the observations (O) comprising the at least one observation (O) received from the at least one sensor, with the objective of determining a causal consequence of the largest possible portion of subset of observations (O) with as few members of the subset of assumptions (A) as possible; defining a solution to the determined relaxed abduction problem, by an automated computer which executes program code stored on a non-transitory computer-readable medium; and actuating the technical system in accordance with the defined solution. 20. The method according to claim 19 , further comprising transforming the relaxed abduction problem into a hypergraph, so that the tuples (A,O) are encoded by pareto-optimal paths in the hypergraph.