A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf
.
Debugging overconstrained declarative models using unsatisfiable cores
18th IEEE International Conference on Automated Software Engineering, 2003. Proceedings.
Declarative models, in which conjunction and negation are freely used, are susceptible to unintentional overconstraint. Core extraction is a new analysis that mitigates this problem in the context of a checker based on reduction to SAT. It exploits a recently developed facility of SAT solvers that provides an "unsatisfiable core" of an unsatisfiable set of clauses, often much smaller than the clause set as a whole. The unsatisfiable core is mapped back into the syntax of the original model,
doi:10.1109/ase.2003.1240298
dblp:conf/kbse/ShlyakhterSJST03
fatcat:uy7vmcigrbcc7m3myarr7x6w6y