Event Selection Rules to Compute Explanations

TL;DR

This paper introduces ESeR, a dynamic event selection algorithm that improves the efficiency of explanation computation in CSP solvers, demonstrated on MiniZinc challenge instances.

Contribution

The paper presents ESeR, a novel event selection rules algorithm that enhances explanation computation efficiency in CSP solvers.

Findings

ESeR improves explanation computation efficiency.

Effective on MiniZinc challenge instances.

Enables better backtracking algorithms.

Abstract

Explanations have been introduced in the previous century. Their interest in reducing the search space is no longer questioned. Yet, their efficient implementation into CSP solver is still a challenge. In this paper, we introduce ESeR, an Event Selection Rules algorithm that filters events generated during propagation. This dynamic selection enables an efficient computation of explanations for intelligent backtracking al- gorithms. We show the effectiveness of our approach on the instances of the last three MiniZinc challenges