Abstract
Due to the development of efficient solvers, declarative problem solving frameworks based on model generation are becoming more and more applicable in practice. However, there are almost no tools to support debugging in these frameworks. For several reasons, current solvers are not suitable for debugging by tracing. In this paper, we propose a new solver algorithm for one of these frameworks, namely Model Expansion, that allows for debugging by tracing. We explain how to explore the trace of this solver in order to quickly locate a bug and we compare our debugging method with existing ones for Answer Set Programming and the Alloy system. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Wittocx, J., Vlaeminck, H., & Denecker, M. (2009). Debugging for model expansion. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5649 LNCS, pp. 296–311). https://doi.org/10.1007/978-3-642-02846-5_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
