# Patent

## Title
Actuation of a technical system based on solutions of relaxed abduction

## Abstract

To enable efficient abduction even for observations that are faulty or inadequately modeled, a relaxed abduction problem is proposed in order to explain the largest possible part of the observations with as few assumptions as possible. On the basis of two preference orders over a subset of observations and a subset of assumptions, tuples can therefore be determined such that the theory, together with the subset of assumptions, explains the subset of observations. The formulation as a multi-criteria optimization problem eliminates the need to offset assumptions made and explained observations against one another. Due to the technical soundness of the approach, specific properties of the set of results (such as correctness, completeness etc.), can be checked, which is particularly advantageous in safety-critical applications. The complexity of the problem-solving process can be influenced and therefore flexibly adapted in terms of domain requirements through the selection of the underlying representation language and preference relations. The invention can be applied to any technical system, e.g. plants or power stations.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
The present application is a 35 U.S.C. §371 national phase application based on PCT/EP2012/062815, filed Jul. 2, 2012, which claims priority of German Patent Application No. 10 2011 079 034.9, filed Jul. 12, 2011, the contents of both of which are incorporated in full by reference herein.
BACKGROUND OF THE INVENTION
The invention relates to a method and an apparatus for actuating a technical system.
Model-based information interpretation (and the application thereof within the framework of model-based diagnosis) is becoming increasingly important. In this context, model-based methods have the advantage of an explicit and comprehensible description of the domain (e.g. of the technical system requiring a diagnosis). Such an explicit model can be examined and understood, which promotes acceptance by the user, particularly in respect of a diagnosis or an interpretation result. In addition, the models can be customized for new machines, extended by new domain knowledge and, depending on the type of presentation, even checked for correctness with reasonable effort. It is also possible to use a vocabulary of the model for man-machine interaction and hence for implementing an interactive interpretation process.
In the case of a logic-based representation of the domain model, the interpretation process is frequently implemented by means of what is known as (logic-based) abduction. This is an attempt to explain the observed information (such as sensor measurements and results from preprocessing processes) by using a formal model. In this context, allowance is made for the fact that the set of observations (e.g. owing to measurement inaccuracies, absence of sensors, etc.) is often incomplete by being able to assume missing information during an explanatory process. In formal terms, the object is thus to determine, for a given model T (also called the “theory”) and a set of observations O, a set A of assumptions (usually as a subset A⊂A from all possible assumptions A) such that the observations O are explained by the model T and also the assumptions A⊂A. In this case, the problem is worded as an optimization problem, i.e. the “best” such set A⊂A of assumptions is sought (according to the optimality criterion, e.g. the smallest set, or the set with the lowest weight).
In the practice of automatic information interpretation and/or diagnosis, there is—besides the problem of missing observations—also the problem that observations exist that cannot be explained with the given model. Typical causes of this are, by way of example, faulty sensors that deliver measured values outside an envisaged range, or else incomplete models that do not take account of at least one arising combination of observations. Such problems clearly restrict the practical usability of abduction-based information interpretation.
The object of the invention is to avoid the disadvantages cited above and to allow an opportunity for abduction even in the case of erroneous observations.
SUMMARY OF THE INVENTION
The object is achieved by proposing a method for actuating a technical system,

    
    
        in which a relaxed abduction problem is determined,
        in which the relaxed abduction problem is solved and the technical system is actuated as appropriate.
    
    


In this context, it should be noted that the actuation may relate to or comprise control, diagnosis or other processing of data from the technical system. In particular, the actuation in this case also comprises diagnosis, for example pertaining to the use of the information during a maintenance interval.
As a result of the wording as a multicriterion optimization problem, there is no longer the need to offset assumptions made and observations explained against one another.
The presented approach is highly generic, i.e. it does not require any assumptions about the preference relations used besides the intuitive stipulation that the addition of a further assumption (in the case of an unaltered observation set) cannot improve the preference and the addition of an explained observation (in the case of an unaltered assumption set) cannot impair the preference.
On account of the formal soundness of the approach, it is possible for particular properties of the result set (such as correctness, completeness, etc.) to be checked and substantiated, which is advantageous particularly in safety-critical applications.
Using the choice of underlying representational language and of preference relations, it is possible for the complexity of the problem solving process to be influenced and thus customized to any domain requirements.
One development is that two orders of preference over a subset of the observations and a subset of the assumptions are taken as a basis for determining tuples, so that the theory together with the subset of the assumptions explains the subset of the observations.
This formalizes the intuitive approach of explaining the largest possible portion of observations seen with as few assumptions as possible; in this case, optimality corresponds to pareto-optimality for the two orders of preference (since maximization of the observations and minimization of the assumptions are opposite or different aims). A solution to the problem consists of pareto-optimal pairs (A,O).
The general definition—based on general orders—of the optimality allows the use of various optimality terms, for example minimum and/or maximum number of elements, subset and/or superset relationship, or minimum and/or maximum sum of the weights of the elements contained.
Another development is that the relaxed abduction problem is determined to be RAP=(T,A,O,≦A,≦O),
wherein


    
    
        the theory T,
        a set of abducible axioms A,
        a set O of observations,

with

        TO and
        the orders of preference

≦A⊂P(A)×P(A) and

≦O⊂P(O)×P(O)

are taken as a basis for determining ≦-minimal tuples (A,O)εP(A)×P(O) so that T∪A is consistent and T∪A|=O holds.

    
    


In this case, the order ≦ is based on the orders ≦A and ≦O as follows:

(A,O)≃(A′,O′)A≃AA′O≃OO′

(A,O)<(A′,O′)(A≦AA′O<OO′)(A<AA′O≦OO′)

(A,O)≦(A′,O′)((A,O)<(A′,O′))((A,O)≃(A′,O′))

Hence, it is proposed that incorrect and missing information are two complementary facets of defective information and are therefore handled in the same way. In addition to the prerequisite that a required piece of information is based on a set of the assumptions A (also referred to as: abducibles or abducible axioms), the relaxed abduction ignores observations from the set O during production of hypotheses if required.
Accordingly, a good solution has a high level of significance for the observations while being based on assumptions as little as possible. Therefore, advantageously, the order ≦A is chosen to be monotone and the order ≦O is chosen to be anti-monotone for subset relationships.
In particular, it is a development that the relaxed abduction problem is solved by transforming the relaxed abduction problem into a hypergraph, so that tuples (A,O) are encoded by pareto-optimal paths in the hypergraph.
It is also a development that the pareto-optimal paths are determined by means of a label approach.
In addition, it is a development that hyperedges of the hypergraph are induced by transcriptions of prescribed rules.
A subsequent development is that the prescribed rules are 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
        )
      
    
  




One embodiment is that a weighted hypergraph HRAP=(V,E) that is induced by the relaxed abduction problem is determined by

V={(AB),(A∃r.B)|A,BεNCT,rεNR},

wherein

VT={(AA),(AT)|AεNCT}⊂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: there is an axiom aεT∪A| that justifies the derivation h(e)εV from T(e)⊂V on the basis of 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
            
          
        
      
    
  




An alternative embodiment is that pX,t=(VX,t,EX,t) is determined as a hyperpath in H=(V,E) from X to t if

    
    
        (1) tεX and pX,t=({t},∅) or
        (2) there is an edge eεE|, so that
        
            h(e)=t, T(e)={y1 . . . yk} holds.
        
        
    
    


In this case, pX,yi| are hyperpaths from X to yi:

V⊃VX,t={t}∪∪yiεT(e)VX,yi,

E⊃EX,t={e}∪∪yiεT(e)EX,yi.

A subsequent embodiment is that shortest hyperpaths are determined by taking account of two preferences.
It is also an embodiment that the shortest hyperpaths are determined by taking account of two preferences by means of a label correction algorithm.
One development is that the labels encode pareto-optimal paths to the hitherto found nodes of the hypergraph.
An additional embodiment is that alterations along the hyperedges are propagated by means of a meet operator and/or by means of a join operator.
Another embodiment is that the relaxed abduction problem is determined by means of a piece of description logic.
The above object is also achieved by means of an apparatus for actuating a technical system comprising a processing unit that is set up such that

    
    
        a relaxed abduction problem can be determined,
        the relaxed abduction problem can be solved and the technical system can be actuated as appropriate.
    
    


The processing unit may, in particular, be a processor unit and/or an at least partially hardwired or logic circuit arrangement that, by way of example, is set up such that the method as described herein can be carried out. Said processing unit may be or comprise any type of processor or computer having correspondingly necessary peripherals (memory, input/output interfaces, input/output devices, etc).
The explanations above relating to the method apply to the apparatus accordingly. The apparatus may be embodied in one component or in distributed fashion in a plurality of components. In particular, it is also possible for a portion of the apparatus to be linked via a network interface (e.g. the Internet).
In addition, the object is achieved by proposing a system or a computer network comprising at least one of the apparatuses described here.
The solution presented herein also comprises a computer program product that can be loaded directly into a memory of a digital computer, comprising program code portions that are suitable for carrying out steps of the method described herein.
In addition, the aforementioned problem is solved by means of a computer-readable storage medium, e.g. an arbitrary memory, comprising instructions (e.g. in the form of program code) that can be executed by a computer and that are suited to the computer carrying out steps of the method described here.
The properties, features and advantages of this invention that are described above and also the manner in which they are achieved will become clearer and more distinctly comprehensible in connection with the schematic description of exemplary embodiments that follows, these being explained in more detail in connection with the drawings. In this case, elements that are the same or that have the same action may be provided with the same reference symbols for the sake of clarity.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1 shows a schematic illustration of an algorithm in pseudo-code notation to provide an exemplary explanation of the propagation of the labels on the basis of rule (CR4);
FIG. 2 shows a schematic block diagram with steps of the method proposed herein;
FIG. 3 shows a schematic block diagram with control units for actuating a technical installation.



DETAILED DESCRIPTION OF THE INVENTION
The solution proposed here comprises particularly the following steps:

    (1) The definition of the logic-based abduction is formally relaxed so as to obtain important properties of defined problems (such as the verifiability of statements about correctness and existence of solutions, etc).
    
        In particular, a relaxed abduction problem (see below: definition 3) is determined. On the basis of two orders of preference over sets of observations or assumptions, “optimal” pairs (also referred to as tuples) (A,O) (with A⊂A, O⊂O) are now intended to be determined, so that the theory T together with the set of assumptions A⊂A explains the observations O⊂O, formally: T∪A|=O.
        This formalizes the intuitive approach of explaining the largest possible portion of the observations seen with as few assumptions as possible; in this case, optimality corresponds to pareto-optimality for the two orders of preference (since maximization of the observations and minimization of the assumptions are opposite or different aims). A solution to the problem consists of all pareto-optimal pairs (A,O).
        The general definition—based on general orders—of the optimality allows the use of various optimality terms, for example minimum and/or maximum number of elements, subset and/or superset relationship, or minimum and/or maximum sum of the weights of the elements contained.
    
    
    (2) In addition, it is proposed that the specified relaxed abduction problem be solved in a suitable manner. In this context, the relaxed abduction problem is translated into a hypergraph such that optimal pairs (A,O) are encoded by pareto-optimal paths in the induced hypergraph. The optimum paths are determined by using a label approach.


Taken together, these two steps allow solutions to an interpretation problem to be found even when it is not possible to explain all observations.
Overall, the field of application of model-based information interpretation (and hence also of model-based diagnosis) is significantly extended by the approach proposed here, since it is now also possible to process situations with an abundance of observation data (or a defectively formulated model). In this case, the demonstrated solution is conservative, i.e. in cases in which a conventional method delivers a solution, a corresponding solution is also provided by the approach proposed here.
Relaxed abduction with a solution is described in detail below.
Although abductive reasoning over principles of description logic knowledge is applied successfully to various information interpretation processes, it cannot provide adequate (or even any) results if it is confronted by incorrect information or incomplete models. The relaxed abduction proposed here solves this problem by ignoring incorrect information, for example. This can be done automatically on the basis of joint optimization of the sets of explained observations and required assumptions. By way of example, a method is presented that solves the relaxed abduction over εζ+ TBoxes based on the notion of shortest hyperpaths with multiple criteria.
Abduction was introduced in the late 19th century by Charles Sanders Pierce as an inference scheme aimed at deriving potential explanations for a particular observation. The rule formulated in this context




  
    φ
    ⊃
    ωω
  
  φ




can be understood as an inversion of the modus ponens rule that allows φ to be derived as a hypothetical explanation for the occurrence of ω, under the assumption that the presence of φ in some sense justifies ω.

This general formulation cannot presuppose any causality between φ and ω in this case. Various notions of how φ justifies the presence of ω give rise to different notions of abductive inference, such as what is known as a set-cover-based approach, logic-based approaches or a knowledge-level approach.
In particular, the present case deals with logic-based abduction over εζ+ TBoxes. Correspondingly, other logic-based presentation schemes are also possible.
On account of its hypothetical nature, an abduction problem does not have a single solution but rather has a collection of alternative answers A1 . . . A2, . . . Ak, from among which optimal solutions are selected by means of an order of preference “<”. The expression

Ai≦Aj 

denotes that Ai is “not worse” that “Aj”, with an indifference

Ai≦AjAj≦Ai, where Ai≃Aj 

and a strict preference

Ai≦AjAj≃Ai where Ai<Aj 

being determined. It is then possible for a (normal) preference-based abduction problem to be defined as follows:

Definition 1: Preference-Based Abduction Problem

PAP=(T,A,O,≦A)

    
    
        In view of a set of axioms T, referred as the “theory”, a set of abducible axioms A, a set O of axioms that represent observations, so that T|≠O holds, and a (not necessarily total) order relationship

≦A⊂P(A)×P(A)|,

        all ≦A-minimal sets A⊂A are determined, so that T∪A is consistent and T∪A|=O holds.
    
    


Typical orders of preference over sets are or comprise

    
    
        subset minimality,

Ai≦sAjAi⊂Aj,

        minimal cardinality

Ai≦cAj|Ai|≦|Aj| or

        weighting-based orders, which are defined by a function ω which assigns numerical weights to subsets of A

Ai≦wAjw(Ai)≦w(Aj).

    
    


The first two orders of preference give preference to a set A over any of its subsets; this monotonicity property is formalized in definition 2 below.
Definition 2: monotone and anti-monotone order

    
    
        An order ≦(<) over sets is monotone (strictly monotone) for a subset relationship if S′⊂S implies S′≦S (or S′⊂S implies S′<S).
        Conversely, an order ≦(<) is anti-monotone (strictly anti-monotone) for a subset relationship if S′⊃S implies S′≦S (S′⊃S implies S′<S).
    
    


Applications of abductive information interpretation using a formal domain model include media interpretation and diagnostics for complex technical systems such as production machines. These domains have many, in some cases simple, observations on account of a large number of sensors, whereas the model for all of these observations is often inadequately or incompletely specified. The following example illustrates how the classical definition of abduction can fail in a specific situation:
Example
Sensitivity to Incorrect Information
A production system comprises a diagnosis unit, wherein the production system has been mapped using a model. The model indicates that a fluctuating supply of current is manifested by intermittent failures in a main control unit, while the communication links remain operational and a mechanical gripper in the production system is unaffected (the observations are deemed to be modeled as a causal consequence of the diagnosis).
It is now assumed that a new additional vibration sensor observes low-frequency vibrations in the system. If the diagnostic model has not yet been extended in respect of this vibration sensor, which means that the observations of the vibration sensor also cannot be taken into account, the low-frequency vibrations delivered by the vibration sensor will unsettle the diagnostic process and prevent effective diagnosis in relation to the supply of current, even though the data delivered by the vibration sensor could actually be totally irrelevant.
Hence, the extension of the system by the vibration sensor results in the diagnosis no longer working reliably.
This flaw is based—according to the above definition of the preferred abduction problem—on the need for an admissible solution to have to explain every single observation oiεO|. This severely restricts the practical applicability of logic-based abduction to real industry applications in which an ever greater number of sensor data items produce and provide information that is not (yet) taken into account by the model.
An extension of logic-based abduction is therefore proposed below, so that even a wealth of data provide the desired results, e.g. diagnoses, flexibly and correctly.
Relaxed Abduction
Whereas, for simple models, it is still possible for incorrect information to be identified and possibly removed in a preprocessing step with a reasonable amount of effort, this is not possible for many real and correspondingly complex models, also because the relevance of a piece of information is dependent on the interpretation thereof and hence is not known in advance.
Hence, it is proposed that incorrect and missing information are two complementary facets of defective information and are therefore handled in the same way. In addition to the prerequisite that a required piece of information is based on the set of the assumptions A (also referred to as: abducibles or abducible axioms), the relaxed abduction ignores observations from the set O during production of hypotheses if required. This is formalized in definition 3.
Definition 3: Relaxed Abduction Problem

RAP=(T,A,O,≦A,≦O)

    
    
        On the basis of a set of axioms T, referred to as the “theory”, a set of abducible axioms A, a set O of axioms that represent observations, so that T|≠O holds, and two (not necessarily total) order relationships

≦A⊂P(A)×P(A) and

≦O⊂P(O)×P(O),

        all ≦-minimal tuples

(A,O)εP(A)×P(O)

        are determined, so that T∪A is consistent and T∪A|=O holds.
        In this case, the order <| is based on the orders ≦A and ≦O as follows:

(A,O)≃(A′,O′)A≃AA′O≃OO′

(A,O)<(A′,O′)(A≦AA′O<OO′)(A<AA′O≦OO′)

(A,O)≦(A′,O′)((A,O)<(A′,O′))(A,O)≃(A′,O′))

    
    


Accordingly, a good solution has a high level of significance for the observations while being based on assumptions as little as possible. Therefore, advantageously, the order ≦A is chosen to be monotone and the order ≦O is chosen to be anti-monotone for subset relationships.
Using inclusion as an order criterion over sets, the following will hold:

A≦AA′A⊂A′ and

O≦OO′O⊃O′. 

For the example cited above with the augmented vibration sensor, a minimal solution that explains all observations apart from the vibrations is obtained on the basis of the order. Therefore, this vibration is not taken into account in the diagnosis, which allows the fluctuating supply of current to be indicated as the result of the diagnosis.
Assertion 1: Conservativeness:

    
    
        A⊂A is a solution for the preference-based abduction problem PAP=(T,A,O,≦A) if (A,O) is a solution to the relaxed abduction problem RAP=(T,A,O,≦A,≦O), specifically for any order ≦O, which is anti-monotone for the subset relationship.
    
    


Evidence:

    
    
        It is assumed that A solves the preferred abduction problem PAP=(T,A,O,≦A). The following then holds:
        
            T∪A is consistent
            T∪A|=O and
            A is ≦A-minimal.
        
        
        Since the order ≦O for the subset relationship is anti-monotone, O is also ≦O-minimal; (A,O) is therefore ≦-minimal and hence solves the relaxed abduction problem RAP.
        Conversely, the following holds: if (A,O) solves the relaxed abduction problem RAP, then the following holds:
        
            T∪A is consistent
            T∪A|=O and
            (A,O) is ≦-minimal.
        
        
        If it is assumed that A≦AA′ holds, so that it follows that: A⊂A′, T∪A′ is consistent and T∪A′|=O, then it holds that: (A′,O)<(A,O), which is inconsistent with the ≦-minimality of (A,O).
    
    


Conservativeness states that under ordinary circumstances relaxed abduction provides all solutions (provided that there are some) to the corresponding standard abduction problem (i.e. the nonrelaxed abduction problem). Since the ≦A-order and the ≦O-order are typically competing optimization aims, it is expedient to treat relaxed abduction as an optimization problem with two criteria. ≦-Minimal solutions then correspond to pareto-optimal points in the space of all combinations (A,O) that meet the logical requirements of a solution (consistency and explanation of the observations).
Assertion 2: Pareto-Optimality of RAP:

    
    
        Let RAP=(T,A,O,≦A,≦O) be a relaxed abduction problem. (A*,O*) is a solution to the relaxed abduction problem RAP if it is a pareto-optimal element (on the basis of the orders ≦A and ≦O) in the solution space

{(A,O)εP(A)×P(O)|T∪A|=OT∪A|≠⊥}. 

    
    


Evidence:

    
    
        If (A*,O*) solves the relaxed abduction problem RAP, then it holds that:
        
            T∪A* is consistent and
            T∪A*|=O*.
        
        
        (A*,O*) is therefore an element of the explanation space (ES); in addition, (A*,O*) is ≦-minimal.
        It is now assumed that (A*,O*) is not pareto-optimal for ES, and also that (A′,O′)εES, so that (without loss of generality) A′<AA* and O′<OO* hold.
        This would result in (A′,O′)<(A*,O*).
        which would be inconsistent with ≦-minimality of (A*,O*). Hence, (A*,O*) is a pareto-optimal element of the explanation space ES.
        Similarly, (A′,O′) is a pareto-optimal element of the explanation space ES. In order to show that the tuple is ≦-minimal, let (A*,O*) be a solution to a relaxed abduction problem RAP, so that the following holds:

(A*,O*)<(A′,O′)

        Without loss of generality, this gives A*<AA′ and O*<OO′, which is inconsistent with the pareto-optimality of (A′,O′). Therefore, (A′,O′) must be ≦-minimal and hence solves the relaxed abduction problem RAP.
    
    


The next section provides an approach in order to solve a relaxed abduction. This approach is based on the simultaneous optimization of ≦A and ≦O.
Solving Relaxed Abduction
The description logic εζ+ is a member of the εζ family, for which a subsumption can be verified in PTIME. εζ+ concept descriptions are defined by

C::=T|A|CC|∃r.C 

(where AεNC is a concept name and rεNR is a role name). εζ+ axioms are

    
    
        concept inclusion axioms CD or
        role inclusion axioms r1 ∘ . . . ∘ rkr

with C, D concept descriptions; r, r1 . . . , rkεNR, k≧1. In this case, NC denotes the set of concept names and NR denotes the set of role names.

    
    


Since any εζ+ TBox can be normalized with only a linear increase in magnitude, it holds that all axioms have one of the following (normal) forms:




  
    
      
        
          A
          1
        
        ⊑
        B
      
    
    
      
        (
        NF1
        )
      
    
  
  
    
      
        
          
            A
            1
          
          ⊓
          
            A
            2
          
        
        ⊑
        B
      
    
    
      
        (
        NF2
        )
      
    
  
  
    
      
        
          A
          1
        
        ⊑
        
          ∃
          
            r
            ·
            B
          
        
      
    
    
      
        (
        NF3
        )
      
    
  
  
    
      
        ∃
        
          
            r
            ·
            
              A
              2
            
          
          ⊑
          B
        
      
    
    
      
        (
        NF4
        )
      
    
  
  
    
      
        
          r
          1
        
        ⊑
        s
      
    
    
      
        (
        NF5
        )
      
    
  
  
    
      
        
          
            r
            1
          
          ∘
          
            r
            2
          
        
        ⊑
        s
      
    
    
      
        (
        NF6
        )
      
    
  




for A1, A2, BεNCT=NC∪{T} and r1, r2, sεNR.

Accordingly, (NF1) describes a concept inclusion “all objects in a class A1 are also objects in a class B”. (NF2) describes: “if an object belongs to class A1 and to class A2 then it also belongs to class B”. This can be shortened to “A1 and A2 are implied by B”. (NF3) denotes: “if an object belongs to class A1 then it is linked to at least one object in class B via a relation r”. Accordingly, (NF4) describes: “if an object is linked to at least one object in class A2 by means of a relation r then said object belongs to class B”. The normal forms (NF5) and (NF6) are obtained accordingly for the roles r1, r2, sεNR.
In addition to standard refutation-based table reasoning, the εζ family allows a completion-based reasoning scheme that explicitly derives valid subsumptions, specifically using a set of rules in the style of Gentzen's sequent calculus (also called “Gentzen calculus”).
The rules (completion rules CR and initialization rules IR) are presented below:




  
    
      
        
          
            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
        )
      
    
  
  
    
      
        
          
            A
            ⊑
            A
          
          _
        
        ⁢
        
          
        
      
    
    
      
        (
        IR1
        )
      
    
  
  
    
      
        
          
            A
            ⊑
            T
          
          _
        
        ⁢
        
          
        
      
    
    
      
        (
        IR2
        )
      
    
  




A graph structure which is produced using the rules allows subsumptions to be derived.
By way of example, it is assumed that both the set of assumptions A and the set of observations O, like the theory T, are axioms of the description logic.
The axiom-oriented representation allows a high level of flexibility and reuse of information.
From Completion Rules to Hypergraphs
Since the rules shown above are a complete evidence system for εζ+, any normalized axiom set can accordingly be mapped as a hypergraph (or as an appropriate representation of such a hypergraph), the nodes of which are axioms of type (NF1) and (NF3) over the concepts and the role names that are used in the axiom set (in line with all statements that are admissible as a premise or conclusion in a derivation step).
Hyperedges of the hypergraph are induced by transpositions of the rules (CR1) to (CR6); by way of example, an instantization of the rule (CR4), which derives CF from C∃r.D and DE using the axiom ∃r.EF, induces a hyperedge

{C∃r.D,DE}→CF. 

This correspondence can also be extended to relaxed abduction problems as follows: Both T and A contain arbitrary εζ+ axioms in normal form that can justify individual derivation steps represented by a hyperedge (in order to simplify the representation, it can be assumed that A∩T=∅ holds).
Elements from the set of all observations O, on the other hand, represent information that is to be justified (i.e. that is derived), and therefore correspond to nodes of the hypergraph. This requires axioms from O to be only of type (NF1) and (NF3); this is a restriction that is usable in practice, since (NF2) axioms and (NF4) axioms can be converted into an (NF1) axiom, specifically using a new concept name, and since role inclusion axioms are not needed in order to express observations about domain objects. Preferably, the hyperedges are provided with a label on the basis of this criterion. This is also evident from the definition below.
Definition 4: Induced Hypergraphs HRAP:

    
    
        Let RAP=(T,A,O,≦A,≦O) be a relaxed abduction problem. A weighted hypergraph HRAP=(V,E), which is induced by RAP, is defined by

V={(AB),(A∃r.B)|A,BεNCT,rεNR}|,

VT={(AA),(AT)|AεNCT}⊂V 

        denotes the set of final states and E denotes the set of all hyperedges

e=(T(e),h(e),w(e)),

        so that the following holds:
        There is an axiom aεT∪A that justifies the derivation h(e)εV from T(e)⊂V on the basis of one of the rules (CR1) to (CR6). The edge weight w(e) is defined by
    
    






  A
  =
  
    {
    
      
        
          
            
              
                {
                a
                }
              
            
            
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    a
                  
                  ∈
                  A
                
                ,
              
            
          
          
            
              ∅
            
            
              otherwise
            
          
        
        ⁢
        
          

        
        ⁢
        O
      
      =
      
        {
        
          
            
              
                {
                
                  h
                  ⁡
                  
                    (
                    e
                    )
                  
                
                }
              
            
            
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      h
                      ⁡
                      
                        (
                        e
                        )
                      
                    
                  
                  ∈
                  O
                
                ,
              
            
          
          
            
              ∅
            
            
              
                otherwise
                ⁢
                
                  
                
              
            
          
        
      
    
  




In this context, it should be noted that the magnitude of HRAP is bounded polynomially in |NC| and |NR|. Checking whether a concept inclusion DE(C∃r.D) can be derived also checks whether the graph contains a hyperpath from VT to the node DE(C∃r.D).
Intuitively, there is a hyperpath from X to t if there is a hyperedge that connects a particular set of nodes Y to t, and each yiεY| can be reached from X via a hyperpath. This is formalized using the definition below.
Definition 5: Hyperpath:

    
    
        pX,t=(VX,t,EX,t) is a hyperpath in H=(V,E) from X to t| if
        (1) tεX and pX,t=({t},∅) or
        (2) there is an edge eεE, so that
        
            h(e)=t,T(e)={y1 . . . , yk} holds.
        
        
        In this case pX,yi are hyperpaths from X to yi:

V⊃VX,t={t}∪∪yiεT(e)VX,yi,

E⊃EX,t={e}∪∪yiεT(e)EX,yi.

Hyperpath Search for Relaxed Abduction

    
    


This section provides an exemplary explanation of an algorithm for solving the relaxed abduction problem RAP. This involves determining the shortest hyperpaths by taking into account two different criteria (multi-aim optimization).
Thus, an extended label correction algorithm for finding shortest paths using two criteria in a graph is proposed on the basis of [Skriver, A. J. V.: A classification of bicriterion shortest path (bsp) algorithms. Asia-Pacific Journal of Operational Research 17, pages 199-212 (2000)]. Thus, the graph is presented in a compact form using two lists S and R (see also: Baader, F., Brandt, S., Lutz, C.: Pushing the EL envelope. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence. Pages 364-369 (2005)). The entries in the list are extended by labels that encode the pareto-optimal paths to the previously found node. Alterations are propagated along the weighted edges using

    
    
        a meet operator ( operator) and
        a join operator ( operator).
    
    


In this case, the meet operator is defined as follows:










Function: meet (L1, L2, just concl)

















Input parameters:
L1
Label set



L2
Label set



just
Axiom in normal form



concl
Axiom in normal form








Output parameter:
Label set for the meet operator   







Result ← {A1 ∪ A2, O1 ∪ O2)|(A1, O1) L1, (A2, O2) ∈ L2};


if just ∈ A then result ← {(A ∪ {just},O)|(A, O) ∈ result};


if concl ∈ O then ←{(A, O) ∪ {concl}, O)|(A, O) ∈ result}


return result;









The join operator can be defined as follows:










Function: join (L1, L2)

















Input parameters
L1
Label set



L2
Label set








Output parameter
Label set for the join operator   







result ← L1 ∪ L2:


result ← remove_dominated (result,  A,  O);


return result:









In this context, it should be noted that the “remove_dominated” functionality removes those labels that code relatively poor paths.
When saturation has been reached, the labels of all <-| minimal paths in HRAP are collected in the set

MP(HRAP):=∪vεVlabel(v).

FIG. 1 shows a schematic illustration of an algorithm in pseudo code notation for the exemplary explanation of the propagation of the labels on the basis of the rule (CR4).
As already explained, the algorithm shown in FIG. 1 is used to produce the labels for the hyperpath of the relaxed abduction problem. In lines 1 to 4, initialization takes place and in the subsequent lines of the code fragment shown, the labels are assigned and alterations to the labels are propagated.
In line 7, all axioms a from T and A are selected in order and for each of these axioms a check is performed to determine whether the individual rules (CR1) to (CR6) apply. This is shown by way of example from line 8 onward for the rule (CR4). If need be, a new label L* is added in line 13 and a check is performed in line 14 to determine whether the label has been changed. If this is the case, the previous label entry is removed in line 15. Accordingly, the labels are added or updated.
In line 17, a check is performed to determine whether saturation has occurred, i.e. no further change is needed to be taken into account.
In this context, it should be noted that even though the order of propagations is irrelevant to correct ascertainment, it can have a significant effect on the number of candidates produced: finding almost optimal solutions may already result in a large number of less-than-optimal solutions in good time, which can be rejected. To improve performance, it is thus possible to use heuristics by first of all exhaustively applying propagations that are determined by elements of T and introducing assumptions only if such propagations are not possible.
Assertion 3: Correctness:

    
    
        The set of all solutions for a relaxed abduction problem RAP=(T,A,O,≦A,≦O) is indicated by a ≦|-minimal closure of MP(HRAP) under component-wise union as per

(A,O)(A′,O′):=(A∪A′,O∪O′).

    
    


Evidence:

    
    
        Hyperpaths in HRAP that begin at VT are derivations. Labels that are constructed on the basis of these hyperpaths can be used in order to encode relevant information that is used during this derivation. According to assertion 2, it is sufficient to show that the proposed algorithm correctly determines the labels for all pareto-optimal paths in HRAP that begin at VT.
        This can be verified inductively on the basis of the correctness of the meet and join operators. This closing synopsis of ∪vεVlabel(v) as a component-wise union is based on the insight that, since the two statements a and b have been verified, it is evidently possible to verify ab by combining the two items of evidence using the meet operator. In graphical terms, this can be regarded as addition of the associated node T, so that any other vεV is connected to the node T by means of a hyperedge ({v}, T, {∅,∅}). The label for this node then encodes all solutions to the relaxed abduction problem, and is calculated as indicated above.
    
    


Since the node labels can grow exponentially with the magnitude A and O, it is worthwhile, for general orders of preference such as the set inclusion, considering the advantage of the present method in comparison with a brute force approach: iteration is performed over all pairs (A,O)εP(A)×P(O), and all tuples (A,O) are collected, so that T∪A|=O holds; finally, all ≦-dominant tuples are eliminated. This approach requires 2|A|+|O| deducibility tests, with each set that passes this test being tested for ≦-minimality. The solution presented is superior to a brute force approach in several respects:

    a) in contrast to the uninformed brute force search outlined above, the approach proposed in this paper realizes an informed search as it does not generate all possible (A,O) pairs at random but rather only those for which the property T∪A|=O actually holds, without requiring any additional deducibility tests. The overall benefit of this property is dependent on the model of T and on the sets A and O. Problems that have only a few solutions therefore benefit most from the present proposal.
    b) Dropping ≦-dominated labels for ≦A and ≦O|, which are (anti-)monotone for set inclusion, reduces the worst case magnitude of node labels by at least a factor O(√{square root over (|A|·|O|)}).
    c) In addition to the upper limits for the magnitude of labels, it is also possible for the expected number of non-dominated paths to a state to be determined as follows: two arbitrary orders over elements of A and O are assumed, so that any subset can be encoded directly as a binary vector of length |A| or |O|. For this, it is possible to deduce that the labels grow on average only in the order of magnitude 1.5|A|+|O| instead of 2|A|+|O|.


Other selections for ≦A and ≦O| can lead to more considerable savings of computation effort, since the orders of preference are used as a pruning criterion while the solution is generated. This allows the present approach to be used for approximation.
If, by way of example, the assumption set and the observation set are compared not by means of set inclusion but rather by means of cardinality, the maximum label magnitude is decreased to |A|·|O|. This could—depending on the order of the rule application—not result in optimal solutions, however.
In a more complex design, e.g. for an installation or a technical system, it is possible to allocate numerical weights for observations and/or abducible axioms so that only such solutions as are substantially poorer than others are dropped. Alternatively, it is possible to use weights (or scores) in order to calculate limits for a maximum number of points that can be achieved by a partial solution; this number of points can be used as pruning criterion.
Hence, the present approach provides an opportunity for relaxed abduction for a description logic. Relaxed abduction extends logic-based abduction by the option of interpreting incorrect information for incomplete models. A solution to relaxed abduction over εζ+ knowledge bases is presented on the basis of pareto-optimal hyperpaths in the derivation graph. The performance of this approach also has critical advantages over that of mere enumeration despite the inherent exponential growth of node labels.
The proposed algorithm can accordingly be applied to other description logics for which it is possible to determine subsumption by means of completion. This is the case for the εζ++ description logic, for example.
The relaxed abduction described in the present case allows various specializations that are obtained from various selection options for ≦A and ≦O. By way of example, approximated solutions can be generated very efficiently (i.e. with a linear label magnitude) if set cardinality is used as a dominance criterion. It is also possible for the axioms to have weights allocated in order to allow early or even lossless pruning of less-than-optimum partial solutions; in this case, the label magnitudes are also reduced.
FIG. 2 shows a schematic block diagram with steps of the method proposed herein: In a step 201, a relaxed abduction problem is determined for the technical system, e.g. on the basis of data from measurement pickups or sensors or other capturable data relating to the technical system. In a step 202, the relaxed abduction problem is solved by determining tuples that are optimal with respect to two preference orders over subsets of assumptions and observations, respectively, while concurrently minimizing the subset of assumptions to explain the observations and maximize a consistency of the observations with the solution 203. In a step 204, the technical system is actuated according to the solution of the relaxed abduction problem.
The technical system may be a technical installation, assembly, process monitoring, a power station or the like.
FIG. 3 shows a schematic block diagram with a control unit 301 that is arranged by way of example within a technical installation 302. In addition, a control unit 303 is provided, which is arranged separately from the technical installation 302 and is connected thereto via a network 304, for example the Internet. Both control units 301, 303 can be used in order to actuate the technical system 302; in particular, it is possible for at least one of the control units 301, 303 to carry out diagnosis for the technical system 302 and/or to set parameters for the technical system 302.
Although the invention has been illustrated and described in more detail using the at least one exemplary embodiment shown, the invention is not restricted thereto and other variations can be derived therefrom by a person skilled in the art without departing from the scope of protection of the invention.

## Claims

1. A method of actuating a technical system, the method comprising:
receiving at least one observation from at least one sensor;
determining, by a computer which is configured to execute program code stored on a non-transitory computer-readable medium, a relaxed abduction problem;
solving, by the computer, 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
actuating the technical system according to the solution of the relaxed abduction problem by communicating at least one actuator signal.

2. The method as claimed in claim 1, 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.

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.

4. The method as claimed in claim 3, wherein the pareto-optimal paths are determined via a label approach.

5. The method as claimed in claim 3, further comprising inducing hyperedges of the hypergraph by transcriptions of prescribed rules.

6. The method as claimed in claim 5, wherein the prescribed rules are determined as follows:




  
    
      
        
          
            A
            ⁢
            
              o
              ^
            
            ⁢
            
              A
              1
            
          
          
            A
            ⁢
            
              o
              ^
            
            ⁢
            B
          
        
        ⁡
        
          [
          
            
              
                A
                1
              
              ⁢
              
                o
                ^
              
              ⁢
              B
            
            ∈
            T
          
          ]
        
      
    
    
      
        (
        CR1
        )
      
    
  
  
    
      
        
          
            A
            ⁢
            
              o
              ^
            
            ⁢
            
              A
              1
            
            ⁢
            A
            ⁢
            
              o
              ^
            
            ⁢
            
              A
              2
            
          
          
            A
            ⁢
            
              o
              ^
            
            ⁢
            B
          
        
        ⁡
        
          [
          
            
              
                A
                1
              
              ⋂
              
                
                  A
                  2
                
                ⁢
                
                  o
                  ^
                
                ⁢
                B
              
            
            ∈
            T
          
          ]
        
      
    
    
      
        (
        CR2
        )
      
    
  
  
    
      
        
          
            A
            ⁢
            
              o
              ^
            
            ⁢
            
              A
              1
            
          
          
            A
            ⁢
            
              o
              ^
            
            ⁢
            
              ∃
              
                r
                .
                B
              
            
          
        
        ⁡
        
          [
          
            
              A
              1
            
            ⁢
            
              o
              ^
            
            ⁢
            
              ∃
              
                
                  r
                  ·
                  B
                
                ∈
                T
              
            
          
          ]
        
      
    
    
      
        (
        CR3
        )
      
    
  
  
    
      
        
          
            A
            ⁢
            
              o
              ^
            
            ⁢
            
              ∃
              
                
                  r
                  ·
                  
                    A
                    1
                  
                
                ⁢
                
                  A
                  1
                
                ⁢
                
                  o
                  ^
                
                ⁢
                
                  A
                  2
                
              
            
          
          
            A
            ⁢
            
              o
              ^
            
            ⁢
            B
          
        
        ⁡
        
          [
          
            ∃
            
              
                
                  r
                  ·
                  
                    A
                    2
                  
                
                ⁢
                
                  o
                  ^
                
                ⁢
                B
              
              ∈
              T
            
          
          ]
        
      
    
    
      
        (
        CR4
        )
      
    
  
  
    
      
        
          
            A
            ⁢
            
              o
              ^
            
            ⁢
            
              ∃
              
                
                  r
                  1
                
                ·
                B
              
            
          
          
            A
            ⁢
            
              o
              ^
            
            ⁢
            
              ∃
              
                s
                ·
                B
              
            
          
        
        ⁡
        
          [
          
            
              
                r
                1
              
              ⁢
              
                o
                ^
              
              ⁢
              
                
              
              ⁢
              s
            
            ∈
            T
          
          ]
        
      
    
    
      
        (
        CR5
        )
      
    
  
  
    
      
        
          
            
              A
              ⁢
              
                o
                ^
              
              ⁢
              
                ∃
                
                  
                    
                      r
                      1
                    
                    ·
                    
                      A
                      1
                    
                  
                  ⁢
                  
                    A
                    1
                  
                  ⁢
                  
                    o
                    ^
                  
                  ⁢
                  
                    ∃
                    
                      
                        r
                        2
                      
                      ·
                      B
                    
                  
                
              
            
            
              A
              ⁢
              
                o
                ^
              
              ⁢
              
                ∃
                
                  s
                  ·
                  B
                
              
            
          
          ⁡
          
            [
            
              
                
                  
                    r
                    1
                  
                  ∘
                  
                    r
                    2
                  
                
                ⁢
                
                  o
                  ^
                
                ⁢
                
                  
                
                ⁢
                s
              
              ∈
              T
            
            ]
          
        
        .
      
    
    
      
        (
        CR6
        )

7. The method as claimed in claim 3, wherein a weighted hypergraph HRAP=(V,E) which is induced by the relaxed abduction problem, is determined by


V={(AôB),(A∃r.B)|A,BεNCT,rεNR},

wherein


VT={(AôA),(AôT)|AεNC1}⊂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
              
            
          
          .

8. The method as claimed in claim 7, wherein pX,t=(VX,t,EX,t) is determined as a hyperpath in H=(V,E) from X to t if
(1) tεX and pX,t=({t},0) or
(2) there is an edge eεE, so that h(e)=t,T(e)=(y1, . . . , yk) holds.

9. The method as claimed in claim 8, wherein shortest hyperpaths are determined by taking account of two preferences.

10. The method as claimed in claim 9, wherein the shortest hyperpaths are determined by taking account of the two preferences via a label correction algorithm.

11. The method as claimed in claim 10, wherein the labels encode pareto-optimal paths to the hitherto found nodes of the hypergraph.

12. The method as claimed in claim 11, wherein alterations along the hyperedges are propagated by a meet operator and/or by a join operator.

13. The method as claimed in claim 1, wherein the relaxed abduction problem is determined via a piece of description logic.

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.

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.

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
        )

18. The computer as claimed in claim 16, wherein the processor is further configured to determine a weighted hypergraph HRAP=(V,E) induced by the relaxed abduction problem: V={(AôB),(A,∃r.B)|A,BεNCT,rεNR},
wherein:
VT={(AôA), (AôT)|AεNC1}⊂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
              
            
          
          
            
              
                0
                ⁢
                
                  
                
                ⁢
                otherwise
              
            
          
        
        ⁢
        
          
        
        ⁢
        O
      
      =
      
        {
        
          
            
              
                
                  
                    
                      {
                      
                        h
                        ⁡
                        
                          (
                          e
                          )
                        
                      
                      }
                    
                    ⁢
                    
                      
                    
                    ⁢
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      h
                      ⁡
                      
                        (
                        e
                        )
                      
                    
                  
                  ∈
                  O
                
              
            
            
              
                
                  0
                  ⁢
                  
                    
                  
                  ⁢
                  otherwise
                
              
            
          
          .

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.