16. The computer as claimed in claim 14 , wherein the processor is configured to solve the relaxed abduction problem by transforming the relaxed abduction problem into a hypergraph, so that the tuples (A,O) are encoded by pareto-optimal paths in the hypergraph.
16. The computer as claimed in claim 14 , wherein the processor is configured to solve the relaxed abduction problem by transforming the relaxed abduction problem into a hypergraph, so that the tuples (A,O) are encoded by pareto-optimal paths in the hypergraph. 17. The computer as claimed in claim 16 , wherein the processor is further configured to automatically induce hyperedges of the hypergraph by transcriptions of prescribed rules determined as follows: A ⁢ ⁢ ô ⁢ ⁢ A 1 A ⁢ ⁢ ô ⁢ ⁢ B ⁡ [ A 1 ⁢ ô ⁢ ⁢ B ∈ T ] ( CR1 ) A ⁢ ⁢ ô ⁢ ⁢ A 1 ⁢ A ⁢ ⁢ ô ⁢ ⁢ A 2 A ⁢ ⁢ ô ⁢ ⁢ B ⁡ [ A 1 ⋂ A 2 ⁢ ô ⁢ ⁢ B ∈ T ] ( CR2 ) A ⁢ ⁢ ô ⁢ ⁢ A 1 A ⁢ ⁢ ô ⁢ ⁢ ∃ r · B ⁡ [ A 1 ⁢ ô ⁢ ⁢ ∃ r · B ∈ T ] ( CR3 ) A ⁢ ⁢ ô ⁢ ⁢ ∃ r · A 1 ⁢ A 1 ⁢ ô ⁢ ⁢ A 2 A ⁢ ⁢ ô ⁢ ⁢ B ⁡ [ ∃ r · A 2 ⁢ ô ⁢ ⁢ B ∈ T ] ( CR4 ) A ⁢ ⁢ ô ⁢ ⁢ ∃ r 1 · B A ⁢ ⁢ ô ⁢ ⁢ ∃ s · B ⁡ [ r 1 ⁢ ô ⁢ ⁢ s ∈ T ] ( CR5 ) A ⁢ ⁢ ô ⁢ ⁢ ∃ r 1 · A 1 ⁢ A 1 ⁢ ô ⁢ ⁢ ∃ r 2 · B A ⁢ ⁢ ô ⁢ ⁢ ∃ s · B ⁡ [ r 1 ∘ ⁢ r 2 ⁢ ⁢ ô ⁢ ⁢ s ∈ T ] . ( CR6 )