According to an aspect, a method for providing a minimal explanation to a set of unsatisfiable constraints involves retrieving a minimal subset of constraints that remain together unsatisfiable. The method includes iterating over a list of n constraints, and building a minimal explanation to a set of unsatisfiable constraints by determining which constraint to add to the set of unsatisfiable constraints. Building includes accelerating by removing an increasing number of constraints until removed further constraints makes the set of constraints satisfiable. A dichotomic search is performed on the removed further constraints. The average observed distance is identified between successive constraints in the set of unsatisfiable constraints. A plurality of 2k further constraints located in the list of constraints is removed at the average observed distance from the most recently added constraint. Testing whether a current selected subset is unsatisfiable is performed for the first log2(n) added constraints.
Please help me write a proper abstract based on the patent claims. CLAIM: 1. A computer-implemented method for providing a minimal explanation to a set of unsatisfiable constraints, the computer-implemented method involving retrieving by a processor of a computer, a minimal subset of constraints that remain together unsatisfiable, the computer-implemented method comprising: providing a list of constraints, the list comprising n constraints; and iterating over the list of constraints from a first one of the list of constraints to an nth one of the list of constraints, building a minimal explanation to a set of unsatisfiable constraints by determining by the processor which constraint to add to the set of unsatisfiable constraints, the building comprising: based on determining that a single removed constraint from the list of constraints keeps the set of constraints unsatisfiable, then starting with k=1, repeating removal of a plurality of 2k further constraints adjacent in the list of constraints to the removed constraint and incrementing k until the removed plurality of 2k further constraints makes the set of constraints satisfiable. 2. The computer-implemented method of claim 1, wherein the building further comprises: based on determining that a removed plurality of 2k further constraints makes the set of constraints satisfiable, returning a most recently removed plurality of 2k further constraints to the set of constraints and removing a subset of one half of the plurality of 2k further constraints, iteratively removing one half of the remaining constraints in the plurality of 2k further constraints until the set of constraints is satisfiable, and returning the most recently removed constraints. 3. The computer-implemented method of claim 2, wherein the building further comprises identifying an average observed distance between successive constraints in the set of unsatisfiable constraints. 4. The computer-implemented method of claim 3, wherein the removing a plurality of 2k further constraints further comprises removing a plurality of 2k further constraints located in the list of constraints at the average observed distance from the most recently added constraint in the set of unsatisfiable constraints. 5. The computer-implemented method of claim 4, wherein the building further comprises testing whether the current selected subset is unsatisfiable for the first log2(n) constraints added to the set of unsatisfiable constraints. 6. The computer-implemented method of claim 1, wherein the list of constraints is arranged in a random order. 7. A computer-implemented method for providing a minimal explanation to a set of unsatisfiable constraints, the computer-implemented method involving retrieving by a processor of a computer a minimal subset of constraints that remain together unsatisfiable, the computer-implemented method comprising: iterating over a list of n constraints from a first one of the list of constraints to an nth one of the list of constraints; and building a minimal explanation to a set of unsatisfiable constraints by determining by the processor which constraint to add to the set of unsatisfiable constraints, the building comprising: accelerating by removing an increasing number of constraints until a removed plurality of further constraints makes a set of constraints satisfiable; performing a dichotomic search on the removed plurality of further constraints; identifying an average observed distance between successive constraints in the set of unsatisfiable constraints; removing a plurality of 2k further constraints located in the list of constraints at the average observed distance from a most recently added constraint; and for the first log2(n) added constraints, testing whether a current selected subset is unsatisfiable. 8. The computer-implemented method of claim 7, wherein the list of constraints is arranged in a random order.