Interpreting Abduction in CLP

Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an ecient abductive solver where abducibles are treated as constraints. We propose two pos- sible implementations, in which integrity constraints are exploited either (i) as the definition of a CLP solver on an abductive domain, or (ii) as constraintsla CLP. Both the solvers are implemented on top of CLP(Bool), that typically have impressively ecient propagation en- gines.