  Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming
(ASP) are based on sophisticated Boolean constraint solving techniques. In both
areas, conflict-driven learning and related techniques constitute key features
whose application is enabled by conflict analysis. Although various conflict
analysis schemes have been proposed, implemented, and studied both
theoretically and practically in the SAT area, the heuristic aspects involved
in conflict analysis have not yet received much attention. Assuming a fixed
conflict analysis scheme, we address the open question of how to identify
"good'' reasons for conflicts, and we investigate several heuristics for
conflict analysis in ASP solving. To our knowledge, a systematic study like
ours has not yet been performed in the SAT area, thus, it might be beneficial
for both the field of ASP as well as the one of SAT solving.
