Control of a machine using relaxed abduction method
First Claim
1. A method for actuating a machine, comprising:
- determining, by a processing unit, a solution using relaxed abduction for a defined problem related to incorrect information or incomplete models associated with diagnosis of the machine using automatically joint optimization of sets of explained observations and required assumptions to determine a relaxed abduction problem,solving, by a processing unit, the relaxed abduction problem so that the machine is actuated,wherein the relaxed abduction problem is determined by description logic, andactuating, by a processing unit, the machine for the diagnosis,wherein 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;
wherein 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;
wherein hyperedges of the hypergraph are induced by transcriptions of prescribed rules; and
wherein a weighted hypergraph HRAP=(V,E), which is induced by the relaxed abduction problem, is determined by
3 Assignments
0 Petitions
Accused Products
Abstract
A method and apparatus for actuating a machine is provided in which a relaxed abduction problem is determined in order to explain the greatest possible part of the observations with the fewest possible assumptions. Based upon two preference orders over a subset of observations and a subset of assumptions, tuples are determined so that the theory together with the subset of assumptions explains the subset of observations. On the basis of the formal validity of the approach certain characteristics of the set of results (such as correctness, completeness, etc.) are checked. By the choice of underlying representational language and the preference relations, the complexity of the problem-solving process is influenced and thus flexibly adapted with regard to domain requirements. The invention may be used for any machines, e.g. gas turbines or steam turbines.
8 Citations
12 Claims
-
1. A method for actuating a machine, comprising:
-
determining, by a processing unit, a solution using relaxed abduction for a defined problem related to incorrect information or incomplete models associated with diagnosis of the machine using automatically joint optimization of sets of explained observations and required assumptions to determine a relaxed abduction problem, solving, by a processing unit, the relaxed abduction problem so that the machine is actuated, wherein the relaxed abduction problem is determined by description logic, and actuating, by a processing unit, the machine for the diagnosis, wherein 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; wherein 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; wherein hyperedges of the hypergraph are induced by transcriptions of prescribed rules; and wherein a weighted hypergraph HRAP=(V,E), which is induced by the relaxed abduction problem, is determined by - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10)
-
-
11. An apparatus for actuating a machine, comprising:
a processing unit adapted to determine a solution using relaxed abduction for a problem related to incorrect information or incomplete models associated with diagnosis of the machine using automatically joint optimization of sets of explained observations and required assumptions to determine a relaxed abduction problem, solve the relaxed abduction problem so that the machine can be actuated, wherein the relaxed abduction problem is determined by description logic, and actuate the machine for the diagnosis, wherein two orders of preference over a subset of observations and a subset of assumptions are taken as a basis for determining tuples, so that a theory together with the subset of the assumptions explains the subset of the observations; wherein 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; wherein hyperedges of the hypergraph are induced by transcriptions of prescribed rules; and wherein a weighted hypergraph HRAP=(V,E), which is induced by the relaxed abduction problem, is determined by - View Dependent Claims (12)
Specification