15. The computer as claimed in claim 14 , in which the relaxed abduction problem is determined to be: 
 RAP =( T,A,O,∘ A ,∘ O ), wherein: a set of abducible axioms is A, a set of observations is O with T′/O; and further comprising taking orders of preference 
 ∘ A ⊂ P ( A )× P ( A ) and 
 ∘ O ⊂ P ( O )× P ( O ) as a basis for determining ∘-minimal tuples (A,O)εP(A)×P(O), so that T∪A is consistent and T∪A′O holds.
14. A computer system for actuating a technical system, comprising: a processor configured to automatically execute program code stored on a non-transitory computer-readable medium, to: control receipt of at least one observation from at least one sensor; determine a relaxed abduction problem; solve the relaxed abduction problem by determining tuples that are optimal with respect to two preference orders over subsets of assumptions and observations, wherein the determined optimal tuples comprise a subset of observations smaller than a complete set of observations, respectively, that concurrently minimize the subset of assumptions to explain the observations comprising the at least one observation received from the at least one sensor and maximize the subset of observations abductively explained by the subset of assumptions given a theory T, with the objective of determining a causal consequence of the largest possible portion of observations with as few assumptions as possible; and an actuator output port configured to actuate the technical system according to the solution of the relaxed abduction problem.