Method of explaining a solution of a declarative problem encoding
OwnerTobias Geibinger, Johannes Oetsch +1inventors
InventorsTobias Geibinger, Johannes Oetsch, Tobias Kaminski
Life of this patent
Estimating the term…
Abstract
A computer-implemented method of explaining a solution of a declarative problem encoding. The solution and a natural language question about the latter are provided to a machine learning system, which determines auxiliary constraints 21 opposing the questions premise. The declarative problem solver identifies conflicts between these auxiliary constraints and the constraints of the declarative problem encoding. The machine learning system then determines an explanation based on the conflicting constraints of the declarative problem encoding.
Claims10
A computer-implemented method of determining an explanation for a solution of a declarative problem encoding determined by a declarative problem solver, the declarative problem encoding including constraints, the method comprising the following steps:
- providing the solution and a natural language question regarding a presence or absence of elements within the solution to a machine learning system;
- determining, by the machine learning system, auxiliary constraints that enforce a condition contrary to a premise of the natural language question;
- determining, by the declarative problem solver, at least one minimal violated set of constraints of the declarative problem encoding based on the auxiliary constraints combined with the declarative problem encoding, wherein the at least one minimal violated set is inconsistent with the auxiliary constraints;
- and
- determining, by the machine learning system, an explanation text that includes the explanation for the solution based on the at least one minimal violated set.
A data processing system, comprising:
- a processor configured to perform a method of determining an explanation for a solution of a declarative problem encoding determined by a declarative problem solver, the declarative problem encoding including constraints, the method including the following steps:
- providing the solution and a natural language question regarding a presence or absence of elements within the solution to a machine learning system;
- determining, by the machine learning system, auxiliary constraints that enforce a condition contrary to a premise of the natural language question;
- determining, by the declarative problem solver, at least one minimal violated set of constraints of the declarative problem encoding based on the auxiliary constraints combined with the declarative problem encoding, wherein the at least one minimal violated set is inconsistent with the auxiliary constraints;
- and
- determining, by the machine learning system, an explanation text that includes the explanation for the solution based on the at least one minimal violated set.
A non-transitory computer-readable data carrier on which is stored a computer program for determining an explanation for a solution of a declarative problem encoding determined by a declarative problem solver, the declarative problem encoding including constraints, the computer program, when executed by a computer, causing the computer to perform the following steps:
- providing the solution and a natural language question regarding a presence or absence of elements within the solution to a machine learning system;
- determining, by the machine learning system, auxiliary constraints that enforce a condition contrary to a premise of the natural language question;
- determining, by the declarative problem solver, at least one minimal violated set of constraints of the declarative problem encoding based on the auxiliary constraints combined with the declarative problem encoding, wherein the at least one minimal violated set is inconsistent with the auxiliary constraints;
- and
- determining, by the machine learning system, an explanation text that includes the explanation for the solution based on the at least one minimal violated set.
Dependencies are inferred from the claim text.