reasons: $(i)$ ASP solvers are nowadays efficient CDCL implementations; $(ii)$ ASP has been applied to a variety of complex problems including hard industrial ones. In the following we first describe the implementation of our framework in a well-known ASP solver and, then, we report on the solution of two real-world configuration problems occurring in practice of Siemens: the Partner Units Problem ([PUP]{}) and the Combined Configuration Problem ([CCP]{}). These appeared to be among the hardest industrial benchmarks from the ASP Competition 2015 [@DBLP:conf/lpnmr/GebserMR15; @aspweb]; indeed, on hard problem instances state-of-the-art ASP solvers were not effective. Given the practical importance of these two problems, many researchers studied them in detail [@Falkner2010; @DBLP:conf/cpaior/AschingerDFGJRT11; @DBLP:conf/ijcai/AschingerDGJT11; @DBLP:conf/iaai/TeppanFF12; @DBLP:conf/ictai/Drescher12; @DBLP:conf/lpnmr/GebserRS15]. Their investigations resulted in a number of domain-specific heuristic approaches that, in some cases, significantly outperformed existing ASP solvers. We experimented with these heuristics, thus applying our framework in practice, to see whether these can be integrated successfully in a CDCL solver.

Implementation of the framework
-------------------------------

The framework has been implemented as an extension of the ASP solver [<span style="font-variant:small-caps;">wasp</span>]{}. [<span style="font-variant:small-caps;">wasp</span>]{}implements a variant of CDCL devised for evaluating ASP programs, thus featuring additional inference rules required for the evaluation of ASP programs, such 