3. The method as claimed in claim 1 , wherein the relaxed abduction problem is solved by transforming the relaxed abduction problem into a hypergraph, so that the tuples (A,O) are encoded by pareto-optimal paths in the hypergraph.
3. The method as claimed in claim 1 , wherein the relaxed abduction problem is solved by transforming the relaxed abduction problem into a hypergraph, so that the tuples (A,O) are encoded by pareto-optimal paths in the hypergraph. 7. The method as claimed in claim 3 , wherein a weighted hypergraph H RAP =(V,E) which is induced by the relaxed abduction problem, is determined by 
 V ={( AôB ),( A∃r.B )| A,BεN C T ,rεN R }, wherein 
 V T ={( AôA ),( AôT )| AεN C 1 } ⊂ V denotes a set of final states and E denotes a set of the hyperedges 
 e =( T ( e ), h ( e ), w ( e )), so that the following holds: an axiom aεT∪A exists that justifies derivation h(e)εV from T(e) ⊂ V based on one of the prescribed rules, wherein the edge weight w(e) is determined according to A = { { a } if ⁢ ⁢ a ∈ A , ∅ otherwise ⁢ ⁢ O = { { h ⁡ ( e ) } if ⁢ ⁢ h ⁡ ( e ) ∈ O ∅ otherwise .