Towards an embedded approach to declarative problem solving in ASP

Abstract

The strength of answer set programming (ASP) lies in solving computationally challenging problems declaratively, and hopefully efficiently. A similar goal is shared by two other approaches, SAT and Constraint Programming (CP). As future applications of ASP hinge on its underlying solving techniques, in this note, I will briefly comment on the related techniques, and argue for the need of ASP systems to integrate with state-of-the-art techniques for constraint solving, and in general to serve as the core reasoning engine to glue other logics and reasoning mechanisms together. © 2009 Springer Berlin Heidelberg.